Email: virgi at cs dot stanford
Phone: (650) 723-3705
Office: Gates 468
Some useful links:
Stanford CS Department
Stanford Theory Group
Computational Social Choice
Virginia Vassilevska Williams|
My research applies combinatorial and graph theoretic tools to various computational domains. My recent work has focused on two domains:
At this coming STOC in Portland I'm organizing a tutorial on conditional lower bounds for problems within polynomial time: Hardness for Easy Problems
My not so 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 on the topic.
Students: I am currently advising two Ph.D. students:
Amir Abboud, and Greg Bodwin.
Teaching: I am currently teaching CS 161, Introduction to Algorithms.
In the Winter 2015 I taught CS 267, Graph Algorithms.. In the Spring 2014 quarter I taught 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:
I am currently on the ESA 2015 program committee.
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:
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: [pdf] Thesis: [pdf]