| Publication | Date of Publication | Type |
|---|
Shannon meets Gray: noise-robust, low-sensitivity codes with applications in differential privacy
| 2024-11-28 | Paper |
Simple set sketching
| 2024-05-14 | Paper |
Pure differentially private summation from anonymous messages
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7651000 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7525447 (Why is no real title available?)
| 2022-05-11 | Paper |
scientific article; zbMATH DE number 7525511 (Why is no real title available?)
| 2022-05-11 | Paper |
Private aggregation from fewer anonymous messages
| 2022-03-23 | Paper |
Simple multi-party set reconciliation
Distributed Computing | 2022-02-15 | Paper |
On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
| 2021-12-08 | Paper |
Oblivious Sketching of High-Degree Polynomial Kernels
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
scientific article; zbMATH DE number 7278047 (Why is no real title available?)
| 2020-11-25 | Paper |
The space complexity of inner product filters
| 2019-09-24 | Paper |
On parallelizing matrix multiplication by the column-row method
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Theory and practice of monotone minimal perfect hashing
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
I/O-efficient data structures for colored range and prefix reporting
| 2019-05-10 | Paper |
scientific article; zbMATH DE number 7051248 (Why is no real title available?)
| 2019-05-06 | Paper |
CoveringLSH: locality-sensitive hashing without false negatives
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Locality-sensitive hashing without false negatives
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Parameter-free locality sensitive hashing for spherical range reporting
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Distance sensitive Bloom filters without false negatives
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Efficiently correcting matrix products
Algorithmica | 2017-10-10 | Paper |
I/O-efficient similarity join
Algorithmica | 2017-10-10 | 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 |
Set similarity search beyond MinHash
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Large-scale similarity joins with guarantees (invited talk)
| 2017-07-05 | Paper |
Triangle counting in dynamic graph streams
Algorithmica | 2016-11-01 | Paper |
Compressed matrix multiplication
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
I/O-efficient similarity join
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Compressed matrix multiplication
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
From independence to expansion and back again
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
On the cell probe complexity of membership and perfect hashing
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Cache-oblivious hashing
Algorithmica | 2014-11-19 | Paper |
An optimal bloom filter replacement
| 2014-10-13 | Paper |
The input/output complexity of sparse matrix multiplication
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Consistent subset sampling
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Triangle counting in dynamic graph streams
Lecture Notes in Computer Science | 2014-09-02 | Paper |
Thresholds for extreme orientability
Algorithmica | 2014-07-03 | Paper |
Better size estimation for sparse matrix products
Algorithmica | 2014-07-03 | Paper |
Listing triangles
Automata, Languages, and Programming | 2014-07-01 | Paper |
Theory and practice of monotone minimal perfect hashing
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Colorful triangle counting and a \textsc{MapReduce} implementation
Information Processing Letters | 2012-05-04 | Paper |
Linear probing with 5-wise independence
SIAM Review | 2012-02-11 | Paper |
Dispersing Hash functions
Random Structures \& Algorithms | 2010-11-09 | Paper |
Better size estimation for sparse matrix products
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
Fast prefix search in little space, with applications
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 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 |
Linear probing with constant independence
SIAM Journal on Computing | 2010-07-07 | Paper |
Storing a Compressed Function with Constant Time Access
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Optimality in external memory hashing
Algorithmica | 2009-03-24 | Paper |
Uniform Hashing in Constant Time and Optimal Space
SIAM Journal on Computing | 2009-03-16 | Paper |
Simple and Space-Efficient Minimal Perfect Hash Functions
Lecture Notes in Computer Science | 2009-02-17 | Paper |
scientific article; zbMATH DE number 5485466 (Why is no real title available?)
| 2009-01-05 | Paper |
De Dictionariis Dynamicis Pauco Spatio Utentibus
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Fast Evaluation of Union-Intersection Expressions
Algorithms and Computation | 2008-05-27 | Paper |
External String Sorting: Faster and Cache-Oblivious
STACS 2006 | 2008-03-19 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2185600 (Why is no real title available?)
| 2005-07-04 | Paper |
Space efficient hash tables with worst case constant access time
Theory of Computing Systems | 2005-04-19 | Paper |
scientific article; zbMATH DE number 2119639 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2086642 (Why is no real title available?)
| 2004-08-11 | Paper |
Cuckoo hashing
Journal of Algorithms | 2004-08-06 | Paper |
scientific article; zbMATH DE number 1984679 (Why is no real title available?)
| 2003-09-22 | Paper |
scientific article; zbMATH DE number 1962820 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1875424 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1875412 (Why is no real title available?)
| 2003-03-02 | Paper |
Deterministic dictionaries
Journal of Algorithms | 2002-08-01 | Paper |
Low redundancy in static dictionaries with constant query time
SIAM Journal on Computing | 2002-04-23 | Paper |
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing | 2001-08-14 | Paper |
scientific article; zbMATH DE number 1617245 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1445338 (Why is no real title available?)
| 2000-05-10 | Paper |
