default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Kuszmaul
William H. Kuszmaul
Person information
- affiliation: Massachusetts Institute of Technology (MIT), PRIMES, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Jaehyun Han
, Krishnan Gosakan, William Kuszmaul, Ibrahim N. Mubarek, Nirjhar Mukherjee, Karthik Sriram, Guido Tagliavini, Evan West, Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martín Farach-Colton, Jayneel Gandhi, Rob Johnson, Sudarsun Kannan, Donald E. Porter:
Mosaic Pages: Big TLB Reach With Small Pages. IEEE Micro 44(4): 52-59 (2024)- [j10]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul:
Layered List Labeling. Proc. ACM Manag. Data 2(2): 101 (2024) - [c45]William Kuszmaul, Zoe Xi:
Towards an Analysis of Quadratic Probing. ICALP 2024: 103:1-103:19 - [c44]Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul:
Modern Hashing Made Simple. SOSA 2024: 363-373 - [c43]William Kuszmaul, Alek Westover:
Scheduling Jobs with Work-Inefficient Parallel Solutions. SPAA 2024: 101-111 - [c42]Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover:
A Nearly Quadratic Improvement for Memory Reallocation. SPAA 2024: 125-135 - [c41]Kunal Agrawal, William Kuszmaul, Zhe Wang, Jinhao Zhao:
Distributed Load Balancing in the Face of Reappearance Dependencies. SPAA 2024: 321-330 - [c40]William Kuszmaul, Stefan Walzer:
Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval. STOC 2024: 1153-1164 - [i37]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul:
Layered List Labeling. CoRR abs/2404.16623 (2024) - [i36]Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks:
Nearly Optimal List Labeling. CoRR abs/2405.00807 (2024) - [i35]William Kuszmaul, Alek Westover:
Scheduling Jobs with Work-Inefficient Parallel Solutions. CoRR abs/2405.11986 (2024) - [i34]Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover:
A Nearly Quadratic Improvement for Memory Reallocation. CoRR abs/2405.12152 (2024) - [i33]Michael A. Bender, William Kuszmaul, Renfei Zhou:
Tight Bounds for Classical Open Addressing. CoRR abs/2409.11280 (2024) - 2023
- [b1]William Kuszmaul:
Randomized Data Structures: New Perspectives and Hidden Surprises. MIT, USA, 2023 - [j9]Nikhil Bansal, John Kuszmaul, William Kuszmaul:
A nearly tight lower bound for the d-dimensional cow-path problem. Inf. Process. Lett. 182: 106389 (2023) - [j8]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): 40:1-40:51 (2023) - [j7]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): 47:1-47:26 (2023) - [c39]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: 433-448 - [c38]William Kuszmaul:
Strongly History-Independent Storage Allocation: New Upper and Lower Bounds. FOCS 2023: 1822-1841 - [c37]Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. SODA 2023: 456-476 - [c36]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. SODA 2023: 477-508 - [c35]Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West:
Increment - and - Freeze: Every Cache, Everywhere, All of the Time. SPAA 2023: 129-139 - [d1]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. Zenodo, 2023
- 2022
- [j6]William Kuszmaul:
Train tracks with gaps: Applying the probabilistic method to trains. Theor. Comput. Sci. 899: 39-47 (2022) - [c34]Zoe Xi, William Kuszmaul:
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. ESA 2022: 90:1-90:19 - [c33]Nikhil Bansal, William Kuszmaul:
Balanced Allocations: The Heavily Loaded Case with Deletions. FOCS 2022: 801-812 - [c32]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. FOCS 2022: 980-990 - [c31]William Kuszmaul:
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. FOCS 2022: 991-1001 - [c30]Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein:
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP 2022: 19:1-19:19 - [c29]William Kuszmaul, Shyam Narayanan:
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. ICALP 2022: 85:1-85:20 - [c28]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? ITCS 2022: 18:1-18:23 - [c27]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Online Parallel Paging with Optimal Makespan. SPAA 2022: 205-216 - [c26]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the optimal time/space tradeoff for hash tables. STOC 2022: 1284-1297 - [i32]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
What Does Dynamic Optimality Mean in External Memory? CoRR abs/2201.01742 (2022) - [i31]Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. CoRR abs/2203.02763 (2022) - [i30]William Kuszmaul, Shyam Narayanan:
Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game. CoRR abs/2205.01722 (2022) - [i29]Nikhil Bansal, William Kuszmaul:
Balanced Allocations: The Heavily Loaded Case with Deletions. CoRR abs/2205.06558 (2022) - [i28]Zoe Xi, William Kuszmaul:
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. CoRR abs/2207.00915 (2022) - [i27]Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. CoRR abs/2207.10556 (2022) - [i26]William Kuszmaul:
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. CoRR abs/2209.06038 (2022) - [i25]Nikhil Bansal, John Kuszmaul, William Kuszmaul:
A Nearly Tight Lower Bound for the d-Dimensional Cow-Path Problem. CoRR abs/2209.08427 (2022) - [i24]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 abs/2210.04068 (2022) - 2021
- [c25]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. ESA 2021: 12:1-12:18 - [c24]William Kuszmaul, Shyam Narayanan:
Stochastic and Worst-Case Generalized Sorting Revisited. FOCS 2021: 1056-1067 - [c23]Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul:
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. FOCS 2021: 1171-1182 - [c22]William Kuszmaul:
Train Tracks with Gaps. FUN 2021: 19:1-19:11 - [c21]William Kuszmaul, Alek Westover:
The Variable-Processor Cup Game. ITCS 2021: 16:1-16:20 - [c20]Michael A. Bender, William Kuszmaul:
Randomized Cup Game Algorithms Against Strong Adversaries. SODA 2021: 2059-2077 - [c19]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Tight Bounds for Parallel Paging and Green Paging. SODA 2021: 3022-3041 - [c18]William Kuszmaul, Charles E. Leiserson:
Floors and Ceilings in Divide-and-Conquer Recurrences. SOSA 2021: 133-141 - [c17]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: 105-117 - [c16]William Kuszmaul:
How asymmetry helps buffer management: achieving optimal tail size in cup games. STOC 2021: 1248-1261 - [i23]William Kuszmaul:
Binary Dynamic Time Warping in Linear Time. CoRR abs/2101.01108 (2021) - [i22]William Kuszmaul, Qi Qi:
The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis. CoRR abs/2102.05077 (2021) - [i21]William Kuszmaul:
How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games. CoRR abs/2104.05172 (2021) - [i20]Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul:
Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering. CoRR abs/2107.01250 (2021) - [i19]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. CoRR abs/2107.02318 (2021) - [i18]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
All-Purpose Hashing. CoRR abs/2109.04548 (2021) - [i17]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the Optimal Time/Space Tradeoff for Hash Tables. CoRR abs/2111.00602 (2021) - [i16]William Kuszmaul, Shyam Narayanan:
Stochastic and Worst-Case Generalized Sorting Revisited. CoRR abs/2111.07222 (2021) - [i15]Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
Tiny Pointers. CoRR abs/2111.12800 (2021) - 2020
- [j5]William Kuszmaul, Ziling Zhou:
New results on families of pattern-replacement equivalences. Discret. Math. 343(7): 111878 (2020) - [j4]Vladimir Braverman, Moses Charikar, William Kuszmaul, Lin F. Yang:
The one-way communication complexity of dynamic time warping distance. J. Comput. Geom. 11(2): 62-93 (2020) - [c15]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: 162-176 - [c14]Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, William Kuszmaul:
Flushing Without Cascades. SODA 2020: 650-669 - [c13]William Kuszmaul:
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. SODA 2020: 1558-1577 - [c12]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: 63-73 - [c11]Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Green Paging and Parallel Paging. SPAA 2020: 493-495 - [c10]William Kuszmaul, Alek Westover:
Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory. SPAA 2020: 551-553 - [c9]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie:
Contention resolution without collision detection. STOC 2020: 105-118 - [i14]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie:
Contention Resolution Without Collision Detection. CoRR abs/2004.08039 (2020) - [i13]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 abs/2004.12532 (2020) - [i12]Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein:
Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR abs/2008.10709 (2020) - [i11]William Kuszmaul, Alek Westover:
The Variable-Processor Cup Game. CoRR abs/2012.00127 (2020) - [i10]William Kuszmaul:
Train Tracks with Gaps: Applying the Probabilistic Method to Trains. CoRR abs/2012.00589 (2020)
2010 – 2019
- 2019
- [c8]Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang:
The One-Way Communication Complexity of Dynamic Time Warping Distance. SoCG 2019: 16:1-16:15 - [c7]William Kuszmaul:
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. ICALP 2019: 80:1-80:15 - [c6]William Kuszmaul:
Efficiently Approximating Edit Distance Between Pseudorandom Strings. SODA 2019: 1165-1180 - [c5]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving optimal backlog in multi-processor cup games. STOC 2019: 1148-1157 - [i9]Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang:
The One-Way Communication Complexity of Dynamic Time Warping Distance. CoRR abs/1903.03520 (2019) - [i8]Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving Optimal Backlog in Multi-Processor Cup Games. CoRR abs/1904.02861 (2019) - [i7]William Kuszmaul:
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. CoRR abs/1904.09690 (2019) - [i6]Tim Kaler, William Kuszmaul, Tao B. Schardl, Daniele Vettorel:
Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. CoRR abs/1910.12340 (2019) - [i5]William Kuszmaul:
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. CoRR abs/1910.13533 (2019) - 2018
- [j3]William Kuszmaul:
Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations. Math. Comput. 87(310): 987-1011 (2018) - [c4]Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul:
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. ICALP 2018: 34:1-34:14 - [i4]Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul:
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. CoRR abs/1804.09907 (2018) - [i3]William Kuszmaul:
Efficiently Approximating Edit Distance Between Pseudorandom Strings. CoRR abs/1811.04300 (2018) - 2017
- [j2]William Kuszmaul:
Signed enumeration of upper-right corners in path shuffles. Eur. J. Comb. 60: 100-113 (2017) - 2016
- [c3]William Kuszmaul:
Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. SPAA 2016: 363-365 - [i2]William Kuszmaul:
Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. CoRR abs/1605.05236 (2016) - 2015
- [i1]William Kuszmaul:
Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations. CoRR abs/1509.08216 (2015) - 2014
- [c2]Bradley C. Kuszmaul, William H. Kuszmaul:
Avoiding Tree Saturation in the Face of Many Hotspots with Few Buffers. HPCC/CSS/ICESS 2014: 472-481 - [c1]Bradley C. Kuszmaul, William Kuszmaul:
Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability). SPAA 2014: 67-69 - 2013
- [j1]William Kuszmaul:
Counting Permutations Modulo Pattern-Replacement Equivalences for Three-Letter Patterns. Electron. J. Comb. 20(4): 10 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
