William Kuszmaul

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 88

Top Topics

Dynamic Time Warping

Top Venues

Publications

Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover
A Nearly Quadratic Improvement for Memory Reallocation. SPAA (2024)
William Kuszmaul, Alek Westover
Scheduling Jobs with Work-Inefficient Parallel Solutions. CoRR (2024)
Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul
Layered List Labeling. Proc. ACM Manag. Data 2 (2) (2024)
William Kuszmaul, Stefan Walzer
Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. STOC (2024)
Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks
Nearly Optimal List Labeling. CoRR (2024)
Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul
Modern Hashing Made Simple. SOSA (2024)
Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul
Layered List Labeling. CoRR (2024)
Kunal Agrawal, William Kuszmaul, Zhe Wang, Jinhao Zhao
Distributed Load Balancing in the Face of Reappearance Dependencies. SPAA (2024)
Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover
A Nearly Quadratic Improvement for Memory Reallocation. CoRR (2024)
William Kuszmaul, Zoe Xi
Towards an Analysis of Quadratic Probing. ICALP (2024)
William Kuszmaul, Alek Westover
Scheduling Jobs with Work-Inefficient Parallel Solutions. SPAA (2024)
Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
Tight Bounds for Monotone Minimal Perfect Hashing. SODA (2023)
Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity. Proc. ACM Manag. Data 1 (1) (2023)
Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. J. ACM 70 (6) (2023)
Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West
Increment - and - Freeze: Every Cache, Everywhere, All of the Time. SPAA (2023)
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
Mosaic Pages: Big TLB Reach with Small Pages. ASPLOS (3) (2023)
Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini
Tiny Pointers. SODA (2023)
Nikhil Bansal, John Kuszmaul, William Kuszmaul
-dimensional cow-path problem. Inf. Process. Lett. 182 (2023)
William Kuszmaul
Strongly History-Independent Storage Allocation: New Upper and Lower Bounds. FOCS (2023)
Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
Tight Bounds for Monotone Minimal Perfect Hashing. CoRR (2022)
Michael A. Bender, Martin Farach-Colton, William Kuszmaul
What Does Dynamic Optimality Mean in External Memory? CoRR (2022)
Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. FOCS (2022)
William Kuszmaul
Train tracks with gaps: Applying the probabilistic method to trains. Theor. Comput. Sci. 899 (2022)
Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP (2022)
Prashant Pandey, Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson
IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity. CoRR (2022)
Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
n Barrier. FOCS (2022)
Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
n Barrier. CoRR (2022)
Michael A. Bender, Martin Farach-Colton, William Kuszmaul
What Does Dynamic Optimality Mean in External Memory? ITCS (2022)
Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu
On the optimal time/space tradeoff for hash tables. STOC (2022)
Nikhil Bansal, John Kuszmaul, William Kuszmaul
A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem. CoRR (2022)
Zoe Xi, William Kuszmaul
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. ESA (2022)
Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato
Online Parallel Paging with Optimal Makespan. SPAA (2022)
William Kuszmaul
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. CoRR (2022)
Nikhil Bansal, William Kuszmaul
Balanced Allocations: The Heavily Loaded Case with Deletions. CoRR (2022)
William Kuszmaul, Shyam Narayanan
Stochastic and Worst-Case Generalized Sorting Revisited. FOCS (2022)
William Kuszmaul, Shyam Narayanan
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. ICALP (2022)
William Kuszmaul, Shyam Narayanan
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. CoRR (2022)
Zoe Xi, William Kuszmaul
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. CoRR (2022)
William Kuszmaul
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. FOCS (2022)
Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini
Tiny Pointers. CoRR (2021)
Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu
On the Optimal Time/Space Tradeoff for Hash Tables. CoRR (2021)
William Kuszmaul
How asymmetry helps buffer management: achieving optimal tail size in cup games. STOC (2021)
William Kuszmaul
Train Tracks with Gaps. FUN (2021)
William Kuszmaul, Shyam Narayanan
Stochastic and Worst-Case Generalized Sorting Revisited. CoRR (2021)
William Kuszmaul, Shyam Narayanan
Stochastic and Worst-Case Generalized Sorting Revisited. FOCS (2021)
Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini
All-Purpose Hashing. CoRR (2021)
William Kuszmaul, Qi Qi
The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis. CoRR (2021)
William Kuszmaul, Alek Westover
The Variable-Processor Cup Game. ITCS (2021)
Michael A. Bender, William Kuszmaul
Randomized Cup Game Algorithms Against Strong Adversaries. SODA (2021)
Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul
Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering. CoRR (2021)
William Kuszmaul
How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games. CoRR (2021)
William Kuszmaul
Binary Dynamic Time Warping in Linear Time. CoRR (2021)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein
Incremental Edge Orientation in Forests. CoRR (2021)
Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. FOCS (2021)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein
Incremental Edge Orientation in Forests. ESA (2021)
William Kuszmaul, Charles E. Leiserson
Floors and Ceilings in Divide-and-Conquer Recurrences. SOSA (2021)
Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato
Tight Bounds for Parallel Paging and Green Paging. SODA (2021)
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
Paging and the Address-Translation Problem. SPAA (2021)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie
Contention resolution without collision detection. STOC (2020)
William Kuszmaul, Ziling Zhou
New results on families of pattern-replacement equivalences. Discret. Math. 343 (7) (2020)
Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA (2020)
William Kuszmaul, Alek Westover
In-Place Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory: An In-Place Algorithm With Provably Optimal Cache Behavior. CoRR (2020)
Vladimir Braverman, Moses Charikar, William Kuszmaul, Lin F. Yang
The one-way communication complexity of dynamic time warping distance. J. Comput. Geom. 11 (2) (2020)
Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR (2020)
Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul
Flushing Without Cascades. SODA (2020)
William Kuszmaul
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. SODA (2020)
William Kuszmaul
Train Tracks with Gaps: Applying the Probabilistic Method to Trains. CoRR (2020)
Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato
Green Paging and Parallel Paging. SPAA (2020)
Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. APOCS (2020)
William Kuszmaul, Alek Westover
The Variable-Processor Cup Game. CoRR (2020)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie
Contention Resolution Without Collision Detection. CoRR (2020)
William Kuszmaul, Alek Westover
Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory. SPAA (2020)
William Kuszmaul
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. CoRR (2019)
William Kuszmaul
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. CoRR (2019)
Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang
The One-Way Communication Complexity of Dynamic Time Warping Distance. SoCG (2019)
Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. CoRR (2019)
William Kuszmaul
Efficiently Approximating Edit Distance Between Pseudorandom Strings. SODA (2019)
Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang
The One-Way Communication Complexity of Dynamic Time Warping Distance. CoRR (2019)
Michael A. Bender, Martin Farach-Colton, William Kuszmaul
Achieving Optimal Backlog in Multi-Processor Cup Games. CoRR (2019)
Michael A. Bender, Martin Farach-Colton, William Kuszmaul
Achieving optimal backlog in multi-processor cup games. STOC (2019)
William Kuszmaul
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. ICALP (2019)
William Kuszmaul
Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations. Math. Comput. 87 (310) (2018)
Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. CoRR (2018)
William Kuszmaul
Efficiently Approximating Edit Distance Between Pseudorandom Strings. CoRR (2018)
Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. ICALP (2018)
William Kuszmaul
Signed enumeration of upper-right corners in path shuffles. Eur. J. Comb. 60 (2017)
William Kuszmaul
Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. CoRR (2016)
William Kuszmaul
Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. SPAA (2016)
William Kuszmaul
Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations. CoRR (2015)
Bradley C. Kuszmaul, William Kuszmaul
Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability). SPAA (2014)
William Kuszmaul
Counting Permutations Modulo Pattern-Replacement Equivalences for Three-Letter Patterns. Electron. J. Comb. 20 (4) (2013)