William Kuszmaul
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
54
Venues
8
Active years
2014–2026
Best venue rank
A*
Where they publish
Papers
54 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | History Independence as an Algorithmic Tool (Invited Talk). | William Kuszmaul |
| 2026 | SODA | History-Independent Load Balancing. | Michael A. Bender, William Kuszmaul, Elaine Shi, Rose Silver |
| 2026 | SODA | History-Independent Maximal Matchings can be Surprisingly Efficient, and Lead to Better Worst-Case Guarantees. | Rathish Das, William Kuszmaul |
| 2026 | SODA | Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck. | William Kuszmaul, Jingxun Liang, Renfei Zhou |
| 2026 | STOC | Greedy Open Addressing Revisited: Beyond Yao's Lower Bound. | Martn Farach-Colton, Andrew Krapivin, William Kuszmaul |
| 2026 | SPAA | The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically. | Michael A. Bender, Philip Bille, Martn Farach-Colton, Jeremy T. Fineman, Inge Li Grtz, Michael T. Goodrich, Hanna Komls, Bradley C. Kuszmaul, William Kuszmaul, Rose Silver, Todd Veldhuizen, Renfei Zhou |
| 2025 | FOCS | Static Retrieval Revisited: To Optimality and Beyond. | Yang Hu, William Kuszmaul, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou |
| 2025 | FOCS | Fingerprint Filters Are Optimal. | William Kuszmaul, Jingxun Liang, Renfei Zhou |
| 2025 | SODA | Efficient | William Kuszmaul, Michael Mitzenmacher |
| 2025 | SODA | Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. | William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou |
| 2025 | STOC | Optimal Non-oblivious Open Addressing. | Michael A. Bender, William Kuszmaul, Renfei Zhou |
| 2025 | SPAA | Don't Melt Your Cache: Low-Associativity with Heat-Sink. | Michael A. Bender, Alex Conway, Daniel DeLayo, Martin Farach-Colton, Jaehyun Han, Linfeng He, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Donald E. Porter, Evan West |
| 2024 | FOCS | Nearly Optimal List Labeling. | Michael A. Bender, Alex Conway, Martn Farach-Colton, Hanna Komls, Michal Kouck, William Kuszmaul, Michael E. Saks |
| 2024 | FOCS | Tight Bounds for Classical Open Addressing. | Michael A. Bender, William Kuszmaul, Renfei Zhou |
| 2024 | FOCS | Tight Analyses of Ordered and Unordered Linear Probing. | Mark Braverman, William Kuszmaul |
| 2024 | FOCS | Optimal Bounds for Open Addressing Without Reordering. | Martn Farach-Colton, Andrew Krapivin, William Kuszmaul |
| 2024 | ICALP | Towards an Analysis of Quadratic Probing. | William Kuszmaul, Zoe Xi |
| 2024 | STOC | Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. | William Kuszmaul, Stefan Walzer |
| 2024 | SPAA | Distributed Load Balancing in the Face of Reappearance Dependencies. | Kunal Agrawal, William Kuszmaul, Zhe Wang, Jinhao Zhao |
| 2024 | SPAA | A Nearly Quadratic Improvement for Memory Reallocation. | Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover |
| 2024 | SPAA | Scheduling Jobs with Work-Inefficient Parallel Solutions. | William Kuszmaul, Alek Westover |
| 2023 | ASPLOS | 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, Martin Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter |
| 2023 | FOCS | Strongly History-Independent Storage Allocation: New Upper and Lower Bounds. | William Kuszmaul |
| 2023 | SODA | Tight Bounds for Monotone Minimal Perfect Hashing. | Sepehr Assadi, Martin Farach-Colton, William Kuszmaul |
| 2023 | SODA | Tiny Pointers. | Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini |
| 2023 | SPAA | Increment - and - Freeze: Every Cache, Everywhere, All of the Time. | Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West |
| 2022 | ESA | Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. | Zoe Xi, William Kuszmaul |
| 2022 | FOCS | Balanced Allocations: The Heavily Loaded Case with Deletions. | Nikhil Bansal, William Kuszmaul |
| 2022 | FOCS | Online List Labeling: Breaking the log | Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komls, William Kuszmaul, Nicole Wein |
| 2022 | FOCS | A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. | William Kuszmaul |
| 2022 | ICALP | Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. | Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein |
| 2022 | ICALP | Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. | William Kuszmaul, Shyam Narayanan |
| 2022 | STOC | On the optimal time/space tradeoff for hash tables. | Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu |
| 2022 | SPAA | Online Parallel Paging with Optimal Makespan. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2021 | ESA | Incremental Edge Orientation in Forests. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein |
| 2021 | FOCS | Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. | Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul |
| 2021 | FOCS | Stochastic and Worst-Case Generalized Sorting Revisited. | William Kuszmaul, Shyam Narayanan |
| 2021 | FUN | Train Tracks with Gaps. | William Kuszmaul |
| 2021 | SODA | Tight Bounds for Parallel Paging and Green Paging. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2021 | SODA | Randomized Cup Game Algorithms Against Strong Adversaries. | Michael A. Bender, William Kuszmaul |
| 2021 | STOC | How asymmetry helps buffer management: achieving optimal tail size in cup games. | William Kuszmaul |
| 2021 | SPAA | Paging and the Address-Translation Problem. | Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West |
| 2020 | SODA | Flushing Without Cascades. | Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul |
| 2020 | SODA | Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. | William Kuszmaul |
| 2020 | STOC | Contention resolution without collision detection. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie |
| 2020 | SPAA | Green Paging and Parallel Paging. | Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2020 | SPAA | Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. | Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu |
| 2020 | SPAA | Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory. | William Kuszmaul, Alek Westover |
| 2019 | ICALP | Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. | William Kuszmaul |
| 2019 | SODA | Efficiently Approximating Edit Distance Between Pseudorandom Strings. | William Kuszmaul |
| 2019 | STOC | Achieving optimal backlog in multi-processor cup games. | Michael A. Bender, Martin Farach-Colton, William Kuszmaul |
| 2018 | ICALP | On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. | Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul |
| 2016 | SPAA | Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. | William Kuszmaul |
| 2014 | SPAA | Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability). | Bradley C. Kuszmaul, William Kuszmaul |