New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Hash functions for priority queues
Information and Control
A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Data structures for traveling salesmen
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An efficient randomized algorithm for the closest pair problem on colored point sets
Nordic Journal of Computing
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |