Counting Permutations Modulo Pattern-Replacement Equivalences for Three-Letter Patterns. - William Kuszmaul (Electron. J. Comb., 2013)

Avoiding Tree Saturation in the Face of Many Hotspots with Few Buffers. - Bradley C. Kuszmaul; William H. Kuszmaul (HPCC/CSS/ICESS, 2014)

Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability). - Bradley C. Kuszmaul; William Kuszmaul (SPAA, 2014)

Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. - William Kuszmaul (SPAA, 2016)

Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. - William Kuszmaul (CoRR, 2016)

Signed enumeration of upper-right corners in path shuffles. - William Kuszmaul (Eur. J. Comb., 2017)

On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. - Moses Charikar; Ofir Geri; Michael P. Kim; William Kuszmaul (ICALP, 2018)

Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations. - William Kuszmaul (Math. Comput., 2018)

The One-Way Communication Complexity of Dynamic Time Warping Distance. - Vladimir Braverman; Moses Charikar; William Kuszmaul; David P. Woodruff; Lin F. Yang (SoCG, 2019)

Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. - William Kuszmaul (ICALP, 2019)

Efficiently Approximating Edit Distance Between Pseudorandom Strings. - William Kuszmaul (SODA, 2019)

Achieving optimal backlog in multi-processor cup games. - Michael A. Bender; Martin Farach-Colton; William Kuszmaul (STOC, 2019)

Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. - Tim Kaler; William Kuszmaul; Tao B. Schardl; Daniele Vettorel (APOCS, 2020)

Flushing Without Cascades. - Michael A. Bender; Rathish Das; Martin Farach-Colton; Rob Johnson 001; William Kuszmaul (SODA, 2020)

Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. - William Kuszmaul (SODA, 2020)

Green Paging and Parallel Paging. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SPAA, 2020)

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. - Michael A. Bender; Rezaul Alam Chowdhury; Rathish Das; Rob Johnson 001; William Kuszmaul; Andrea Lincoln; Quanquan C. Liu; Jayson Lynch; Helen Xu 001 (SPAA, 2020)

Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory. - William Kuszmaul; Alek Westover (SPAA, 2020)

Contention resolution without collision detection. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Seth Pettie (STOC, 2020)

In-Place Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory: An In-Place Algorithm With Provably Optimal Cache Behavior. - William Kuszmaul; Alek Westover (CoRR, 2020)

Algorithms and Lower Bounds for the Worker-Task Assignment Problem. - Aaron Berger; William Kuszmaul; Adam Polak 001; Jonathan Tidor; Nicole Wein (CoRR, 2020)

New results on families of pattern-replacement equivalences. - William Kuszmaul; Ziling Zhou (Discret. Math., 2020)

The one-way communication complexity of dynamic time warping distance. - Vladimir Braverman; Moses Charikar; William Kuszmaul; Lin F. Yang (J. Comput. Geom., 2020)

Incremental Edge Orientation in Forests. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Ely Porat; Clifford Stein 001 (ESA, 2021)

Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. - Michael A. Bender; Bradley C. Kuszmaul; William Kuszmaul (FOCS, 2021)

Stochastic and Worst-Case Generalized Sorting Revisited. - William Kuszmaul; Shyam Narayanan (FOCS, 2021)

Train Tracks with Gaps. - William Kuszmaul (FUN, 2021)

The Variable-Processor Cup Game. - William Kuszmaul; Alek Westover (ITCS, 2021)

Tight Bounds for Parallel Paging and Green Paging. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SODA, 2021)

Randomized Cup Game Algorithms Against Strong Adversaries. - Michael A. Bender; William Kuszmaul (SODA, 2021)

Floors and Ceilings in Divide-and-Conquer Recurrences. - William Kuszmaul; Charles E. Leiserson (SOSA, 2021)

Paging and the Address-Translation Problem. - Michael A. Bender; Abhishek Bhattacharjee; Alex Conway 001; Martin Farach-Colton; Rob Johnson 001; Sudarsun Kannan; William Kuszmaul; Nirjhar Mukherjee; Donald E. Porter; Guido Tagliavini; Janet Vorobyeva; Evan West (SPAA, 2021)

How asymmetry helps buffer management: achieving optimal tail size in cup games. - William Kuszmaul (STOC, 2021)

Binary Dynamic Time Warping in Linear Time. - William Kuszmaul (CoRR, 2021)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis. - William Kuszmaul; Qi Qi (CoRR, 2021)

Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering. - Michael A. Bender; Bradley C. Kuszmaul; William Kuszmaul (CoRR, 2021)

All-Purpose Hashing. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini (CoRR, 2021)

Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. - Zoe Xi; William Kuszmaul (ESA, 2022)

Balanced Allocations: The Heavily Loaded Case with Deletions. - Nikhil Bansal 001; William Kuszmaul (FOCS, 2022)

Online List Labeling: Breaking the log2n Barrier. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; Hanna Komlós; William Kuszmaul; Nicole Wein (FOCS, 2022)

A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. - William Kuszmaul (FOCS, 2022)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. - Aaron Berger; William Kuszmaul; Adam Polak 001; Jonathan Tidor; Nicole Wein (ICALP, 2022)

Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. - William Kuszmaul; Shyam Narayanan (ICALP, 2022)

What Does Dynamic Optimality Mean in External Memory? - Michael A. Bender; Martin Farach-Colton; William Kuszmaul (ITCS, 2022)

Online Parallel Paging with Optimal Makespan. - Kunal Agrawal 001; Michael A. Bender; Rathish Das; William Kuszmaul; Enoch Peserico; Michele Scquizzato (SPAA, 2022)

On the optimal time/space tradeoff for hash tables. - Michael A. Bender; Martin Farach-Colton; John Kuszmaul; William Kuszmaul; Mingmou Liu (STOC, 2022)

A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem. - Nikhil Bansal 001; John Kuszmaul; William Kuszmaul (CoRR, 2022)

IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. - Prashant Pandey 001; Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini; Rob Johnson 001 (CoRR, 2022)

Train tracks with gaps: Applying the probabilistic method to trains. - William Kuszmaul (Theor. Comput. Sci., 2022)

Strongly History-Independent Storage Allocation: New Upper and Lower Bounds. - William Kuszmaul (FOCS, 2023)

Tight Bounds for Monotone Minimal Perfect Hashing. - Sepehr Assadi; Martin Farach-Colton; William Kuszmaul (SODA, 2023)

Tiny Pointers. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini (SODA, 2023)

Increment - and - Freeze: Every Cache, Everywhere, All of the Time. - Michael A. Bender; Daniel DeLayo; Bradley C. Kuszmaul; William Kuszmaul; Evan West (SPAA, 2023)

IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. - Prashant Pandey 001; Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini; Rob Johnson 001 (Proc. ACM Manag. Data, 2023)

Randomized Data Structures: New Perspectives and Hidden Surprises - William Kuszmaul (2023)

Mosaic Pages: Big TLB Reach with Small Pages. - Krishnan Gosakan; Jaehyun Han; William Kuszmaul; Ibrahim N. Mubarek; Nirjhar Mukherjee; Karthik Sriram; Guido Tagliavini; Evan West; Michael A. Bender; Abhishek Bhattacharjee; Alex Conway 001; Martin Farach-Colton; et al. (Zenodo, 2023)

A nearly tight lower bound for the d-dimensional cow-path problem. - Nikhil Bansal 001; John Kuszmaul; William Kuszmaul (Inf. Process. Lett., 2023)

Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; William Kuszmaul; Guido Tagliavini (J. ACM, 2023)

Nearly Optimal List Labeling. - Michael A. Bender; Alex Conway 001; Martín Farach-Colton; Hanna Komlós; Michal Koucký 001; William Kuszmaul; Michael E. Saks (FOCS, 2024)

Tight Bounds for Classical Open Addressing. - Michael A. Bender; William Kuszmaul; Renfei Zhou (FOCS, 2024)

Tight Analyses of Ordered and Unordered Linear Probing. - Mark Braverman; William Kuszmaul (FOCS, 2024)

Optimal Bounds for Open Addressing Without Reordering. - Martín Farach-Colton; Andrew Krapivin; William Kuszmaul (FOCS, 2024)

Towards an Analysis of Quadratic Probing. - William Kuszmaul; Zoe Xi (ICALP, 2024)

Modern Hashing Made Simple. - Michael A. Bender; Martín Farach-Colton; John Kuszmaul; William Kuszmaul (SOSA, 2024)

Distributed Load Balancing in the Face of Reappearance Dependencies. - Kunal Agrawal 001; William Kuszmaul; Zhe Wang 056; Jinhao Zhao (SPAA, 2024)

A Nearly Quadratic Improvement for Memory Reallocation. - Martin Farach-Colton; William Kuszmaul; Nathan S. Sheffield; Alek Westover (SPAA, 2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions. - William Kuszmaul; Alek Westover (SPAA, 2024)

Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. - William Kuszmaul; Stefan Walzer (STOC, 2024)

Mosaic Pages: Big TLB Reach With Small Pages. - Jaehyun Han; Krishnan Gosakan; William Kuszmaul; Ibrahim N. Mubarek; Nirjhar Mukherjee; Karthik Sriram; Guido Tagliavini; Evan West; Michael A. Bender; Abhishek Bhattacharjee; Alex Conway 001; Martín Farach-Colton; et al. (IEEE Micro, 2024)

Layered List Labeling. - Michael A. Bender; Alex Conway 001; Martin Farach-Colton; Hanna Komlós; William Kuszmaul (Proc. ACM Manag. Data, 2024)

Efficient d-ary Cuckoo Hashing at High Load Factors by Bubbling Up. - William Kuszmaul; Michael Mitzenmacher (SODA, 2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. - William Kuszmaul; Aaron Putterman; Tingqiang Xu; Hangrui Zhou; Renfei Zhou (SODA, 2025)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations. - William Kuszmaul (SOSA, 2025)

Don't Melt Your Cache: Low-Associativity with Heat-Sink. - Michael A. Bender; Alex Conway 001; Daniel DeLayo; Martin Farach-Colton; Jaehyun Han; Linfeng He; Rob Johnson 001; Sudarsun Kannan; William Kuszmaul; Donald E. Porter; Evan West (SPAA, 2025)

Optimal Non-oblivious Open Addressing. - Michael A. Bender; William Kuszmaul; Renfei Zhou (STOC, 2025)