Randomized Meldable Priority Queues
Download:
|
|
by Anna Gambin, Adam Malinowski
http://www.mimuw.edu.pl/~amal/Papers/pq.ps.gz
Add To MetaCart
Abstract:
We present a practical meldable priority queue implementation. All priority queue operations are very simple and their logarithmic time bound holds with high probability, which makes this data structure more suitable for real-time applications than those with only amortized performance guarantees. Our solution is also space-efficient, since it does not require storing any auxiliary information within the queue nodes. 1
Citations
| 492 | Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition – Knuth - 1998 |
| 212 | Skip lists: A probabilistic alternative to balanced trees – Pugh - 1990 |
| 108 | Randomized search trees – Aragon, Seidel - 1989 |
| 63 | Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation – Driscoll, Gabow, et al. - 1988 |
| 39 | The pairing heap: A new form of self-adjusting heap – Fredman, Sedgewick, et al. - 1986 |
| 37 | Self-adjusting heaps – Sleator, Tarjan - 1986 |
| 28 | Data structures – Mehlhorn, Tsakalidis - 1990 |
| 24 | Self-adjusting binary trees – Sleator, Tarjan |
| 22 | Worst-Case Efficient Priority Queues – Brodal - 1996 |
| 15 | An empirical comparison of priority queue and event set implementations – Jones - 1986 |
| 12 | Three priority queue applications revisited – Liao - 1992 |
| 9 | Fast Meldable Priority Queues – Brodal - 1995 |
