Loading AI tools
Theoretical computer scientist From Wikipedia, the free encyclopedia
Virginia Vassilevska Williams (née Virginia Panayotova Vassilevska)[1] is a theoretical computer scientist and mathematician known for her research in computational complexity theory and algorithms. She is currently the Steven and Renee Finn Career Development Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.[2] She is notable for her breakthrough results in fast matrix multiplication,[3] for her work on dynamic algorithms,[4] and for helping to develop the field of fine-grained complexity.[5]
Virginia Vassilevska Williams | |
|---|---|
Vassilevska Williams at Oberwolfach, 2012 | |
| Nationality | Bulgarian American |
| Alma mater |
|
| Known for | |
| Scientific career | |
| Fields | |
| Institutions | |
| Doctoral advisor | Guy Blelloch |
Williams is originally from Bulgaria, and attended a German-language high school in Sofia.[6] She graduated from the California Institute of Technology in 2003, and completed her Ph.D. at Carnegie Mellon University in 2008.[1] Her dissertation, Efficient Algorithms for Path Problems in Weighted Graphs, was supervised by Guy Blelloch.[7]
After postdoctoral research at the Institute for Advanced Study and University of California, Berkeley, Williams became an assistant professor of computer science at Stanford University in 2013.[1] She moved to MIT as an associate professor in 2017.[2]
In 2011, Williams found an algorithm for multiplying two matrices in time . This improved a previous time bound for matrix multiplication algorithms, the Coppersmith–Winograd algorithm, that had stood as the best known for 24 years. Her initial improvement was independent of Andrew Stothers, who also improved the same bound a year earlier; after learning of Stothers' work, she combined ideas from both methods to improve his bound as well.[8][3] As of 2023, her work also establishes the current best-known algorithm for matrix multiplication with her collaborators, in time .[9][10]
Williams was an NSF Computing Innovation Fellow for 2009–2011,[1] and won a Sloan Research Fellowship in 2017.[2] She was an invited speaker at the 2018 International Congress of Mathematicians, speaking in the section on Mathematical Aspects of Computer Science.[11]
Williams is the daughter of applied mathematicians Panayot Vassilevski and Tanya Kostova-Vassilevska.[12] She is married to Ryan Williams, also a computer science professor at MIT; they have worked together in the field of fine-grained complexity.[6]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
