Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Lower bounds for dynamic algebraic problems
Information and Computation
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Lower Bounds in the Quantum Cell Probe Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Cell-probe lower bounds for the partial match problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lower bounds for asymmetric communication channels and distributed source coding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The space complexity of pass-efficient algorithms for clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The cell probe complexity of succinct data structures
Theoretical Computer Science
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Randomization does not help searching predecessors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Extractors for Three Uneven-Length Sources
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing
ACM SIGACT News
ACM Transactions on Computation Theory (TOCT)
On the exact space complexity of sketching and streaming small norms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for sparse recovery
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Cell probe lower bounds and approximations for range mode
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Randomized OBDDs for the most significant bit of multiplication need exponential space
Information Processing Letters
Randomized OBDDs for the most significant bit of multiplication need exponential size
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
SIAM Journal on Computing
Sparse recovery with partial support knowledge
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Two-Dimensional range diameter queries
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
NNS lower bounds via metric expansion for l
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Note: One-round multi-party communication complexity of distinguishing sums
Theoretical Computer Science
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |