Virginia Vassilevska Williams

Vassilevska Williams at [[Mathematical Research Institute of Oberwolfach|Oberwolfach]], 2012 Virginia Vassilevska Williams (née Virginia Panayotova Vassilevska) is a theoretical computer scientist and mathematician known for her research in computational complexity theory and algorithms. She is currently the Steven and Renee Finn Career Development Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. She is notable for her breakthrough results in fast matrix multiplication, for her work on dynamic algorithms, and for helping to develop the field of fine-grained complexity. Provided by Wikipedia
Showing 1 - 9 results of 9 for search 'Vassilevska Williams, Virginia', query time: 0.03s Refine Results
  1. 1
    Fine-Grained Complexity and Algorithms for the Schulze Voting Method

    Fine-Grained Complexity and Algorithms for the Schulze Voting Method by Sornat, Krzysztof, Vassilevska Williams, Virginia, Xu, Yinzhan

    Published 2022
    Get full text
    Article
  2. 2
    Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV

    Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV by Chan, Timothy, Vassilevska Williams, Virginia, Xu, Yinzhan

    Published 2022
    Get full text
    Article
  3. 3
    Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter

    Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter by Abboud, Amir, Grandoni, Fabrizio, Vassilevska Williams, Virginia

    Published 2022
    Get full text
    Article
  4. 4
    New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs

    New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs by Probst Gutenberg, Maximilian, Vassilevska Williams, Virginia, Wein, Nicole

    Published 2021
    Get full text
    Article
  5. 5
    New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs

    New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs by Probst Gutenberg, Maximilian, Vassilevska Williams, Virginia, Wein, Nicole

    Published 2022
    Get full text
    Article
  6. 6
    Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More

    Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More by Chan, Timothy M., Vassilevska Williams, Virginia, Xu, Yinzhan

    Published 2023
    Get full text
    Article
  7. 7
    Subtree Isomorphism Revisited

    Subtree Isomorphism Revisited by Abboud, Amir, Backurs, Arturs, Hansen, Thomas Dueholm, Vassilevska Williams, Virginia, Zamir, Or

    Published 2021
    Get full text
    Article
  8. 8
    Subcubic Min-Plus Product of Structured Matrices

    Subcubic Min-Plus Product of Structured Matrices by Xu, Yinzhan

    Published 2022
    Other Authors: “…Vassilevska Williams, Virginia…”
    Get full text
    Thesis
  9. 9
    Finding Patterns, Short Cycles and Long Shortest Paths in Graphs

    Finding Patterns, Short Cycles and Long Shortest Paths in Graphs by Dalirrooyfard, Mina

    Published 2022
    Other Authors: “…Vassilevska Williams, Virginia…”
    Get full text
    Thesis

Search Tools: