| Publication | Date of Publication | Type |
|---|
Is Kyle's equilibrium model stable?
Mathematics and Financial Economics | 2024-12-27 | Paper |
Diagonalization Games
American Mathematical Monthly | 2024-12-12 | Paper |
| Distributed shuffling in adversarial environments | 2024-11-22 | Paper |
The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
TheoretiCS | 2024-11-05 | Paper |
| Hierarchical categories in colored searching | 2024-09-11 | Paper |
Hierarchical categories in colored searching
Computational Geometry | 2024-07-23 | Paper |
| Fast discrepancy minimization with hereditary guarantees | 2024-05-14 | Paper |
| Stronger 3SUM-indexing lower bounds | 2024-05-14 | Paper |
| Further unifying the landscape of cell probe lower bounds | 2024-05-14 | Paper |
| Optimality of the Johnson-Lindenstrauss dimensionality reduction for practical measures | 2024-05-14 | Paper |
How to compress encrypted data
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788479 (Why is no real title available?) | 2024-01-15 | Paper |
Towards optimal lower bounds for k-median and k-means coresets
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| scientific article; zbMATH DE number 7706042 (Why is no real title available?) | 2023-07-03 | Paper |
| Diagonalization Games | 2023-01-05 | Paper |
| Secret sharing lower bound: either reconstruction is hard or shares are long | 2022-12-16 | Paper |
Property-preserving hash functions for Hamming distance from standard assumptions
(available as arXiv preprint) | 2022-08-30 | Paper |
Lower Bounds for Multiplication via Network Coding
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559157 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Lower bounds for multi-server oblivious RAMs | 2021-12-01 | Paper |
Lower bounds for external memory integer sorting via network coding
SIAM Journal on Computing | 2021-10-18 | Paper |
Lower Bounds for Oblivious Near-Neighbor Search
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
(available as arXiv preprint) | 2020-11-25 | Paper |
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
SIAM Journal on Computing | 2020-10-29 | Paper |
Upper and lower bounds for dynamic data structures on strings
(available as arXiv preprint) | 2020-08-05 | Paper |
On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
Algorithmica | 2020-04-09 | Paper |
| Communication lower bounds for statistically secure MPC, with or without preprocessing | 2020-03-09 | Paper |
Lower bounds for external memory integer sorting via network coding
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
A faster external memory priority queue with DecreaseKeys
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Lower bounds for oblivious data structures
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Optimal Learning of Joint Alignments with a Faulty Oracle | 2019-09-21 | Paper |
Tight cell probe bounds for succinct Boolean matrix-vector multiplication
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Near-optimal labeling schemes for nearest common ancestors
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Near-optimal range reporting structures for categorical data
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| I/O-efficient data structures for colored range and prefix reporting | 2019-05-10 | Paper |
The query complexity of a permutation-based variant of mastermind
Discrete Applied Mathematics | 2019-05-03 | Paper |
| Yes, there is an oblivious RAM lower bound! | 2018-09-26 | Paper |
Faster Online Matrix-Vector Multiplication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Fully Understanding the Hashing Trick | 2018-05-22 | Paper |
The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
(available as arXiv preprint) | 2017-12-19 | Paper |
Towards tight lower bounds for range reporting on the RAM
(available as arXiv preprint) | 2017-12-19 | Paper |
Constructive Discrepancy Minimization with Hereditary L2 Guarantees
(available as arXiv preprint) | 2017-11-08 | Paper |
Approximate range emptiness in constant time and optimal space
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Range selection and median: tight cell probe lower bounds and adaptive data structures | 2017-09-29 | Paper |
| Predicting Positive and Negative Links with Noisy Queries: Theory & Practice | 2017-09-19 | Paper |
DecreaseKeys are expensive for external memory priority queues
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
How to prove knowledge of small secrets
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
| Optimality of the Johnson-Lindenstrauss Lemma | 2016-09-07 | Paper |
scientific article; zbMATH DE number 6538681 (Why is no real title available?)
Theory of Computing | 2016-02-02 | Paper |
On hardness of several string indexing problems
Theoretical Computer Science | 2015-04-29 | Paper |
Linear-space data structures for range mode query in arrays
Theory of Computing Systems | 2015-02-05 | Paper |
Optimal planar orthogonal skyline counting queries
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Succinct sampling from discrete distributions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Improved range searching lower bounds
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
On range searching in the group model and combinatorial discrepancy
SIAM Journal on Computing | 2014-07-30 | Paper |
On Range Searching in the Group Model and Combinatorial Discrepancy
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
On Hardness of Several String Indexing Problems
Combinatorial Pattern Matching | 2014-06-30 | Paper |
The cell probe complexity of dynamic range counting
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
The query complexity of finding a hidden permutation
Lecture Notes in Computer Science | 2013-09-13 | Paper |
(Approximate) uncertain skylines
Theory of Computing Systems | 2013-08-23 | Paper |
| Linear-space data structures for range mode query in arrays | 2012-08-23 | Paper |
Existence of an equilibrium with limited stock market participation and power utilities
(available as arXiv preprint) | N/A | Paper |
