I am a graduate student in Computer Science at MIT. My research focuses primarily on algorithms and high-performance engineering. I also have research interests in enumerative combinatorics and data structures. My research is funded by the Hertz Fellowship, the NSF GRFP Fellowship, and the MIT Akamai Fellowship. I can be contacted at kuszmaul at mit dot edu.
Link to my Blog: Algorithm Soup
Papers and Publications
Michael A. Bender, Rathish Das, Martin Farach-Colton, Rob Johnson, and William Kuszmaul. Flushing Without Cascades. Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 650-669, 2020.
William Kuszmaul. Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game. Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1558-1577, 2020.
Tim Kaler, William Kuszmaul, Tao B. Schardl, and Daniele Vettorel. Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs. First SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), 2020. Best paper finalist.
Michael A. Bender, Martín Farach-Colton, and William Kuszmaul. Achieving Optimal Backlog in Multi-Processor Cup Games. 51st Symposium on Theory of Computing (STOC), 1148-1157, 2019.
Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, and Lin F. Yang. The One-Way Communication Complexity of Dynamic Time Warping Distance. 2019 Symposium on Computational Geometry (SOCG), 16:1-16:15, 2019.
William Kuszmaul. Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation. 46th International Colloquium on Automata, Languages and Programming (ICALP), , 80:1-80:15, 2019.
William Kuszmaul. Efficiently Approximating Edit Distance Between Pseudorandom Strings. 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1165-1180, 2018.
Moses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul. On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings. 45th International Colloquium on Automata, Languages, and Programming (ICALP), 2018.
William Kuszmaul. Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations. Mathematics of Computation, 2017. Software and Data Released on Github.
William Kuszmaul. Signed Enumeration of Upper-Right Corners in Path Shuffles. European Journal of Combinatorics, 60:100-113, 2017.
William Kuszmaul. Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 363-365, 2016. Full paper available here.
William Kuszmaul. Counting Permutations Modulo Pattern-Replacement Equivalences for Three-Letter Patterns. The Electronic Journal of Combinatorics, 20(4):Paper 10, 58, 2013.
Surya Bhupatiraju, Pavel Etingof, David Jordan, William Kuszmaul, Jason Li. Lower Central Series of a Free Associative Algebra Over the Integers and Finite Fields. Journal of Algebra 372:251-274, 2012.
Bradley C. Kuszmaul and William H. Kuszmaul. Avoiding Tree Saturation in the Face of Many Hotspots with Few Buffers. 16th IEEE International Conference on High Performance Computing and Communications, pages 472-481, 2014.
Hideaki Kimura, William Kuszmaul, and Harumi Kuno. An Embedded Database for Modern Hardware. Hewlett Packard Tech Con (2015).
William Kuszmaul. New Results on Doubly Adjacent Pattern-Replacement Equivalences. arXiv:1402.3881, 2014.
William Kuszmaul. A New Approach to Enumerating Statistics Modulo n. arXiv:1402.3839, 2013. Under submission to The Electronic Journal of Combinatorics.
William Kuszmaul and Ziling Zhou. Equivalence Classes in S_n for Three Families of Pattern-Replacement Relations. arXiv:1304.5669, 2013.
Below is the talk I gave for the 2013 Davidson Fellows Scholarship:
My Software Package for Permutation Pattern-Avoidance -- introduces asymptotically fastest known algorithm! (as of end of 2015)
Photos of some origami roses I designed: