1 citations · 1 across the 4 of their papers we have counts for
5 papers
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…
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps
Stefan Edelkamp, Jyrki Katajainen, Amr Elmasry
Let denote the number of elements currently in a data structure. An in-place heap is stored in the first locations of an array, uses extra space, and supports the op…
Selection from read-only memory with limited workspace
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen +1
Given an unordered array of elements drawn from a totally ordered set and an integer in the range from to , in the classic selection problem the task is to find the…
Worst-Case Optimal Priority Queues via Extended Regular Counters
Amr Elmasry, Jyrki Katajainen
We consider the classical problem of representing a collection of priority queues under the operations \Findmin{}, \Insert{}, \Decrease{}, \Meld{}, \Delete{}, and \Deletemin{}. In…
The Open Graph Archive: A Community-Driven Effort
Christian Bachmaier, Franz J. Brandenburg, Philip Effinger +6
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimenta…