A data structure for manipulating priority queues
Data up to Jan 2025
Total Citations Per Year
Abstract
References (23)
The Art of Computer Programming
1968 • 16,727 citations
The Design and Analysis of Computer Algorithms
1974 • 9,688 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
Complexity of Computer Computations
1972 • 2,804 citations
Design and implementation of an efficient priority queue
1976 • 516 citations
Finding Minimum Spanning Trees
1976 • 425 citations
Fundamental Algorithms
1998 • 388 citations
Algorithm 245: Treesort
1964 • 243 citations
Finding the median
1976 • 194 citations
Implementation and Analysis of Binomial Queue Algorithms
1978 • 117 citations
A comparison of simulation event list algorithms
1975 • 114 citations
A Tournament Problem
1959 • 106 citations
Priority queues with update and finding minimum spanning trees
1975 • 88 citations
Local Versus Global Strategies for Adaptive Quadrature
1975 • 78 citations
Linear lists and priority queues as balanced binary trees
1972 • 68 citations
Efficiency of Equivalence Algorithms
1972 • 52 citations
Improved event-scanning mechanisms for discrete event simulation
1975 • 47 citations
Analysis of an algorithm for priority queue administration
1975 • 39 citations
Heaps applied to event driven mechanisms
1976 • 33 citations
Row elimination for solving sparse linear systems and least squares problems
1976 • 31 citations
Algorithms for shortest paths.
1973 • 27 citations
Design and implementation of an efficient priority queue : (prepublication)
1975 • 2 citations
Deleted Work
1955 • 0 citations