On the efficiency of pairing heaps and related data structures

Journal of the ACM

Volumn 46, Issue 4, 1999, Pages 473-501

  Fredman, Michael L ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Amortized complexity analysis; Fibonacci heaps; Lower bounds; Priority queues; Self adjusting data structures

Indexed keywords

AMORTIZED COMPLEXITY ANALYSIS; FIBONACCI HEAPS; LOWER BOUNDS; PRIORITY QUEUES; SELF-ADJUSTING DATA STRUCTURES;

ALGORITHMS; ASYMPTOTIC STABILITY; C (PROGRAMMING LANGUAGE); DATABASE SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; QUEUEING THEORY;

DATA STRUCTURES;

EID: 0038595244     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/320211.320214     Document Type: Article

References (8)

1. COLE, R. 1995. On the dynamic finger conjecture for splay trees Part II: The proof. Tech. Rep. TR1995-701 (Aug.). New York Univ., New York.
2. COLE, R., MISHRA, B., SCHMIDT, J., AND SIEGEL, A. 1995. On the dynamic finger conjecture for splay trees Part I: Splay sorting log n-Block sequences. Tech. Rep. TR1995-700 (Aug.). New York Univ., New York.
3. FREDMAN, M. L., SEDGEWICK, R., SLEATOR, D. D., AND TARJAN, R. E. 1986. The pairing heap: a new form of self-adjusting heap. Algorithmica 1, 1, 111-129.
4. FREDMAN, M. L., AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 3 (July), 596-615.
5. JOHNSON, D. B. 1975. Priority queues with update and finding minimum spanning trees. Inf. Proc. Lett. 4, 53-57.
6. LIAO, A. M. 1992. Three priority queue applications revisited. Algorithmica 7, 4, 415-427.
7. SLEATOR, D. D., AND TARJAN, R. E. 1985. Self-adjusting binary search trees. J. ACM 32, 3 (July), 652-686.
8. STASKO, J. T., AND VITTER, J. S. 1987. Pairing heaps: Experiments and analysis. Commun. ACM 30, 3 (Mar.), 234-249.