| Publication | Date of Publication | Type |
|---|
| Is Kyle's equilibrium model stable? | 2024-12-27 | Paper |
| Diagonalization Games | 2024-12-12 | Paper |
| Distributed shuffling in adversarial environments | 2024-11-22 | Paper |
| The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds | 2024-11-05 | Paper |
| Hierarchical categories in colored searching | 2024-09-11 | Paper |
| Hierarchical categories in colored searching | 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 | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147396 | 2024-01-15 | Paper |
| Towards optimal lower bounds for k-median and k-means coresets | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6107259 | 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 | 2022-08-30 | Paper |
| Lower Bounds for Multiplication via Network Coding | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090499 | 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 | 2021-10-18 | Paper |
| Lower Bounds for Oblivious Near-Neighbor Search | 2021-02-02 | Paper |
| On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms | 2020-11-25 | Paper |
| Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds | 2020-10-29 | Paper |
| Upper and Lower Bounds for Dynamic Data Structures on Strings | 2020-08-05 | Paper |
| On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms | 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 | 2020-01-30 | Paper |
| A Faster External Memory Priority Queue with DecreaseKeys | 2019-10-15 | Paper |
| Lower Bounds for Oblivious Data Structures | 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 | 2019-08-22 | Paper |
| Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds | 2019-08-22 | Paper |
| Near-optimal labeling schemes for nearest common ancestors | 2019-06-20 | Paper |
| Near-Optimal Range Reporting Structures for Categorical Data | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743422 | 2019-05-10 | Paper |
| The query complexity of a permutation-based variant of mastermind | 2019-05-03 | Paper |
| Yes, there is an oblivious RAM lower bound! | 2018-09-26 | Paper |
| Faster Online Matrix-Vector Multiplication | 2018-07-16 | Paper |
| Fully Understanding the Hashing Trick | 2018-05-22 | Paper |
| The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction | 2017-12-19 | Paper |
| Towards Tight Lower Bounds for Range Reporting on the RAM. | 2017-12-19 | Paper |
| Constructive Discrepancy Minimization with Hereditary L2 Guarantees | 2017-11-08 | Paper |
| Approximate Range Emptiness in Constant Time and Optimal Space | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365082 | 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 | 2017-08-17 | Paper |
| How to Prove Knowledge of Small Secrets | 2016-11-09 | Paper |
| Optimality of the Johnson-Lindenstrauss Lemma | 2016-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3467513 | 2016-02-02 | Paper |
| On hardness of several string indexing problems | 2015-04-29 | Paper |
| Linear-space data structures for range mode query in arrays | 2015-02-05 | Paper |
| Optimal Planar Orthogonal Skyline Counting Queries | 2014-09-02 | Paper |
| Succinct sampling from discrete distributions | 2014-08-07 | Paper |
| Improved range searching lower bounds | 2014-08-07 | Paper |
| Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model | 2014-08-07 | Paper |
| On Range Searching in the Group Model and Combinatorial Discrepancy | 2014-07-30 | Paper |
| On Range Searching in the Group Model and Combinatorial Discrepancy | 2014-07-30 | Paper |
| On Hardness of Several String Indexing Problems | 2014-06-30 | Paper |
| The cell probe complexity of dynamic range counting | 2014-05-13 | Paper |
| Orthogonal range searching on the RAM, revisited | 2014-03-24 | Paper |
| The Query Complexity of Finding a Hidden Permutation | 2013-09-13 | Paper |
| (Approximate) uncertain skylines | 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 | N/A | Paper |
