Amr Elmasry

ORCID

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 18

Top Venues

CoRR

Acta Informatica

ACM Trans. Algorithms

AMLTA

Publications

Amr Elmasry, Jyrki Katajainen
Regular numeral systems for data structures. Acta Informatica 59 (2-3) (2022)
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 (2022)
Omar Darwish, Amr Elmasry, Jyrki Katajainen
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. ACM Trans. Algorithms 17 (2) (2021)
Saad M. Darwish, Amr Elmasry, Asmaa H. Ibrahim
Parameter Estimation for Chaotic Systems Using the Fruit Fly Optimization Algorithm. AMLTA (2019)
Ahmed A. Belal, Amr Elmasry
Optimal prefix codes with fewer distinct codeword lengths are faster to construct. Inf. Comput. 268 (2019)
Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem
Red-black trees with constant update time. Acta Informatica 56 (5) (2019)
Saad M. Darwish, Amr Elmasry, Shaymaa H. Ibrahim
Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm. AMLTA (2019)
Amr Elmasry, Ahmed Shokry
A new algorithm for the shortest-path problem. Networks 74 (1) (2019)
Amr Elmasry, Mostafa Kahla, Fady Ahdy, Mahmoud Hashem
Red-Black Trees with Constant Update Time. CoRR (2018)
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
On the approximability of the maximum interval constrained coloring problem. Discret. Optim. 27 (2018)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Heap Construction - 50 Years Later. Comput. J. 60 (5) (2017)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Optimizing Binary Heaps. Theory Comput. Syst. 61 (2) (2017)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Bipartite binomial heaps. RAIRO Theor. Informatics Appl. 51 (3) (2017)
Amr Elmasry
Toward Optimal Self-Adjusting Heaps. ACM Trans. Algorithms 13 (4) (2017)
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic range majority data structures. Theor. Comput. Sci. 647 (2016)
Reem Elkhouly, Ahmed El-Mahdy, Amr Elmasry
Optimality analysis of if-conversion transformation. SpringSim (HPS) (2016)
Amr Elmasry, Ayman Khalafallah, Moustafa Meshry
A scalable maximum-clique algorithm using Apache Spark. AICCSA (2016)
Amr Elmasry, Frank Kammer
Space-Efficient Plane-Sweep Algorithms. ISAAC (2016)
Amr Elmasry, Torben Hagerup, Frank Kammer
Space-efficient Basic Graph Algorithms. STACS (2015)
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)
Reem Elkhouly, Ahmed El-Mahdy, Amr Elmasry
2-Bit Branch Predictor Modeling Using Markov Model. SCSE (2015)
Amr Elmasry
Counting Inversions Adaptively. CoRR (2015)
Amr Elmasry, Frank Kammer
Space-Efficient Plane-Sweep Algorithms. CoRR (2015)
Omar Darwish, Amr Elmasry, Jyrki Katajainen
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. CoRR (2015)
Amr Elmasry
Counting inversions adaptively. Inf. Process. Lett. 115 (10) (2015)
Amr Elmasry, Yung H. Tsin
On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs. Int. J. Found. Comput. Sci. 25 (3) (2014)
Omar Darwish, Amr Elmasry
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem. ESA (2014)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from read-only memory with limited workspace. CoRR (2014)
Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. CoRR (2014)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554 (2014)
Amr Elmasry, Arash Farzan, John Iacono
On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50 (4) (2013)
Amr Elmasry, Jyrki Katajainen
In-Place Binary Counters. MFCS (2013)
Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
Priority Queues and Sorting for Read-Only Data. TAMC (2013)
Amr Elmasry, Jyrki Katajainen
Fat Heaps without Regular Counters. Discret. Math. Algorithms Appl. 5 (2) (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Weak heaps engineered. J. Discrete Algorithms 23 (2013)
Amr Elmasry, Jyrki Katajainen
Branchless Search Programs. SEA (2013)
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. J. Graph Theory 72 (1) (2013)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from Read-Only Memory with Limited Workspace. COCOON (2013)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
Weak Heaps and Friends: Recent Developments. IWOCA (2013)
Amr Elmasry, Arash Farzan, John Iacono
A priority queue with the time-finger property. J. Discrete Algorithms 16 (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
A Catalogue of Algorithms for Building Weak Heaps. IWOCA (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
The weak-heap data structure: Variants and applications. J. Discrete Algorithms 16 (2012)
Amr Elmasry
On the size of the subset partial order. Inf. Process. Lett. 112 (12) (2012)
Amr Elmasry, Jyrki Katajainen
Fat Heaps without Regular Counters. WALCOM (2012)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two Skew-Binary Numeral Systems and One Application. Theory Comput. Syst. 50 (1) (2012)
Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. MFCS (2012)
Amr Elmasry
Enumerating trichromatic triangles containing the origin in linear time. J. Discrete Algorithms 17 (2012)
Amr Elmasry, Jyrki Katajainen, Max Stenmark
Branch Mispredictions Don't Affect Mergesort. SEA (2012)
Amr Elmasry, Jyrki Katajainen, Jukka Teuhola
Improved Address-Calculation Coding of Integer Arrays. SPIRE (2012)
Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. Algorithmica 62 (3-4) (2012)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
The Weak-Heap Family of Priority Queues in Theory and Praxis. CATS (2012)
Amr Elmasry, Jyrki Katajainen
Lean Programs, Branch Mispredictions, and Sorting. FUN (2012)
Amr Elmasry, Jyrki Katajainen
Worst-Case Optimal Priority Queues via Extended Regular Counters. CSR (2012)
Amr Elmasry, Jyrki Katajainen
Worst-Case Optimal Priority Queues via Extended Regular Counters CoRR (2011)
Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. IWOCA (2011)
Khaled M. Elbassioni, Amr Elmasry, Kazuhisa Makino
Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geom. Appl. 21 (5) (2011)
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
Dynamic Range Majority Data Structures. ISAAC (2011)
Amr Elmasry, Arash Farzan, John Iacono
A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA (2011)
Amr Elmasry
Pairing heaps, scrambled pairing and square-root trees. Int. J. Comput. Math. 87 (14) (2010)
Amr Elmasry
The Longest Almost-Increasing Subsequence. COCOON (2010)
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) (2010)
Amr Elmasry
The longest almost-increasing subsequence. Inf. Process. Lett. 110 (16) (2010)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
The Magic of a Number System. FUN (2010)
Amr Elmasry, Arash Farzan, John Iacono
Priority Queues with Multiple Time Fingers CoRR (2010)
Amr Elmasry
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. ISAAC (2) (2010)
Amr Elmasry
Pairing Heaps with Costless Meld. ESA (2) (2010)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Strictly-Regular Number System and Data Structures. SWAT (2010)
Amr Elmasry
The Violation Heap: A Relaxed Fibonacci-Like Heap. COCOON (2010)
Amr Elmasry
The Subset Partial Order: Computing and Combinatorics. ANALCO (2010)
Amr Elmasry
The Violation Heap: a Relaxed Fibonacci-like Heap. Discret. Math. Algorithms Appl. 2 (4) (2010)
Amr Elmasry
Computing the subset partial order for dense families of sets. Inf. Process. Lett. 109 (18) (2009)
Amr Elmasry
Pairing Heaps with Costless Meld CoRR (2009)
Amr Elmasry
) decrease cost. SODA (2009)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two-tier relaxed heaps. Acta Informatica 45 (3) (2008)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two new methods for constructing double-ended priority queues from priority queues. Computing 83 (4) (2008)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Multipartite priority queues. ACM Trans. Algorithms 5 (1) (2008)
Amr Elmasry, Abdelrahman Hammad
Inversion-sensitive sorting algorithms in practice. ACM J. Exp. Algorithmics 13 (2008)
Amr Elmasry
Violation Heaps: A Better Substitute for Fibonacci Heaps CoRR (2008)
Amr Elmasry, Michael L. Fredman
Adaptive sorting: an information theoretic perspective. Acta Informatica 45 (1) (2008)
Amr Elmasry, Kazuhisa Makino
Finding Intersections of Bichromatic Segments Defined by Points. CCCG (2007)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
On the Power of Structural Violations in Priority Queues. CATS (2007)
Amr Elmasry, Claus Jensen, Jyrki Katajainen
Two-Tier Relaxed Heaps. ISAAC (2006)
Amr Elmasry
A Priority Queue with the Working-set Property. Int. J. Found. Comput. Sci. 17 (6) (2006)
Ahmed A. Belal, Amr Elmasry
Verification of minimum-redundancy prefix codes. IEEE Trans. Inf. Theory 52 (4) (2006)
Ahmed A. Belal, Amr Elmasry
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. STACS (2006)
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
An Indexing Method for Answering Queries on Moving Objects. Distributed Parallel Databases 17 (3) (2005)
Amr Elmasry
Deterministic Jumplists. Nord. J. Comput. 12 (1) (2005)
Amr Elmasry, Abdelrahman Hammad
An Empirical Study for Inversions-Sensitive Sorting Algorithms. WEA (2005)
Ahmed A. Belal, Amr Elmasry
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes CoRR (2005)
Ahmed A. Belal, Amr Elmasry
Finding maximum-cost minimum spanning trees. AICCSA (2005)
Amr Elmasry, Khaled M. Elbassioni
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. CCCG (2005)
Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich
A stronger version of Bárány's theorem in the plane. CCCG (2004)
Amr Elmasry
Layered Heaps. SWAT (2004)
Amr Elmasry
On the sequential access theorem and deque conjecture for splay trees. Theor. Comput. Sci. 314 (3) (2004)
Amr Elmasry
Parameterized self-adjusting heaps. J. Algorithms 52 (2) (2004)
Amr Elmasry
Adaptive Sorting with AVL Trees. IFIP TCS (2004)
Amr Elmasry
Three Sorting Algorithms Using Priority Queues. ISAAC (2003)
Amr Elmasry, Michael L. Fredman
Adaptive Sorting and the Information Theoretic Lower Bound. STACS (2003)
Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
An Efficient Indexing Scheme for Multi-dimensional Moving Objects. ICDT (2003)
Amr Elmasry
Distribution-Sensitive Binomial Queues. WADS (2003)

Amr Elmasry.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Amr Elmasry