Weight-biased leftist trees and modified skip lists

Authors:
Seonghun Cho;Sartaj Sahni
Affiliations:
Univ. of Florida;Univ. of Florida
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
1998

Citing 12
Cited 5

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
Self-adjusting binary search trees

Journal of the ACM (JACM)
An empirical comparison of priority-queue and event-set implementations

Communications of the ACM
Min-max heaps and generalized priority queues

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

Algorithmica
Self adjusting heaps

SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The Deap—A double-ended heap to implement double-ended priority queues

Information Processing Letters
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Pairing heaps: experiments and analysis

Communications of the ACM
Software Development in Pascal

Software Development in Pascal

Correspondence-based data structures for double-ended priority queues

Journal of Experimental Algorithmics (JEA)
Alternatives to two classic data structures

Proceedings of the 36th SIGCSE technical symposium on Computer science education
Skip lift: a probabilistic alternative to red-black trees

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Skip lift: A probabilistic alternative to red-black trees

Journal of Discrete Algorithms
The weak-heap family of priority queues in theory and praxis

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the weight biased leftist tree as an alternative to traditional leftist trees [CRAN72] for the representation of mergeable priority queues. A modified version of skip lists [PUGH90] that uses fixed size nodes is also proposed. Experimental results show our modified skip list structure is faster than the original skip list structure for the representation of dictionaries. Experimental results comparing weight biased leftist trees and competing priority queue structures are presented.