Amr Elmasry

Publications

245

Citations

H-Index

2004

Active since

Affiliations

Max Planck Institute for Informatics(Current)

Alexandria University

University of Copenhagen

Max Planck Society

Amr Elmasry is an author at Max Planck Institute for Informatics specializing in engineering, computational complexity, and combinatorial optimization.

ORCID

Top concepts

EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationParallel ComputingParallel ProgrammingData ScienceGraph TheoryQueuing Theory

Publications per year

2004–2015

Publications

Multipartite priority queues

Amr Elmasry, Claus Jensen, Jyrki Katajainen · ACM Transactions on Algorithms · 2008 · 78 citations

Mathematical Programming, Engineering, Priority Queue +19

On the sequential access theorem and deque conjecture for splay trees

Amr Elmasry · Theoretical Computer Science · 2004 · 26 citations

Sequential Access Theorem, Engineering, Graph Theory +8

Space-efficient Basic Graph Algorithms

Amr Elmasry, Torben Hagerup, Frank Kammer · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2015 · 23 citations · Full text

Graph Sparsity, Directed Graph, Engineering +17

Two-tier relaxed heaps

Amr Elmasry, Claus Jensen, Jyrki Katajainen · Acta Informatica · 2008 · 20 citations

Cluster Computing, Engineering, Computer Architecture +5

Pairing heaps with O(log log n) decrease cost

Amr Elmasry · Symposium on Discrete Algorithms · 2009 · 18 citations

Cluster Computing, Computational Complexity Theory, Log Log N +15

Rows per page

1–5 of 11