Folgen
William Kuszmaul
William Kuszmaul
MIT
Bestätigte E-Mail-Adresse bei mit.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Dynamic time warping in strongly subquadratic time: Algorithms for the low-distance regime and approximate evaluation
W Kuszmaul
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
282019
Lower central series of a free associative algebra over the integers and finite fields
S Bhupatiraju, P Etingof, D Jordan, W Kuszmaul, J Li
Journal of Algebra 372, 251-274, 2012
262012
Achieving optimal backlog in multi-processor cup games
MA Bender, M Farach-Colton, W Kuszmaul
51st Annual ACM SIGACT Symposium on Theory of Computing, 1148-1157, 2019
232019
Iceberg hashing: Optimizing many hash-table criteria at once
MA Bender, A Conway, M Farach-Colton, W Kuszmaul, G Tagliavini
Journal of the ACM 70 (6), 1-51, 2023
20*2023
Contention resolution without collision detection
MA Bender, T Kopelowitz, W Kuszmaul, S Pettie
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
182020
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings
M Charikar, O Geri, MP Kim, W Kuszmaul
45th International Colloquium on Automata, Languages, and Programming …, 2018
182018
Achieving optimal backlog in the vanilla multi-processor cup game
W Kuszmaul
14th Annual ACM-SIAM Symposium on Discrete Algorithms, 1558-1577, 2020
162020
Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
W Kuszmaul
Mathematics of Computation 87 (310), 987-1011, 2018
162018
Efficiently approximating edit distance between pseudorandom strings
W Kuszmaul
13th Annual ACM-SIAM Symposium on Discrete Algorithms, 1165-1180, 2019
152019
On the optimal time/space tradeoff for hash tables
MA Bender, M Farach-Colton, J Kuszmaul, W Kuszmaul, M Liu
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
142022
Randomized cup game algorithms against strong adversaries
MA Bender, W Kuszmaul
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
Tight bounds for parallel paging and green paging
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
Flushing without cascades
MA Bender, R Das, M Farach-Colton, R Johnson, W Kuszmaul
14th Annual ACM-SIAM Symposium on Discrete Algorithms, 650-669, 2020
122020
The one-way communication complexity of dynamic time warping distance
V Braverman, M Charikar, W Kuszmaul, DP Woodruff, LF Yang
35th International Symposium on Computational Geometry (SoCG 2019), 2019
122019
Tiny pointers
MA Bender, A Conway, M Farach-Colton, W Kuszmaul, G Tagliavini
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
112023
The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
W Kuszmaul, Q Qi
arXiv preprint arXiv:2102.05077, 2021
112021
Linear probing revisited: Tombstones mark the demise of primary clustering
MA Bender, BC Kuszmaul, W Kuszmaul
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
10*2022
How asymmetry helps buffer management: achieving optimal tail size in cup games
W Kuszmaul
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
102021
Green paging and parallel paging
K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato
32nd ACM Symposium on Parallelism in Algorithms and Architectures, 493-495, 2020
102020
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis
MA Bender, RA Chowdhury, R Das, R Johnson, W Kuszmaul, A Lincoln, ...
32nd ACM Symposium on Parallelism in Algorithms and Architectures, 63-73, 2020
92020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20