Randomized Meldable Priority Queues

Authors:
Anna Gambin;Adam Malinowski
Affiliations:
-;-
Venue:
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
1998

Citing 10
Cited 0

An empirical comparison of priority-queue and event-set implementations

Communications of the ACM
The pairing heap: a new form of self-adjusting heap

Algorithmica
Self adjusting heaps

SIAM Journal on Computing
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Data structures

Handbook of theoretical computer science (vol. A)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast Meldable Priority Queues

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Self-adjusting binary trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.01

Visualization

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.