Contact information:
Email: virgi at cs dot stanford
Phone: (650) 723-3705
Office: Gates 468




Some useful links:

Stanford CS Department

Stanford Theory Group

CS Overflow

Computational Social Choice

Virginia Vassilevska Williams
Assistant Professor

My research applies combinatorial and graph theoretic tools to various computational domains. My recent work has focused on two domains:
  • designing algorithms for shortest paths, pattern detection and other computational problems in graphs and matrices, and
  • computational issues in social choice: when and how can one efficiently manipulate elections, tournaments and competitions, how to measure the quality of a voting rule, etc.

My recent results on matrix multiplication: [full version pdf], [Maple files]
(I showed that omega is less than 2.373.)
Here is my 2012 SIGACT News article summarizing my matrix multiplication results.

Teaching: I just finished teaching CS 367, Algebraic Graph Algorithms.

During the Winter 2014 quarter I taught CS 267, Graph Algorithms. During the Spring 2013 quarter I cotaught CS 266: Parametrized algorithms and complexity.

Program committee work:

In the past, I was on the following program committees: COMSOC 2014, STOC 2013, ICALP 2013, IJCAI 2013, FOCS 2013, COMSOC 2012, AAMAS 2012, AAAI 2012, SWAT 2012, and SODA 2013.


Links to my publications:

Sorted according to year of publication

Sorted according to topic:


Short bio:
B.S. in Mathematics and Eng. and Applied Science (CS), Caltech, 2003
Ph.D. in Computer Science, Carnegie Mellon, 2008, under Prof. Guy Blelloch
Member of the IAS in Avi Wigderson's group, 2008-2009
Computing Innovations Fellow, Berkeley, working with Prof. Satish Rao, 2009-2011
Part-time Research Associate at Stanford 2011-2013
Part-time Assistant Research Engineer at Berkeley, 2011-2013


CV: [ps] [pdf]      Thesis: [pdf]



And here is what Wordle thinks of my publication list: