| Publication | Date of Publication | Type |
|---|
Twisted tabulation hashing
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Using hashing to solve the dictionary problem | 2019-05-10 | Paper |
| The geometry of binary search trees | 2019-05-06 | Paper |
On the \(k\)-independence required by linear probing and minwise independence
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
Finding the Median (Obliviously) with Bounded Space
Automata, Languages, and Programming | 2015-10-27 | Paper |
| scientific article; zbMATH DE number 6469186 (Why is no real title available?) | 2015-08-03 | Paper |
| Tight bounds for the partial-sums problem | 2015-08-03 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
| scientific article; zbMATH DE number 6381684 (Why is no real title available?) | 2014-12-18 | Paper |
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Changing base without losing space
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Don't rush into a union, take time to find your roots
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Distance oracles beyond the Thorup-Zwick bound
SIAM Journal on Computing | 2014-06-04 | Paper |
| scientific article; zbMATH DE number 6297698 (Why is no real title available?) | 2014-05-22 | Paper |
| On the possibility of faster \textsc{SAT} algorithms | 2014-05-22 | Paper |
| Cell-probe lower bounds for succinct partial sums | 2014-05-22 | Paper |
| Lower bounds for edit distance and product metrics via Poincaré-type inequalities | 2014-05-22 | Paper |
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
The power of simple tabulation hashing
Journal of the ACM | 2014-02-17 | Paper |
Unifying the landscape of cell-probe lower bounds
SIAM Journal on Computing | 2011-10-18 | Paper |
Dynamic connectivity: connecting to networks and geometry
SIAM Journal on Computing | 2011-07-29 | Paper |
On the \(k\)-independence required by linear probing and minwise independence
Automata, Languages and Programming | 2010-09-07 | Paper |
Lower bounds for asymmetric communication channels and distributed source coding
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Lower bounds for dynamic connectivity
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764792 (Why is no real title available?) | 2010-08-06 | Paper |
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
SIAM Journal on Computing | 2010-04-29 | Paper |
Higher lower bounds for near-neighbor and further rich problems
SIAM Journal on Computing | 2010-04-29 | Paper |
Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons
Algorithmica | 2009-08-27 | Paper |
Tight bounds for dynamic convex hull queries (again)
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5485435 (Why is no real title available?) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485434 (Why is no real title available?) | 2009-01-05 | Paper |
De Dictionariis Dynamicis Pauco Spatio Utentibus
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Subquadratic algorithms for 3SUM
Algorithmica | 2008-04-23 | Paper |
Dynamic Optimality—Almost
SIAM Journal on Computing | 2008-03-28 | Paper |
| Farey Statistics in Time n^{2/3} and Counting Primitive Lattice Points in Polygons | 2007-08-01 | Paper |
On dynamic bit-probe complexity
Theoretical Computer Science | 2007-07-16 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Logarithmic Lower Bounds in the Cell-Probe Model
SIAM Journal on Computing | 2006-06-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2005-08-12 | Paper |
