|
|
The Randomized Complexity of Maintaining the Minimum
– Gerth St Lting, Gerth St��lting Brodal, Jaikumar Radhakrishnan
- 1996
|
|
5
|
The Randomized Complexity of Maintaining the Minimum
– Gerth Stølting Brodal, Jaikumar Radhakrishnan
- 1996
|
|
|
Strict Fibonacci Heaps
– Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
|
|
|
Priority Queues on Parallel Machines
– Gerth St, Gerth St��lting Brodal
- 1996
|
|
5
|
Priority Queues on Parallel Machines
– Gerth Stølting Brodal
- 1996
|
|
8
|
Complexity Results for Model Checking
– Allan Cheng, Allan Cheng
- 1995
|
|
|
Sorting Multisets Stably in Minimum Space
– Jyrki Katajainen And, Jyrki Katajainen, Tomi Pasanen
- 1994
|
|
3
|
A Note on Worst Case Efficient Meldable Priority Queues
– Rolf Fagerberg
- 1996
|
|
5
|
Functional Pearls: Explaining Binomial Heaps
– Ralf Hinze
- 1999
|
|
2
|
Putting your data structure on a diet
– Hervé Brönnimann, Jyrki Katajainen, Pat Morin
- 2007
|
|
8
|
A framework for speeding up priorityqueue operations
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2004
|
|
3
|
Relaxed weak queues: an alternative to run-relaxed heaps
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2005
|
|
5
|
Two new methods for transforming priority queues into double-ended priority queues
– Amr Elmasry, Claus Jensen, Jyrki Katajainen
- 2006
|
|
9
|
Fast Meldable Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal
- 1995
|
|
2
|
A Generalization of Binomial Queues
– Rolf Fagerberg
- 1996
|
|
3
|
The complexity of implicit and space-efficient priority queues
– Christian W. Mortensen, Seth Pettie
|
|
15
|
Stable Minimum Space Partitioning in Linear Time
– Jyrki Katajainen, Tomi Pasanen
- 1992
|
|
35
|
Worst-Case Efficient External-Memory Priority Queues
– Gerth Stølting Brodal, Jyrki Katajainen
- 1998
|
|
|
Space-Efficient Data-Analysis Queries on Grids
– Gonzalo Navarro A, Yakov Nekrich A, Luís M. S. Russo C
|
