Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for the partial-sums problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Equivalence between priority queues and sorting
Journal of the ACM (JACM)
Worst-Case Optimal Adaptive Prefix Coding
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
Proceedings of the 7th International Conference on Frontiers of Information Technology
Subquadratic algorithms for 3SUM
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Dynamic range majority data structures
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Research paper: The saga of minimum spanning trees
Computer Science Review
Cache-Oblivious dictionaries and multimaps with negligible failure probability
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Approximate pattern matching with k-mismatches in packed text
Information Processing Letters
A correction to Andersson's fusion tree construction
Theoretical Computer Science
| Hi-index | 5.23 |