Fast deterministic construction of static dictionaries
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximating Huffman Codes in Parallel
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A nearly-optimal Fano-based coding algorithm
Information Processing and Management: an International Journal
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Well-separated pair decomposition in linear time?
Information Processing Letters
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Radix sorting with no extra space
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Connectivity oracles for planar graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.00 |