Virginia Vassilevska Williams 		Since September 2009, I have been a postdoctoral fellow at the computer science division at UC Berkeley working with Prof. Satish Rao. During the 2011-2012 academic year, I am also a half-time research associate at Stanford University. After that: Hire Me.

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.

I received my Ph.D. in Computer Science in August, 2008 from Carnegie Mellon University under the guidance of Prof. Guy Blelloch. Before that I received a Bachelor's degree from the California Institute of Technology in 2003, double-majoring in Mathematics and in Engineering and Applied Science (this was what computer science students majored in before Caltech instituted the undergraduate computer science major in 2004). During the 2008-2009 academic year I was a member of the IAS in Princeton in Avi Wigderson's group. During my 2009-2011 postdoc at UC Berkeley I was supported by a Computing Innovation Fellowship.

My new results on matrix multiplication: [pdf]

I am on the COMSOC 2012, AAMAS 2012, AAAI 2012 , SWAT 2012 and SODA 2013 program committees. Submit your awesome papers there!


Links:

Stanford CS Department

Berkeley CS Division

Stanford Theory Group

Berkeley Theory Group

Carnegie Mellon Theory Group

CS Overflow

Computational Social Choice

Contact information:

Email: virgi at cs dot either of my institutions dot edu

Offices:
At Berkeley: Soda Hall 665
At Stanford: Gates 461



My CV: [ps] [pdf]      My thesis: [pdf]

 
 Links to my publications:

Sorted according to year of publication

Sorted according to topic:
And here is what Wordle thinks of my publication list: