Reaching the Bound in the (2, n) merging Problem. - Ahmed A. Belal; Amr Elmasry (Inf. Sci., 1998)

Efficient answering of polyhedral queries in rd using bbs-trees. - Khaled M. Elbassioni; Amr Elmasry; Ibrahim Kamel (CCCG, 2002)

Priority Queues, Pairing, and Adaptive Sorting. - Amr Elmasry (ICALP, 2002)

An Efficient Indexing Scheme for Multi-dimensional Moving Objects. - Khaled M. Elbassioni; Amr Elmasry; Ibrahim Kamel (ICDT, 2003)

Three Sorting Algorithms Using Priority Queues. - Amr Elmasry (ISAAC, 2003)

Adaptive Sorting and the Information Theoretic Lower Bound. - Amr Elmasry; Michael L. Fredman (STACS, 2003)

Distribution-Sensitive Binomial Queues. - Amr Elmasry (WADS, 2003)

A stronger version of Bárány's theorem in the plane. - Khaled M. Elbassioni; Amr Elmasry; Vladimir Gurvich (CCCG, 2004)

Adaptive Sorting with AVL Trees. - Amr Elmasry (IFIP TCS, 2004)

Layered Heaps. - Amr Elmasry (SWAT, 2004)

Parameterized self-adjusting heaps. - Amr Elmasry (J. Algorithms, 2004)

On the sequential access theorem and deque conjecture for splay trees. - Amr Elmasry (Theor. Comput. Sci., 2004)

Finding maximum-cost minimum spanning trees. - Ahmed A. Belal; Amr Elmasry (AICCSA, 2005)

Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. - Amr Elmasry; Khaled M. Elbassioni (CCCG, 2005)

An Empirical Study for Inversions-Sensitive Sorting Algorithms. - Amr Elmasry; Abdelrahman Hammad (WEA, 2005)

An Indexing Method for Answering Queries on Moving Objects. - Khaled M. Elbassioni; Amr Elmasry; Ibrahim Kamel (Distributed Parallel Databases, 2005)

Deterministic Jumplists. - Amr Elmasry (Nord. J. Comput., 2005)

Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. - Ahmed A. Belal; Amr Elmasry (STACS, 2006)

A Priority Queue with the Working-set Property. - Amr Elmasry (Int. J. Found. Comput. Sci., 2006)

Verification of minimum-redundancy prefix codes. - Ahmed A. Belal; Amr Elmasry (IEEE Trans. Inf. Theory, 2006)

On the Power of Structural Violations in Priority Queues. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (CATS, 2007)

Finding Intersections of Bichromatic Segments Defined by Points. - Amr Elmasry; Kazuhisa Makino (CCCG, 2007)

Adaptive sorting: an information theoretic perspective. - Amr Elmasry; Michael L. Fredman (Acta Informatica, 2008)

Two-tier relaxed heaps. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (Acta Informatica, 2008)

Two new methods for constructing double-ended priority queues from priority queues. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (Computing, 2008)

Violation Heaps: A Better Substitute for Fibonacci Heaps - Amr Elmasry (CoRR, 2008)

Inversion-sensitive sorting algorithms in practice. - Amr Elmasry; Abdelrahman Hammad (ACM J. Exp. Algorithmics, 2008)

Multipartite priority queues. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (ACM Trans. Algorithms, 2008)

Indexing Schemes for Multi-dimensional Moving Objects. - Khaled M. Elbassioni; Amr Elmasry; Ibrahim Kamel (Encyclopedia of GIS, 2008)

Pairing heaps with O(log log n) decrease cost. - Amr Elmasry (SODA, 2009)

Computing the subset partial order for dense families of sets. - Amr Elmasry (Inf. Process. Lett., 2009)

The Subset Partial Order: Computing and Combinatorics. - Amr Elmasry (ANALCO, 2010)

Pairing Heaps with Costless Meld. - Amr Elmasry (ESA (2), 2010)

The Magic of a Number System. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (FUN, 2010)

Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. - Amr Elmasry (ISAAC (2), 2010)

Strictly-Regular Number System and Data Structures. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (SWAT, 2010)

Priority Queues with Multiple Time Fingers - Amr Elmasry; Arash Farzan; John Iacono (CoRR, 2010)

The Violation Heap: a Relaxed Fibonacci-like Heap. - Amr Elmasry (Discret. Math. Algorithms Appl., 2010)

Pairing heaps, scrambled pairing and square-root trees. - Amr Elmasry (Int. J. Comput. Math., 2010)

The longest almost-increasing subsequence. - Amr Elmasry (Inf. Process. Lett., 2010)

Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (IWOCA, 2011)

A Unifying Property for Distribution-Sensitive Priority Queues. - Amr Elmasry; Arash Farzan; John Iacono (IWOCA, 2011)

Finding Simplices containing the Origin in Two and Three Dimensions. - Khaled M. Elbassioni; Amr Elmasry; Kazuhisa Makino (Int. J. Comput. Geom. Appl., 2011)

The Weak-Heap Family of Priority Queues in Theory and Praxis. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (CATS, 2012)

Worst-Case Optimal Priority Queues via Extended Regular Counters. - Amr Elmasry; Jyrki Katajainen (CSR, 2012)

Lean Programs, Branch Mispredictions, and Sorting. - Amr Elmasry; Jyrki Katajainen (FUN, 2012)

A Catalogue of Algorithms for Building Weak Heaps. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (IWOCA, 2012)

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. - Jingsen Chen; Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (MFCS, 2012)

Improved Address-Calculation Coding of Integer Arrays. - Amr Elmasry; Jyrki Katajainen; Jukka Teuhola (SPIRE, 2012)

Branch Mispredictions Don't Affect Mergesort. - Amr Elmasry; Jyrki Katajainen; Max Stenmark (SEA, 2012)

An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs. - Amr Elmasry; Kurt Mehlhorn; Jens M. Schmidt (Algorithmica, 2012)

On the size of the subset partial order. - Amr Elmasry (Inf. Process. Lett., 2012)

The weak-heap data structure: Variants and applications. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (J. Discrete Algorithms, 2012)

Enumerating trichromatic triangles containing the origin in linear time. - Amr Elmasry (J. Discrete Algorithms, 2012)

A priority queue with the time-finger property. - Amr Elmasry; Arash Farzan; John Iacono (J. Discrete Algorithms, 2012)

Two Skew-Binary Numeral Systems and One Application. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (Theory Comput. Syst., 2012)

Weak Heaps and Friends: Recent Developments. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen; Armin Weiß (IWOCA, 2013)

In-Place Binary Counters. - Amr Elmasry; Jyrki Katajainen (MFCS, 2013)

Priority Queues and Sorting for Read-Only Data. - Tetsuo Asano; Amr Elmasry; Jyrki Katajainen (TAMC, 2013)

Branchless Search Programs. - Amr Elmasry; Jyrki Katajainen (SEA, 2013)

On the hierarchy of distribution-sensitive properties for data structures. - Amr Elmasry; Arash Farzan; John Iacono (Acta Informatica, 2013)

Fat Heaps without Regular Counters. - Amr Elmasry; Jyrki Katajainen (Discret. Math. Algorithms Appl., 2013)

Weak heaps engineered. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (J. Discrete Algorithms, 2013)

Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. - Amr Elmasry; Kurt Mehlhorn; Jens M. Schmidt (J. Graph Theory, 2013)

Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem. - Omar Darwish; Amr Elmasry (ESA, 2014)

Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps. - Stefan Edelkamp; Jyrki Katajainen; Amr Elmasry (CoRR, 2014)

On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs. - Amr Elmasry; Yung H. Tsin (Int. J. Found. Comput. Sci., 2014)

Selection from read-only memory with limited workspace. - Amr Elmasry; Daniel Dahl Juhl; Jyrki Katajainen; Srinivasa Rao Satti (Theor. Comput. Sci., 2014)

An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (CSR, 2015)

2-Bit Branch Predictor Modeling Using Markov Model. - Reem Elkhouly; Ahmed El-Mahdy 002; Amr Elmasry (SCSE, 2015)

Space-efficient Basic Graph Algorithms. - Amr Elmasry; Torben Hagerup; Frank Kammer (STACS, 2015)

Counting inversions adaptively. - Amr Elmasry (Inf. Process. Lett., 2015)

A scalable maximum-clique algorithm using Apache Spark. - Amr Elmasry; Ayman Khalafallah; Moustafa Meshry (AICCSA, 2016)

Space-Efficient Plane-Sweep Algorithms. - Amr Elmasry; Frank Kammer (ISAAC, 2016)

Optimality analysis of if-conversion transformation. - Reem Elkhouly; Ahmed El-Mahdy 002; Amr Elmasry (SpringSim (HPS), 2016)

Dynamic range majority data structures. - Amr Elmasry; Meng He 001; J. Ian Munro; Patrick K. Nicholson (Theor. Comput. Sci., 2016)

Heap Construction - 50 Years Later. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (Comput. J., 2017)

Bipartite binomial heaps. - Amr Elmasry; Claus Jensen; Jyrki Katajainen (RAIRO Theor. Informatics Appl., 2017)

Optimizing Binary Heaps. - Stefan Edelkamp; Amr Elmasry; Jyrki Katajainen (Theory Comput. Syst., 2017)

Toward Optimal Self-Adjusting Heaps. - Amr Elmasry (ACM Trans. Algorithms, 2017)

Indexing Schemes for Multidimensional Moving Objects. - Khaled M. Elbassioni; Amr Elmasry; Ibrahim Kamel (Encyclopedia of GIS, 2017)

On the approximability of the maximum interval constrained coloring problem. - Stefan Canzar; Khaled M. Elbassioni; Amr Elmasry; Rajiv Raman 001 (Discret. Optim., 2018)

Parameter Estimation for Chaotic Systems Using the Fruit Fly Optimization Algorithm. - Saad M. Darwish; Amr Elmasry; Asmaa H. Ibrahim (AMLTA, 2019)

Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm. - Saad M. Darwish; Amr Elmasry; Shaymaa H. Ibrahim (AMLTA, 2019)

Red-black trees with constant update time. - Amr Elmasry; Mostafa Kahla; Fady Ahdy; Mahmoud Hashem (Acta Informatica, 2019)

Optimal prefix codes with fewer distinct codeword lengths are faster to construct. - Ahmed A. Belal; Amr Elmasry (Inf. Comput., 2019)

A new algorithm for the shortest-path problem. - Amr Elmasry; Ahmed Shokry (Networks, 2019)

Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. - Omar Darwish; Amr Elmasry; Jyrki Katajainen (ACM Trans. Algorithms, 2021)

Tuning the Evaporation Parameter in ACO MANET Routing Using a Satisfaction-Form Game-Theoretic Approach. - Marwan A. Hefnawy; Saad M. Darwish; Amr Elmasry (IEEE Access, 2022)

Regular numeral systems for data structures. - Amr Elmasry; Jyrki Katajainen (Acta Informatica, 2022)

Automating Sanad Continuity Verification in Disconnected Hadith Using Machine Learning. - Mona Hendawi; Marwan Torki; Amr Elmasry; Ayman Khalafallah (ICCTA, 2024)

Breaking the Bellman-Ford Shortest-Path Bound. - Amr Elmasry (CoRR, 2024)

Verifying Shortest Paths in Linear Time. - Ahmed Shokry; Amr Elmasry; Ayman Khalafallah; Amr Aly (CoRR, 2024)