| Publication | Date of Publication | Type |
|---|
The Probability to Hit Every Bin with a Linear Number of Balls
(available as arXiv preprint) | N/A | Paper |
| Testing depth first search numbering | 2026-08-31 | Paper |
| A simple yet exact analysis of the MultiQueue | 2026-08-31 | Paper |
| Engineering minimal \(k\)-perfect hash functions (edit) | 2026-08-31 | Paper |
| Combined search and encoding for seeds, with an application to minimal perfect hashing | 2026-08-31 | Paper |
| PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding | 2026-05-26 | Paper |
Ribbon: fast succinct static retrieval and approximate membership
Journal of the ACM | 2026-04-09 | Paper |
| Better space-time-robustness trade-offs for set reconciliation | 2026-01-14 | Paper |
Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
ACM Transactions on Algorithms | 2025-10-01 | Paper |
ShockHash: near optimal-space minimal perfect hashing beyond brute-force
Algorithmica | 2025-09-24 | Paper |
| Insertion time of random walk cuckoo hashing below the peeling threshold | 2025-06-19 | Paper |
| A sublinear local access implementation for the Chinese restaurant process | 2024-08-22 | Paper |
| ShockHash: towards optimal-space minimal perfect hashing beyond brute-force | 2024-05-29 | Paper |
| SicHash -- small irregular cuckoo tables for perfect hashing | 2024-05-24 | Paper |
| Simple set sketching | 2024-05-14 | Paper |
What if we tried less power? Lessons from studying the power of choices in hashing-based data structures
(available as arXiv preprint) | 2024-02-06 | Paper |
| What if we tried less power? Lessons from studying the power of choices in hashing-based data structures | 2024-02-06 | Paper |
scientific article; zbMATH DE number 7788469 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Load Thresholds for Cuckoo Hashing with Overlapping Blocks
ACM Transactions on Algorithms | 2023-10-23 | Paper |
| Foundations for actively secure card-based cryptography | 2023-02-07 | Paper |
| Constant-time retrieval with O( m) extra bits | 2022-07-18 | Paper |
Dense peelable random uniform hypergraphs
(available as arXiv preprint) | 2022-05-11 | Paper |
scientific article; zbMATH DE number 7525476 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
A subquadratic algorithm for 3XOR
(available as arXiv preprint) | 2021-08-04 | Paper |
Load Thresholds for Cuckoo Hashing with Overlapping Blocks
(available as arXiv preprint) | 2021-07-28 | Paper |
| Load thresholds for cuckoo hashing with double hashing | 2020-08-25 | Paper |
Dynamic space efficient hashing
Algorithmica | 2019-06-27 | Paper |
Dynamic space efficient hashing
Algorithmica | 2019-06-27 | Paper |
| The minimum number of cards in practical card-based protocols | 2018-02-23 | Paper |
Boolean lattices: Ramsey properties and embeddings
Order | 2017-10-06 | Paper |
Card-based cryptographic protocols using a minimal number of cards
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Playing weighted Tron on trees
Discrete Mathematics | 2015-08-05 | Paper |
Packing polyominoes clumsily
Computational Geometry | 2014-01-08 | Paper |
