- Computer Science
- Algorithms
- Graph Theory
- +۴ مورد دیگر
Virginia Vassilevska Williams is a Professor at the Massachusetts Institute of Technology (MIT) Department of Electrical Engineering and Computer Science (EECS), affiliated with MIT CSAIL. She earned her Ph.D. in Computer Science from Carnegie Mellon University in 2008 and held postdoctoral positions at the Institute for Advanced Study (Princeton), UC Berkeley, and Stanford. Education: B.S. in Mathematics and Engineering from Caltech (2003); Ph.D. in Computer Science from CMU (2008) Her research focuses on combinatorial and graph-theoretic approaches to computational problems, including shortest paths , pattern detection , fine-grained complexity , and computational social choice for analyzing election manipulation and tournament structures. Recent publications highlight advances in sparse graph algorithms , cycle detection , and approximate counting using matrix multiplication techniques. She co-organized programs at the Simons Institute (2023) and Dagstuhl Seminars (2016). Scientific Awards NSF CAREER Award Google Research Fellowship Alfred P. Sloan Research Fellowship Thornton Family Faculty Research Innovation Fellowship Invited Speaker at ICM 2018 She advises current Ph.D. students including John Kuszmaul , Yael Kirkpatrick , and Zixuan Xu . Former students like Amir Abboud (Weizmann Institute) and Nicole Wein (U. Michigan) have achieved academic and industry positions.







