Virginia Vassilevska Williams

Virginia Vassilevska Williams (née Virginia Panayotova Vassilevska)[1] is a theoretical computer scientist and mathematician known for her research on graph algorithms and fast matrix multiplication. She is Steven and Renee Finn Career Development Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.[2]

In 2011, Williams found an algorithm for multiplying two matrices in time . This improved a previous time bound that had stood as the best known for 24 years (independently of Andrew Stothers, who also improved the same bound a year earlier).[3][4][5]

Education and careerEdit

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]


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.[8]

Personal lifeEdit

Virginia is married to Ryan Williams, also a computer scientist.

See alsoEdit


  1. ^ a b c d Curriculum vitae (PDF), retrieved 2018-02-24
  2. ^ a b c Three EECS professors receive 2017 Sloan Research Fellowships, Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, February 22, 2017
  3. ^ Aron, Jacob (December 9, 2011), "Key mathematical tool sees first advance in 24 years", New Scientist
  4. ^ Lipton, Richard (November 29, 2011), "A Breakthrough On Matrix Product", Gödel’s Lost Letter and P=NP
  5. ^ Virginia Vassilevska Williams (2012), "Multiplying Matrices Faster than Coppersmith-Winograd", in Howard J. Karloff and Toniann Pitassi (ed.), Proceedings of the 44th Symposium on Theory of Computing (STOC), ACM, pp. 887–898, doi:10.1145/2213977.2214056, S2CID 14350287
  6. ^ "Vassilevska-Williams", Weddings & Engagements, Decatur Daily, Aug 24, 2008
  7. ^ Virginia Vassilevska Williams at the Mathematics Genealogy Project
  8. ^ "Speakers", ICM 2018, archived from the original on 2017-12-15, retrieved 2018-02-24

External linksEdit