2 citations · 4 across the 11 of their papers we have counts for
14 papers
Breaking the Bellman-Ford Shortest-Path Bound
Amr Elmasry
In this paper we give a single-source shortest-path algorithm that breaks, after over 65 years, the bound for the running time of the Bellman-Ford-Moore algorithm, w…
Breaking the Bellman-Ford Shortest-Path Bound
Amr Elmasry
In this paper we give a single-source shortest-path algorithm that breaks, after over 60 years, the time bound for the Bellman-Ford algorithm, where is the numbe…
Red-Black Trees with Constant Update Time
Amr Elmasry, Mostafa Kahla, Fady Ahdy +1
We show how a few modifications to the red-black trees allow for worst-case update time (once the position of the inserted or deleted element is known). The resulting struct…
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
Omar Darwish, Amr Elmasry, Jyrki Katajainen
We consider space-bounded computations on a random-access machine (RAM) where the input is given on a read-only random-access medium, the output is to be produced to a write-only s…
Space-Efficient Plane-Sweep Algorithms
Amr Elmasry, Frank Kammer
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of items and that the available wo…
Counting Inversions Adaptively
Amr Elmasry
We give a simple and efficient algorithm for adaptively counting inversions in a sequence of integers. Our algorithm runs in time in the word-RAM…