| 2016 | AICCSA | A scalable maximum-clique algorithm using Apache Spark. | Amr Elmasry, Ayman Khalafallah, Moustafa Meshry |
| 2016 | ISAAC | Space-Efficient Plane-Sweep Algorithms. | Amr Elmasry, Frank Kammer |
| 2015 | CSR | 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 |
| 2015 | STACS | Space-efficient Basic Graph Algorithms. | Amr Elmasry, Torben Hagerup, Frank Kammer |
| 2014 | ESA | Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem. | Omar Darwish, Amr Elmasry |
| 2013 | COCOON | Selection from Read-Only Memory with Limited Workspace. | Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti |
| 2013 | IWOCA | Weak Heaps and Friends: Recent Developments. | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Wei |
| 2013 | MFCS | In-Place Binary Counters. | Amr Elmasry, Jyrki Katajainen |
| 2013 | TAMC | Priority Queues and Sorting for Read-Only Data. | Tetsuo Asano, Amr Elmasry, Jyrki Katajainen |
| 2012 | CSR | Worst-Case Optimal Priority Queues via Extended Regular Counters. | Amr Elmasry, Jyrki Katajainen |
| 2012 | FUN | Lean Programs, Branch Mispredictions, and Sorting. | Amr Elmasry, Jyrki Katajainen |
| 2012 | IWOCA | A Catalogue of Algorithms for Building Weak Heaps. | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
| 2012 | MFCS | In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. | Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
| 2012 | SPIRE | Improved Address-Calculation Coding of Integer Arrays. | Amr Elmasry, Jyrki Katajainen, Jukka Teuhola |
| 2012 | WALCOM | Fat Heaps without Regular Counters. | Amr Elmasry, Jyrki Katajainen |
| 2011 | ISAAC | Dynamic Range Majority Data Structures. | Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson |
| 2011 | IWOCA | Two Constant-Factor-Optimal Realizations of Adaptive Heapsort. | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
| 2011 | IWOCA | A Unifying Property for Distribution-Sensitive Priority Queues. | Amr Elmasry, Arash Farzan, John Iacono |
| 2010 | COCOON | The Longest Almost-Increasing Subsequence. | Amr Elmasry |
| 2010 | COCOON | The Violation Heap: A Relaxed Fibonacci-Like Heap. | Amr Elmasry |
| 2010 | ESA | Pairing Heaps with Costless Meld. | Amr Elmasry |
| 2010 | FUN | The Magic of a Number System. | Amr Elmasry, Claus Jensen, Jyrki Katajainen |
| 2010 | ISAAC | On the Approximability of the Maximum Interval Constrained Coloring Problem. | Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman |
| 2010 | ISAAC | Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs. | Amr Elmasry |
| 2009 | SODA | Pairing heaps with | Amr Elmasry |
| 2006 | ISAAC | Two-Tier Relaxed Heaps. | Amr Elmasry, Claus Jensen, Jyrki Katajainen |
| 2006 | STACS | Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. | Ahmed A. Belal, Amr Elmasry |
| 2005 | AICCSA | Finding maximum-cost minimum spanning trees. | Ahmed A. Belal, Amr Elmasry |
| 2003 | ICDT | An Efficient Indexing Scheme for Multi-dimensional Moving Objects. | Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel |
| 2003 | ISAAC | Three Sorting Algorithms Using Priority Queues. | Amr Elmasry |
| 2003 | STACS | Adaptive Sorting and the Information Theoretic Lower Bound. | Amr Elmasry, Michael L. Fredman |
| 2003 | WADS | Distribution-Sensitive Binomial Queues. | Amr Elmasry |
| 2002 | ICALP | Priority Queues, Pairing, and Adaptive Sorting. | Amr Elmasry |