| Publication | Date of Publication | Type |
|---|
| How to approximate a set without knowing its size in advance | 2025-05-20 | Paper |
| Lower bounds on near neighbor search via metric expansion | 2025-04-29 | Paper |
| Multicalibrated partitions for importance weights | 2025-02-11 | Paper |
| Loss minimization through the Lens of outcome indistinguishability | 2024-09-25 | Paper |
scientific article; zbMATH DE number 7829311 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7650432 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Finding Skewed Subcubes Under a Distribution
(available as arXiv preprint) | 2019-11-17 | Paper |
Minimum makespan scheduling with low rank processing times
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Efficient circuit-based PSI via cuckoo hashing | 2018-07-17 | Paper |
Hashing, load balancing and multiple choice
Foundations and Trends® in Theoretical Computer Science | 2017-09-04 | Paper |
| Approximate nearest neighbor search in metrics of planar graphs | 2017-08-31 | Paper |
Graphical balanced allocations and the \((1+\beta )\)-choice process
Random Structures & Algorithms | 2016-01-07 | Paper |
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Routing complexity of faulty networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Balls and Bins: Smaller Hash Families and Faster Evaluation
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Balanced allocations: a simple proof for the heavily loaded case
Automata, Languages, and Programming | 2014-07-01 | Paper |
Changing bases: multistage optimization for matroids and matchings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Pseudorandom Graphs in Data Structures
Automata, Languages, and Programming | 2014-07-01 | Paper |
| The \((1 + {\beta})\)-choice process and weighted balls-into-bins | 2014-05-22 | Paper |
Balls and bins: smaller hash families and faster evaluation
SIAM Journal on Computing | 2013-09-25 | Paper |
The expansion and mixing time of skip graphs with applications
Distributed Computing | 2013-06-28 | Paper |
Scalable and dynamic quorum systems
Distributed Computing | 2013-06-07 | Paper |
Strong-diameter decompositions of minor free graphs
Theory of Computing Systems | 2010-12-17 | Paper |
More robust hashing: cuckoo hashing with a stash
SIAM Journal on Computing | 2010-09-06 | Paper |
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Novel architectures for P2P applications: the continuous-discrete approach
ACM Transactions on Algorithms | 2010-08-14 | Paper |
| scientific article; zbMATH DE number 5764889 (Why is no real title available?) | 2010-08-06 | Paper |
Virtual Ring Routing Trends
Lecture Notes in Computer Science | 2009-11-19 | Paper |
| scientific article; zbMATH DE number 5485459 (Why is no real title available?) | 2009-01-05 | Paper |
More Robust Hashing: Cuckoo Hashing with a Stash
Algorithms - ESA 2008 | 2008-11-25 | Paper |
History-Independent Cuckoo Hashing
Automata, Languages and Programming | 2008-08-19 | Paper |
Routing complexity of faulty networks
Random Structures & Algorithms | 2008-01-18 | Paper |
| scientific article; zbMATH DE number 1947051 (Why is no real title available?) | 2003-07-07 | Paper |
