Yahoo Web Search

Search results

  1. MIT CSAIL. MIT Theory of Computation Group. CS Overflow. Computational Social Choice. MIT Accessibility Page. Virginia Vassilevska Williams. Steven and Renee Finn Career Development Professor. My research applies combinatorial and graph theoretic tools to various computational domains.

    • Graph and Matrix Problems

      Additive Spanner Lower Bounds with Optimal Inner Graph...

    • Publications

      Additive Spanner Lower Bounds with Optimal Inner Graph...

    • 6.S078

      6.S078: Fine-Grained Algorithms and Complexity -- Fall 2020...

    • Data Structures

      Nearly Optimal Separation Between Partially and Fully...

  2. She moved to MIT as an associate professor in 2017. [2] Research. In 2011, Williams found an algorithm for multiplying two matrices in time . This improved a previous time bound for matrix multiplication algorithms, the Coppersmith–Winograd algorithm, that had stood as the best known for 24 years.

  3. Virginia Vassilevska Williams is a career development associate professor at MIT, specializing in algorithms and complexity. She has a PhD from Carnegie Mellon and has worked at Stanford and UC Berkeley.

    • 100KB
    • 9
  4. Virginia Vassilevska Williams will join the department of Electrical Engineering and Computer Science as an associate professor in January 2017, pending the approval of her case by Academic Council. She received a BS in mathematics and engineering and applied science from Caltech and a PhD in computer science from Carnegie Mellon.

  5. Mar 4, 2023 · Virginia Vassilevska Williams. Professor. Email. virgi@mit.edu. Last updated Mar 04 '23. Personal Page. Projects. Using Reductions to Understand Polynomial Time Algorithms. Theory of Computation Community of Research.

  1. People also search for