2 citations · 4 across the 11 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 1 cited
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…
cs.DS2014
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…