Hash functions for priority queues
Information and Control
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Bounded ordered dictionaries in O(loglogN) time and O(n) space
Information Processing Letters
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
Fishspear: a priority queue algorithm
Journal of the ACM (JACM)
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Equivalence between sorting and priority queues
Equivalence between sorting and priority queues
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Computing the nxm shortest path efficiently
Journal of Experimental Algorithmics (JEA)
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for stretch scheduling
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Resource Scheduling for Composite Multimedia Objects
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Experimental Study of Priority Queues in External Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Computing the n × m Shortest Paths Efficently
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Finite-state transducers in language and speech processing
Computational Linguistics
Quasi-Linear Algorithms for the Topological Watershed
Journal of Mathematical Imaging and Vision
Short note: O(N) implementation of the fast marching algorithm
Journal of Computational Physics
Range mode and range median queries on lists and trees
Nordic Journal of Computing
The eclipse operating system: providing quality of service via reservation domains
ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Revisiting priority queues for image analysis
Pattern Recognition
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
Proceedings of the 7th International Conference on Frontiers of Information Technology
Algorithms for the topological watershed
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Grayscale watersheds on perfect fusion graphs
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Hi-index | 0.00 |