| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6059375 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874376 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075744 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075822 | 2022-05-11 | Paper |
| Private aggregation from fewer anonymous messages | 2022-03-23 | Paper |
| Simple multi-party set reconciliation | 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 | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136262 | 2020-11-25 | Paper |
| The space complexity of inner product filters | 2019-09-24 | Paper |
| On Parallelizing Matrix Multiplication by the Column-Row Method | 2019-09-12 | Paper |
| Theory and Practise of Monotone Minimal Perfect Hashing | 2019-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743422 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633891 | 2019-05-06 | Paper |
| CoveringLSH | 2018-11-13 | Paper |
| Locality-sensitive Hashing without False Negatives | 2018-07-16 | Paper |
| Parameter-free Locality Sensitive Hashing for Spherical Range Reporting | 2018-07-16 | Paper |
| Distance Sensitive Bloom Filters Without False Negatives | 2018-07-16 | Paper |
| I/O-efficient similarity join | 2017-10-10 | Paper |
| Efficiently correcting matrix products | 2017-10-10 | Paper |
| Approximate Range Emptiness in Constant Time and Optimal Space | 2017-10-05 | Paper |
| Set similarity search beyond MinHash | 2017-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5272916 | 2017-07-05 | Paper |
| Triangle counting in dynamic graph streams | 2016-11-01 | Paper |
| Compressed matrix multiplication | 2016-10-07 | Paper |
| I/O-Efficient Similarity Join | 2015-11-19 | Paper |
| Compressed matrix multiplication | 2015-09-24 | Paper |
| From Independence to Expansion and Back Again | 2015-08-21 | Paper |
| On the cell probe complexity of membership and perfect hashing | 2015-02-27 | Paper |
| Cache-oblivious hashing | 2014-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921747 | 2014-10-13 | Paper |
| The Input/Output Complexity of Sparse Matrix Multiplication | 2014-10-08 | Paper |
| Triangle counting in dynamic graph streams | 2014-09-02 | Paper |
| Consistent Subset Sampling | 2014-09-02 | Paper |
| Thresholds for extreme orientability | 2014-07-03 | Paper |
| Better size estimation for sparse matrix products | 2014-07-03 | Paper |
| Listing Triangles | 2014-07-01 | Paper |
| Theory and practice of monotone minimal perfect hashing | 2014-04-01 | Paper |
| Colorful triangle counting and a \textsc{MapReduce} implementation | 2012-05-04 | Paper |
| Linear Probing with 5-wise Independence | 2012-02-11 | Paper |
| Dispersing hash functions | 2010-11-09 | Paper |
| Better size estimation for sparse matrix products | 2010-09-10 | Paper |
| Tight Thresholds for Cuckoo Hashing via XORSAT | 2010-09-07 | Paper |
| Fast Prefix Search in Little Space, with Applications | 2010-09-06 | Paper |
| Uniform hashing in constant time and linear space | 2010-08-16 | Paper |
| On dynamic range reporting in one dimension | 2010-08-16 | Paper |
| Linear Probing with Constant Independence | 2010-07-07 | Paper |
| Storing a Compressed Function with Constant Time Access | 2009-10-29 | Paper |
| Optimality in external memory hashing | 2009-03-24 | Paper |
| Uniform Hashing in Constant Time and Optimal Space | 2009-03-16 | Paper |
| Simple and Space-Efficient Minimal Perfect Hash Functions | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549628 | 2009-01-05 | Paper |
| De Dictionariis Dynamicis Pauco Spatio Utentibus | 2008-09-18 | Paper |
| Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) | 2008-08-28 | Paper |
| Fast Evaluation of Union-Intersection Expressions | 2008-05-27 | Paper |
| External String Sorting: Faster and Cache-Oblivious | 2008-03-19 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024761 | 2005-07-04 | Paper |
| Space efficient hash tables with worst case constant access time | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828910 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737178 | 2004-08-11 | Paper |
| Cuckoo hashing | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428990 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418656 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796171 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796183 | 2003-03-02 | Paper |
| Deterministic Dictionaries | 2002-08-01 | Paper |
| Low Redundancy in Static Dictionaries with Constant Query Time | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708229 | 2001-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721965 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952655 | 2000-05-10 | Paper |
