| Publication | Date of Publication | Type |
|---|
| Towards an analysis of quadratic probing | 2026-01-14 | Paper |
| Memoryless worker-task assignment with polylogarithmic switching cost | 2024-06-24 | Paper |
| Optimal time-backlog tradeoffs for the variable-processor cup game | 2024-06-24 | Paper |
| Modern hashing made simple | 2024-05-29 | Paper |
| Tight bounds for monotone minimal perfect hashing | 2024-05-14 | Paper |
| Tiny pointers | 2024-05-14 | Paper |
| Floors and ceilings in divide-and-conquer recurrences | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829250 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7788461 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788518 (Why is no real title available?) | 2024-01-15 | Paper |
On the optimal time/space tradeoff for hash tables
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On the optimal time/space tradeoff for hash tables
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
How asymmetry helps buffer management: achieving optimal tail size in cup games
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Incremental Edge Orientation in Forests
(available as arXiv preprint) | 2023-09-20 | Paper |
A nearly tight lower bound for the \(d\)-dimensional cow-path problem
Information Processing Letters | 2023-06-05 | Paper |
| Train tracks with gaps | 2023-02-07 | Paper |
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559216 (Why is no real title available?) | 2022-07-18 | Paper |
| Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game | 2022-05-03 | Paper |
Train tracks with gaps: applying the probabilistic method to trains
Theoretical Computer Science | 2021-12-22 | Paper |
scientific article; zbMATH DE number 7375961 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-28 | Paper |
| Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering | 2021-07-02 | Paper |
The one-way communication complexity of dynamic time warping distance
(available as arXiv preprint) | 2021-03-17 | Paper |
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Flushing Without Cascades
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Contention resolution without collision detection
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Train Tracks with Gaps: Applying the Probabilistic Method to Trains
(available as arXiv preprint) | 2020-12-01 | Paper |
New results on families of pattern-replacement equivalences
Discrete Mathematics | 2020-05-21 | Paper |
Achieving optimal backlog in multi-processor cup games
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Efficiently approximating edit distance between pseudorandom strings
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
Mathematics of Computation | 2018-01-12 | Paper |
Signed enumeration of upper-right corners in path shuffles
European Journal of Combinatorics | 2016-11-07 | Paper |
Counting permutations modulo pattern-replacement equivalences for three-letter patterns
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Counting permutations modulo pattern-replacement equivalences for three-letter patterns
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
| A New Approach to Enumerating Statistics Modulo $n$ | 2014-02-16 | Paper |
| New Results on Doubly Adjacent Pattern-Replacement Equivalences | 2014-02-16 | Paper |
Lower central series of a free associative algebra over the integers and finite fields.
Journal of Algebra | 2013-06-24 | Paper |
| Equivalence Classes in $S_n$ for Three Families of Pattern-Replacement Relations | 2013-04-20 | Paper |
