default search action
Amr Elmasry
Person information
- affiliation: Egypt University of Informatics, Cairo, Egypt
- affiliation (former): Max Planck Institute for Informatics, Saarbücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j42]Marwan A. Hefnawy, Saad M. Darwish
, Amr Elmasry:
Tuning the Evaporation Parameter in ACO MANET Routing Using a Satisfaction-Form Game-Theoretic Approach. IEEE Access 10: 98004-98012 (2022) - [j41]Amr Elmasry
Regular numeral systems for data structures. Acta Informatica 59(2-3): 245-281 (2022) - 2021
- [j40]Omar Darwish, Amr Elmasry, Jyrki Katajainen:
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. ACM Trans. Algorithms 17(2): 18:1-18:19 (2021)
2010 – 2019
- 2019
- [j39]Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem:
Red-black trees with constant update time. Acta Informatica 56(5): 391-404 (2019) - [j38]Ahmed A. Belal
Optimal prefix codes with fewer distinct codeword lengths are faster to construct. Inf. Comput. 268 (2019) - [j37]Amr Elmasry
A new algorithm for the shortest-path problem. Networks 74(1): 16-39 (2019) - [c50]Saad M. Darwish
Parameter Estimation for Chaotic Systems Using the Fruit Fly Optimization Algorithm. AMLTA 2019: 80-90 - [c49]Saad M. Darwish
Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm. AMLTA 2019: 91-101 - 2018
- [j36]Stefan Canzar
On the approximability of the maximum interval constrained coloring problem. Discret. Optim. 27: 57-72 (2018) - [i11]Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem:
Red-Black Trees with Constant Update Time. CoRR abs/1804.02112 (2018) - 2017
- [j35]Stefan Edelkamp
Heap Construction - 50 Years Later. Comput. J. 60(5): 657-674 (2017) - [j34]Amr Elmasry, Claus Jensen
Bipartite binomial heaps. RAIRO Theor. Informatics Appl. 51(3): 121-133 (2017) - [j33]Stefan Edelkamp
Optimizing Binary Heaps. Theory Comput. Syst. 61(2): 606-636 (2017) - [j32]Amr Elmasry:
Toward Optimal Self-Adjusting Heaps. ACM Trans. Algorithms 13(4): 55:1-55:14 (2017) - [r2]Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Indexing Schemes for Multidimensional Moving Objects. Encyclopedia of GIS 2017: 947-954 - 2016
- [j31]Amr Elmasry, Meng He
Dynamic range majority data structures. Theor. Comput. Sci. 647: 59-73 (2016) - [c48]Amr Elmasry, Ayman Khalafallah, Moustafa Meshry:
A scalable maximum-clique algorithm using Apache Spark. AICCSA 2016: 1-8 - [c47]Amr Elmasry, Frank Kammer:
Space-Efficient Plane-Sweep Algorithms. ISAAC 2016: 30:1-30:13 - [c46]Reem Elkhouly, Ahmed El-Mahdy, Amr Elmasry:
Optimality analysis of if-conversion transformation. SpringSim (HPS) 2016: 23 - 2015
- [j30]Amr Elmasry:
Counting inversions adaptively. Inf. Process. Lett. 115(10): 769-772 (2015) - [c45]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. CSR 2015: 204-218 - [c44]Reem Elkhouly, Ahmed El-Mahdy, Amr Elmasry:
2-Bit Branch Predictor Modeling Using Markov Model. SCSE 2015: 650-653 - [c43]Amr Elmasry, Torben Hagerup, Frank Kammer:
Space-efficient Basic Graph Algorithms. STACS 2015: 288-301 - [i10]Amr Elmasry:
Counting Inversions Adaptively. CoRR abs/1503.01192 (2015) - [i9]Amr Elmasry, Frank Kammer:
Space-Efficient Plane-Sweep Algorithms. CoRR abs/1507.01767 (2015) - [i8]Omar Darwish, Amr Elmasry, Jyrki Katajainen:
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. CoRR abs/1510.07185 (2015) - 2014
- [j29]Amr Elmasry, Yung H. Tsin:
On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs. Int. J. Found. Comput. Sci. 25(3): 355-368 (2014) - [j28]Amr Elmasry, Daniel Dahl Juhl
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554: 64-73 (2014) - [c42]Omar Darwish, Amr Elmasry:
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem. ESA 2014: 284-295 - [i7]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. CoRR abs/1407.3342 (2014) - [i6]Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry:
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. CoRR abs/1407.3377 (2014) - 2013
- [j27]Amr Elmasry, Arash Farzan, John Iacono
On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50(4): 289-295 (2013) - [j26]Amr Elmasry, Jyrki Katajainen:
Fat Heaps without Regular Counters. Discret. Math. Algorithms Appl. 5(2) (2013) - [j25]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Weak heaps engineered. J. Discrete Algorithms 23: 83-97 (2013) - [j24]Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72(1): 112-121 (2013) - [c41]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from Read-Only Memory with Limited Workspace. COCOON 2013: 147-157 - [c40]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
Weak Heaps and Friends: Recent Developments. IWOCA 2013: 1-6 - [c39]Amr Elmasry, Jyrki Katajainen:
In-Place Binary Counters. MFCS 2013: 349-360 - [c38]Tetsuo Asano, Amr Elmasry, Jyrki Katajainen:
Priority Queues and Sorting for Read-Only Data. TAMC 2013: 32-41 - [c37]Amr Elmasry, Jyrki Katajainen:
Branchless Search Programs. SEA 2013: 127-138 - 2012
- [j23]Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica 62(3-4): 754-766 (2012) - [j22]Amr Elmasry:
On the size of the subset partial order. Inf. Process. Lett. 112(12): 487-489 (2012) - [j21]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16: 187-205 (2012) - [j20]Amr Elmasry, Arash Farzan, John Iacono:
A priority queue with the time-finger property. J. Discrete Algorithms 16: 206-212 (2012) - [j19]Amr Elmasry:
Enumerating trichromatic triangles containing the origin in linear time. J. Discrete Algorithms 17: 45-50 (2012) - [j18]Amr Elmasry, Claus Jensen
Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50(1): 185-211 (2012) - [c36]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS 2012: 103-112 - [c35]Amr Elmasry, Jyrki Katajainen:
Worst-Case Optimal Priority Queues via Extended Regular Counters. CSR 2012: 125-137 - [c34]Amr Elmasry, Jyrki Katajainen:
Lean Programs, Branch Mispredictions, and Sorting. FUN 2012: 119-130 - [c33]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
A Catalogue of Algorithms for Building Weak Heaps. IWOCA 2012: 249-262 - [c32]Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS 2012: 259-270 - [c31]Amr Elmasry, Jyrki Katajainen, Jukka Teuhola:
Improved Address-Calculation Coding of Integer Arrays. SPIRE 2012: 205-216 - [c30]Amr Elmasry, Jyrki Katajainen:
Fat Heaps without Regular Counters. WALCOM 2012: 173-185 - [c29]Amr Elmasry, Jyrki Katajainen, Max Stenmark:
Branch Mispredictions Don't Affect Mergesort. SEA 2012: 160-171 - 2011
- [j17]Khaled M. Elbassioni
Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geom. Appl. 21(5): 495-506 (2011) - [c28]Amr Elmasry, Meng He
Dynamic Range Majority Data Structures. ISAAC 2011: 150-159 - [c27]Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA 2011: 195-208 - [c26]Amr Elmasry, Arash Farzan, John Iacono:
A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA 2011: 209-222 - [i5]Amr Elmasry, Jyrki Katajainen:
Worst-Case Optimal Priority Queues via Extended Regular Counters. CoRR abs/1112.0993 (2011) - 2010
- [j16]Amr Elmasry:
The Violation Heap: a Relaxed Fibonacci-like Heap. Discret. Math. Algorithms Appl. 2(4): 493-504 (2010) - [j15]Amr Elmasry:
Pairing heaps, scrambled pairing and square-root trees. Int. J. Comput. Math. 87(14): 3096-3110 (2010) - [j14]Amr Elmasry:
The longest almost-increasing subsequence. Inf. Process. Lett. 110(16): 655-658 (2010) - [c25]Amr Elmasry:
The Subset Partial Order: Computing and Combinatorics. ANALCO 2010: 27-33 - [c24]Amr Elmasry:
The Longest Almost-Increasing Subsequence. COCOON 2010: 338-347 - [c23]Amr Elmasry:
The Violation Heap: A Relaxed Fibonacci-Like Heap. COCOON 2010: 479-488 - [c22]Amr Elmasry:
Pairing Heaps with Costless Meld. ESA (2) 2010: 183-193 - [c21]Amr Elmasry, Claus Jensen
The Magic of a Number System. FUN 2010: 156-165 - [c20]Stefan Canzar
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) 2010: 168-179 - [c19]Amr Elmasry:
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. ISAAC (2) 2010: 375-386 - [c18]Amr Elmasry, Claus Jensen
Strictly-Regular Number System and Data Structures. SWAT 2010: 26-37 - [i4]Amr Elmasry, Arash Farzan, John Iacono:
Priority Queues with Multiple Time Fingers. CoRR abs/1009.5538 (2010)
2000 – 2009
- 2009
- [j13]Amr Elmasry:
Computing the subset partial order for dense families of sets. Inf. Process. Lett. 109(18): 1082-1086 (2009) - [c17]Amr Elmasry:
Pairing heaps with O(log log n) decrease cost. SODA 2009: 471-476 - [i3]Amr Elmasry:
Pairing Heaps with Costless Meld. CoRR abs/0903.4130 (2009) - 2008
- [j12]Amr Elmasry, Michael L. Fredman:
Adaptive sorting: an information theoretic perspective. Acta Informatica 45(1): 33-42 (2008) - [j11]Amr Elmasry, Claus Jensen
Two-tier relaxed heaps. Acta Informatica 45(3): 193-210 (2008) - [j10]Amr Elmasry, Claus Jensen
Two new methods for constructing double-ended priority queues from priority queues. Computing 83(4): 193-204 (2008) - [j9]Amr Elmasry, Abdelrahman Hammad:
Inversion-sensitive sorting algorithms in practice. ACM J. Exp. Algorithmics 13 (2008) - [j8]Amr Elmasry, Claus Jensen
Multipartite priority queues. ACM Trans. Algorithms 5(1): 14:1-14:19 (2008) - [r1]Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Indexing Schemes for Multi-dimensional Moving Objects. Encyclopedia of GIS 2008: 523-529 - [i2]Amr Elmasry:
Violation Heaps: A Better Substitute for Fibonacci Heaps. CoRR abs/0812.2851 (2008) - 2007
- [c16]Amr Elmasry, Claus Jensen, Jyrki Katajainen:
On the Power of Structural Violations in Priority Queues. CATS 2007: 45-53 - [c15]Amr Elmasry, Kazuhisa Makino:
Finding Intersections of Bichromatic Segments Defined by Points. CCCG 2007: 269-272 - 2006
- [j7]Amr Elmasry:
A Priority Queue with the Working-set Property. Int. J. Found. Comput. Sci. 17(6): 1455-1466 (2006) - [j6]Ahmed A. Belal
Verification of minimum-redundancy prefix codes. IEEE Trans. Inf. Theory 52(4): 1399-1404 (2006) - [c14]Amr Elmasry, Claus Jensen
Two-Tier Relaxed Heaps. ISAAC 2006: 308-317 - [c13]Ahmed A. Belal, Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. STACS 2006: 92-103 - 2005
- [j5]Khaled M. Elbassioni
An Indexing Method for Answering Queries on Moving Objects. Distributed Parallel Databases 17(3): 215-249 (2005) - [j4]Amr Elmasry:
Deterministic Jumplists. Nord. J. Comput. 12(1): 27-39 (2005) - [c12]Ahmed A. Belal, Amr Elmasry:
Finding maximum-cost minimum spanning trees. AICCSA 2005: 14 - [c11]Amr Elmasry, Khaled M. Elbassioni:
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. CCCG 2005: 248-251 - [c10]Amr Elmasry, Abdelrahman Hammad:
An Empirical Study for Inversions-Sensitive Sorting Algorithms. WEA 2005: 597-601 - [i1]Ahmed A. Belal, Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. CoRR abs/cs/0509015 (2005) - 2004
- [j3]Amr Elmasry:
Parameterized self-adjusting heaps. J. Algorithms 52(2): 103-119 (2004) - [j2]Amr Elmasry:
On the sequential access theorem and deque conjecture for splay trees. Theor. Comput. Sci. 314(3): 459-466 (2004) - [c9]Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich:
A stronger version of Bárány's theorem in the plane. CCCG 2004: 4-6 - [c8]Amr Elmasry:
Adaptive Sorting with AVL Trees. IFIP TCS 2004: 307-316 - [c7]Amr Elmasry:
Layered Heaps. SWAT 2004: 212-222 - 2003
- [c6]Khaled M. Elbassioni
An Efficient Indexing Scheme for Multi-dimensional Moving Objects. ICDT 2003: 422-436 - [c5]Amr Elmasry:
Three Sorting Algorithms Using Priority Queues. ISAAC 2003: 209-220 - [c4]Amr Elmasry, Michael L. Fredman:
Adaptive Sorting and the Information Theoretic Lower Bound. STACS 2003: 654-662 - [c3]Amr Elmasry:
Distribution-Sensitive Binomial Queues. WADS 2003: 103-113 - 2002
- [c2]Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Efficient answering of polyhedral queries in rd using bbs-trees. CCCG 2002: 54-57 - [c1]Amr Elmasry:
Priority Queues, Pairing, and Adaptive Sorting. ICALP 2002: 183-194
1990 – 1999
- 1998
- [j1]Ahmed A. Belal, Amr Elmasry:
Reaching the Bound in the (2, n) merging Problem. Inf. Sci. 111(1-4): 261-271 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: