Author

Amr Elmasry

Observed names: A. Elmasry, AMR ELMASRY, Amr Ahmed Elmasry, Elmasry, Amr, Elmasry, Amr Ahmed Abd Elmoneim

Institutions: Egypt University of Informatics, Alexandria University

Observed institutions: Rutgers, The State University of New Jersey, University of Copenhagen, Al-Zaytoonah University of Jordan, Max Planck Society, George Washington University, Egypt-Japan University of Science and Technology, Beirut Arab University, Max Planck Institute for Informatics, Egypt University of Informatics, Alexandria University

ORCID: 0000-0002-6549-908X

Observed ORCID: 0000-0002-6549-908X

OpenAlex ID: A5041655022

Multipartite priority queues

2008 · Amr Elmasry, Claus Jensen, et al. · ACM Transactions on Algorithms · 80

Space-efficient Basic Graph Algorithms

2015 · Elmasry, Amr, Hagerup, Torben, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 43

PDF

On the sequential access theorem and deque conjecture for splay trees

2004 · Amr Elmasry · Theoretical Computer Science · 28

PDF

Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem

2014 · Omar Darwish, Amr Elmasry · Lecture notes in computer science · 22

Two-tier relaxed heaps

2008 · Amr Elmasry, Claus Jensen, et al. · Acta Informatica · 19

The weak-heap data structure: Variants and applications

2012 · Stefan Edelkamp, Amr Elmasry, et al. · Journal of Discrete Algorithms · 18

Pairing heaps with O(log log n) decrease cost

2009 · Amr Elmasry · 18

A Priority Queue With the Working-set Property

2006 · AMR ELMASRY · International Journal of Foundations of Computer Science · 18

The Violation Heap: a Relaxed Fibonacci-like Heap

2010 · AMR ELMASRY · Discrete Mathematics Algorithms and Applications · 17

PDF

Priority Queues and Sorting for Read-Only Data

2013 · Tetsuo Asano, Amr Elmasry, et al. · Lecture notes in computer science · 16

Branch Mispredictions Don’t Affect Mergesort

2012 · Amr Elmasry, Jyrki Katajainen, et al. · Lecture notes in computer science · 14

An Efficient Indexing Scheme for Multi-dimensional Moving Objects

2002 · Khaled Elbassioni, Amr Elmasry, et al. · Lecture notes in computer science · 14

Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm

2019 · Saad M. Darwish, Amr Elmasry, et al. · Advances in intelligent systems and computing · 13

Pairing Heaps with O (log log n ) decrease Cost

2009 · Amr Elmasry · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 13

Priority Queues, Pairing, and Adaptive Sorting

2002 · Amr Elmasry · Lecture notes in computer science · 13

An Efficient Petrov–Galerkin Scheme for the Euler–Bernoulli Beam Equation via Second-Kind Chebyshev Polynomials

2025 · Youssri Hassan Youssri, Waleed Mohamed Abd-Elhameed, et al. · Fractal and Fractional · 12

PDF

Optimizing Binary Heaps

2017 · Stefan Edelkamp, Amr Elmasry, et al. · Theory of Computing Systems · 12

PDF

Selection from read-only memory with limited workspace

2014 · Amr Elmasry, Daniel Dahl Juhl, et al. · Theoretical Computer Science · 12

Dynamic Range Majority Data Structures

2011 · Amr Elmasry, Meng He, et al. · Lecture notes in computer science · 12

An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs

2010 · Amr Elmasry, Kurt Mehlhorn, et al. · Algorithmica · 12

Adaptive Sorting with AVL Trees

2006 · Amr Elmasry · Kluwer Academic Publishers eBooks · 11

PDF

Space-Efficient Plane-Sweep Algorithms

2015 · Elmasry, Amr, Kammer, Frank · arXiv (Cornell University) · 10

PDF

Weak heaps engineered

2013 · Stefan Edelkamp, Amr Elmasry, et al. · Journal of Discrete Algorithms · 10

PDF

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

2012 · Jingsen Chen, Stefan Edelkamp, et al. · Lecture notes in computer science · 10

The longest almost-increasing subsequence

2010 · Amr Elmasry · Information Processing Letters · 10

Works count: 121

Citation count: 773

H-index: 13

I10-index: 26