Virginia Vassilevska Williams
Affiliations: MIT
 Stanford University, USA (former)
 University of California, Berkeley, USA (former)
According to our database^{1},
Virginia Vassilevska Williams
authored at least 106 papers
between 2004 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org
On csauthors.net:
Bibliography
2021
ACM Trans. Algorithms, 2021
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles.
SIAM J. Comput., 2021
SIAM J. Comput., 2021
Bull. EATCS, 2021
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product.
CoRR, 2021
CoRR, 2021
CoRR, 2021
Proceedings of the 2021 ACMSIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 2021 ACMSIAM Symposium on Discrete Algorithms, 2021
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021
Faster Monotone MinPlus Product, Range Mode, and Single Source Replacement Paths.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Algorithms, Reductions and Equivalences for Small Weight Variants of AllPairs Shortest Paths.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Proceedings of the 37th International Symposium on Computational Geometry, 2021
2020
ACM Trans. Algorithms, 2020
ACM Trans. Algorithms, 2020
New algorithms and hardness for incremental singlesource shortest paths in directed graphs.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
ACM Trans. Algorithms, 2019
SIGACT News, 2019
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast BoundedDifference MinPlus Product.
SIAM J. Comput., 2019
IACR Cryptol. ePrint Arch., 2019
Bull. EATCS, 2019
Graph pattern detection: hardness for all induced patterns and faster noninduced cycles.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
ACM Trans. Algorithms, 2018
SIGACT News, 2018
SIAM J. Comput., 2018
SIAM J. Comput., 2018
J. ACM, 2018
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners.
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Proceedings of the TwentyNinth Annual ACMSIAM Symposium on Discrete Algorithms, 2018
Finegrained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Proceedings of the 21st International Conference on Database Theory, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
SIAM J. Discret. Math., 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
Proceedings of the ThirtyFirst AAAI Conference on Artificial Intelligence, 2017
2016
Proceedings of the Handbook of Computational Social Choice, 2016
Special Section on the FiftyFourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013).
SIAM J. Comput., 2016
Dagstuhl Reports, 2016
CoRR, 2016
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Truly Subcubic Algorithms for Language Edit Distance and RNAFolding via Fast BoundedDifference MinPlus Product.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter.
CoRR, 2015
CoRR, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk).
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
CoRR, 2014
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
SIAM J. Comput., 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
2012
CoRR, 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the TwentyThird Annual ACMSIAM Symposium on Discrete Algorithms, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
Manipulating Stochastically Generated SingleElimination Tournaments for Nearly All Players.
Proceedings of the Internet and Network Economics  7th International Workshop, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the IJCAI 2011, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule.
ACM Trans. Algorithms, 2010
ACM Trans. Algorithms, 2010
Proceedings of the TwentyFourth AAAI Conference on Artificial Intelligence, 2010
2009
Theory Comput., 2009
Inf. Process. Lett., 2009
2008
Proceedings of the Algorithm Theory, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
2006
CoRR, 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
Finding the Smallest <i>H</i>Subgraph in Real Weighted Graphs and Related Problems.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
2004
Consumer electronics industry standards for inhome entertainment networking and device connectivity.
Proceedings of the 1st IEEE Consumer Communications and Networking Conference, 2004