William Kuszmaul grew up in Lexington, MA where he attended Lexington High School. He is currently in his senior year at Stanford University, completing a double major in mathematics and computer science with honors. William was first introduced to academic research at the age of fourteen, when he co-authored a paper in abstract algebra under the supervision of MIT Professor Pavel Etingof. Since then, William has authored and co-authored twelve papers in mathematics and computer science. His work has won numerous research awards, including the Goldwater Scholarship and the Intel Science Talent Search 3rd Place Award.
William’s research has largely focused on applying algorithmic ideas to problems in mathematics and computer science. At HP Labs, William developed and implemented new algorithmic techniques for concurrent Cuckoo Hashing. At the Duluth Mathematics REU, William discovered and implemented the first asymptotically fast algorithms for mathematicians to use in the study of permutation pattern avoidance. Working under Professor Moses Charikar at Stanford, William has found new algorithms for problems relating to edit distance and dynamic time warping distance. He has given talks on his work at the 2017 International Conference on Permutation Patterns, as an invited speaker at the 2016 American Mathematical Society Fall Central Sectional Meeting, at the 2016 Symposium on Parallelism in Algorithms and Architectures, and at the 2016 Joint Mathematics Meetings.
In his free time, William enjoys teaching weekend classes on mathematics and computer science to high-school and middle-school students through Stanford Splash. William also mentors research projects for high-school students through MIT PRIMES.