Relaxed weak queues: an alternative to run-relaxed heaps (2005)

by Amr Elmasry , Claus Jensen , Jyrki Katajainen
Citations:5 - 4 self

Active Bibliography

8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
unknown title – Claus Jensen - 2006
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
1 Rank-Relaxed Weak Queues: Faster than Pairing and Fibonacci Heaps? – Stefan Edelkamp - 2009
The Weak-Heap Data Structure: Variants and Applications1 – Stefan Edelkampa, Amr Elmasryb, Jyrki Katajainenb
contracts 21-02-0501 (project Practical data structures and algorithms) and 272-05-0272 (project Generic programming—algorithms and tools). – Amr Elmasry, Claus Jensen Jyrki, Amr Elmasry, Claus Jensen, Jyrki Katajainen
1 Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
359 CoSaMP: Iterative signal recovery from incomplete and inaccurate samples – D. Needell, J. A. Tropp - 2008
5 Two new methods for transforming priority queues into double-ended priority queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006