A priority queue transform

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1668, Issue , 1999, Pages 243-257

  Fredman, Michael L ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

HEAP DATA STRUCTURES; KEY OPERATIONS; ORDERED TREE; PRIORITY QUEUES;

METADATA;

EID: 84957052496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48318-7_20     Document Type: Conference Paper

References (7)

1. M. L. Fredman, On the efficiency of pairing heaps and related data structures, to appear in Journal of the ACM.
2. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan, The pairing heap: a new form of self-adjusting heap, Algorithmica 1,1 (1986), pp. 111–129.
3. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization problems, Journal of the ACM 34,3 (1987), pp. 596–615.
4. D. W. Jones, An empirical comparison of priority-queue and event-set implementations, Communications of the ACM 29, 4 (1986), pp. 300–311.
5. D. D. Sleator and R. E. Tarjan, Self-adjusting heaps. SIAM Journal on Computing 15,1 (1986), pp. 52–69.
6. J. T. Stasko and J. S. Vitter, Pairing heaps: experiments and analysis, Communications of the ACM 30,3 (1987), pp. 234–249.
7. J. Vuillemin, A data structure for manipulating priority queues, Communications of the ACM 21 (1978) pp. 309–214.