The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Local Versus Global Strategies for Adaptive Quadrature
ACM Transactions on Mathematical Software (TOMS)
Heaps applied to event driven mechanisms
Communications of the ACM
A comparison of simulation event list algorithms
Communications of the ACM
Improved event-scanning mechanisms for discrete event simulation
Communications of the ACM
Communications of the ACM
Selected Papers on Computer Science
Selected Papers on Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Random insertion into a priority queue structure.
Random insertion into a priority queue structure.
Finding the Median
Algorithms for shortest paths.
Algorithms for shortest paths.
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Concurrent operations on priority queues
Communications of the ACM
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Pairing heaps: experiments and analysis
Communications of the ACM
Purely functional random-access lists
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Parallelizing the phylogeny problem
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
The role of lazy evaluation in amortized data structures
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Parallel Divide and Conquer on Meshes
IEEE Transactions on Parallel and Distributed Systems
Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Conflict-free template access in k-ary and binomial trees
ICS '97 Proceedings of the 11th international conference on Supercomputing
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The soft heap: an approximate priority queue with optimal error rate
Journal of the ACM (JACM)
Optimizing static calendar queues
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A simple implementation technique for priority search queues
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Bootstrapping one-sided flexible arrays
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Renewal processes on partially ordered sets
Random Structures & Algorithms
Priority Queues, Pairing, and Adaptive Sorting
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Car-Pooling as a Data Structuring Device: The Soft Heap
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Information Processing Letters
The complexity of priority queue maintenance
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Space-time tradeoffs and first order problems in a model of programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Linear expected-time algorithms for connectivity problems (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
ACM Transactions on Database Systems (TODS)
Journal of Functional Programming
Generalized parallel divide and conquer on 3D mesh and torus
Journal of Systems Architecture: the EUROMICRO Journal
A Complexity O(1) priority queue for event driven molecular dynamics simulations
Journal of Computational Physics
On the power of structural violations in priority queues
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
IEEE Transactions on Computers
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
A simpler implementation and analysis of Chazelle's soft heaps
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science
Associative commutative pattern matching
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Intersection reporting on two collections of disjoint sets
Information Sciences: an International Journal
Efficient unbalanced merge-sort
Information Sciences: an International Journal
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A new vision for coarray Fortran
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
The violation heap: a relaxed Fibonacci-like heap
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Policy-based benchmarking of weak heaps and their relatives,
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Strictly-Regular number system and data structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Two constant-factor-optimal realizations of adaptive heapsort
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Fat heaps without regular counters
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Research paper: The saga of minimum spanning trees
Computer Science Review
Computational experience with minimum spanning tree algorithms
Operations Research Letters
SIAM Journal on Computing
A priority queue with the time-finger property
Journal of Discrete Algorithms
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
In-place heap construction with optimized comparisons, moves, and cache misses
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Sharing information in all pairs shortest path algorithms
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
The weak-heap family of priority queues in theory and praxis
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Journal of Discrete Algorithms
| Hi-index | 48.30 |
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.