Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Faster deterministic dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved fast integer sorting in linear space
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing the nxm shortest path efficiently
Journal of Experimental Algorithmics (JEA)
Deterministic sorting in O(nlog log n) time and linear space
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved fast interger sorting in linear space
Information and Computation
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Fast Integer Sorting in Linear Space
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Computing the n × m Shortest Paths Efficently
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Journal of Computer and System Sciences - Special issue: STOC 2003
ACM Computing Surveys (CSUR)
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
A double scaling algorithm for the constrained maximum flow problem
Computers and Operations Research
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
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
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
Proceedings of the 7th International Conference on Frontiers of Information Technology
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Discrete Applied Mathematics
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications
A faster polynomial algorithm for the constrained maximum flow problem
Computers and Operations Research
QoS-aware automatic service composition: a graph view
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
| Hi-index | 0.00 |