default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVirginia Vassilevska Williams
Virginia Vassilevska
Person information
- affiliation: Massachusetts Institute of Technology (MIT), Cambridge, MA, USA
- affiliation (former): Stanford University, CA, USA
- affiliation (former): University of California, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c117]Virginia Vassilevska Williams, Alek Westover:
Listing 6-Cycles in Sparse Graphs. ITCS 2025: 92:1-92:21- [c116]Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein:
Beyond 2-Approximation for k-Center in Graphs. SODA 2025: 175-211 - [c115]Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. SODA 2025: 2005-2039 - [c114]Mina Dalirrooyfard, Andrea Lincoln, Barna Saha, Virginia Vassilevska Williams:
Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More. SODA 2025: 4613-4643 - [c113]Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. SODA 2025: 5147-5190 - [c112]Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
All-Hops Shortest Paths. SODA 2025: 5191-5206 - 2024
- [j28]Josh Alman
, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. TheoretiCS 3 (2024) - [c111]Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. ICALP 2024: 9:1-9:17 - [c110]Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. ICALP 2024: 28:1-28:17 - [c109]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Fast Approximate Counting of Cycles. ICALP 2024: 37:1-37:20 - [c108]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu:
Simpler and Higher Lower Bounds for Shortcut Sets. SODA 2024: 2643-2656 - [c107]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
New Bounds for Matrix Multiplication: from Alpha to Omega. SODA 2024: 3792-3835 - [c106]Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu:
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. SODA 2024: 4641-4669 - [c105]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. SODA 2024: 4728-4757 - [c104]Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
Listing 6-Cycles. SOSA 2024: 19-27 - [c103]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques. STOC 2024: 923-934 - [c102]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Faster Cycle Detection in the Congested Clique. DISC 2024: 12:1-12:18 - [i80]Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. CoRR abs/2404.15916 (2024) - [i79]Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. CoRR abs/2404.16349 (2024) - [i78]Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. CoRR abs/2404.18337 (2024) - [i77]Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More. CoRR abs/2407.09651 (2024) - [i76]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Faster Cycle Detection in the Congested Clique. CoRR abs/2408.15132 (2024) - [i75]Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams:
Fast Approximate Counting of Cycles. CoRR abs/2409.19292 (2024) - [i74]Virginia Vassilevska Williams, Zoe Xi, Yinzhan Xu, Uri Zwick:
All-Hops Shortest Paths. CoRR abs/2410.23617 (2024) - [i73]Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye:
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence. CoRR abs/2411.06502 (2024) - [i72]Virginia Vassilevska Williams, Alek Westover:
Listing 6-Cycles in Sparse Graphs. CoRR abs/2411.07499 (2024) - 2023
- [j27]Joseph Berleant, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe:
Isometric Hamming embeddings of weighted graphs. Discret. Appl. Math. 332: 119-128 (2023) - [j26]Kristin Sheridan, Joseph Berleant, Mark Bathe, Anne Condon, Virginia Vassilevska Williams:
Factorization and pseudofactorization of weighted graphs. Discret. Appl. Math. 337: 81-105 (2023) - [j25]David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams:
Quasipolynomiality of the Smallest Missing Induced Subgraph. J. Graph Algorithms Appl. 27(5): 329-339 (2023) - [j24]Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. SIAM J. Comput. 52(6): S18-285 (2023) - [j23]Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams:
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. ACM Trans. Algorithms 19(1): 3:1-3:30 (2023) - [c101]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. ESA 2023: 2:1-2:17 - [c100]Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu:
Faster Detours in Undirected Graphs. ESA 2023: 7:1-7:17 - [c99]Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams:
Approximating Min-Diameter: Standard and Bichromatic. ESA 2023: 17:1-17:14 - [c98]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS 2023: 2188-2203 - [c97]Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
Improved girth approximation in weighted undirected graphs. SODA 2023: 2242-2255 - [c96]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. STOC 2023: 419-432 - [i71]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. CoRR abs/2303.14572 (2023) - [i70]David Eppstein, Andrea Lincoln, Virginia Vassilevska Williams:
Quasipolynomiality of the Smallest Missing Induced Subgraph. CoRR abs/2306.11185 (2023) - [i69]Shyan Akmal, Virginia Vassilevska Williams, R. Ryan Williams, Zixuan Xu:
Faster Detours in Undirected Graphs. CoRR abs/2307.01781 (2023) - [i68]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. CoRR abs/2307.07583 (2023) - [i67]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
New Bounds for Matrix Multiplication: from Alpha to Omega. CoRR abs/2307.07970 (2023) - [i66]Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos:
Fast 2-Approximate All-Pairs Shortest Paths. CoRR abs/2307.09258 (2023) - [i65]Mina Dalirrooyfard, Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing Cliques from Smaller Cliques. CoRR abs/2307.15871 (2023) - [i64]Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams:
Approximating Min-Diameter: Standard and Bichromatic. CoRR abs/2308.08674 (2023) - [i63]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu:
Simpler and Higher Lower Bounds for Shortcut Sets. CoRR abs/2310.12051 (2023) - [i62]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR abs/2310.13174 (2023) - [i61]Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
Listing 6-Cycles. CoRR abs/2310.14575 (2023) - [i60]Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu:
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. CoRR abs/2310.20473 (2023) - 2022
- [c95]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. ESA 2022: 3:1-3:15 - [c94]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS 2022: 290-300 - [c93]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Induced Cycles and Paths Are Harder Than You Think. FOCS 2022: 531-542 - [c92]Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu:
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure. FOCS 2022: 907-918 - [c91]Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, Ziqian Zhong:
New Additive Approximations for Shortest Paths and Cycles. ICALP 2022: 50:1-50:10 - [c90]Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. ICALP 2022: 94:1-94:20 - [c89]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. IJCAI 2022: 482-488 - [c88]Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams:
Dynamic Matching Algorithms Under Vertex Updates. ITCS 2022: 96:1-96:24 - [c87]Mingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong:
New Lower Bounds and Upper Bounds for Listing Avoidable Vertices. MFCS 2022: 41:1-41:14 - [c86]Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick:
Algorithmic trade-offs for girth approximation in undirected graphs. SODA 2022: 1471-1492 - [c85]Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. SODA 2022: 3311-3331 - [c84]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. STOC 2022: 1501-1514 - [i59]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV. CoRR abs/2203.08356 (2022) - [i58]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR abs/2204.03076 (2022) - [i57]Surya Mathialagan, Virginia Vassilevska Williams, Yinzhan Xu:
Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds. CoRR abs/2204.10932 (2022) - [i56]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Induced Cycles and Paths Are Harder Than You Think. CoRR abs/2209.01873 (2022) - [i55]Virginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu:
Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failures. CoRR abs/2209.07016 (2022) - [i54]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. CoRR abs/2212.14173 (2022) - 2021
- [j22]Virginia Vassilevska Williams:
EATCS-IPEC Nerode Prize - Call for Nominations. Bull. EATCS 133 (2021) - [j21]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. 50(4): 1155-1199 (2021) - [j20]Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams:
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles. SIAM J. Comput. 50(5): 1627-1662 (2021) - [j19]Greg Bodwin, Virginia Vassilevska Williams:
Better Distance Preservers and Additive Spanners. ACM Trans. Algorithms 17(4): 36:1-36:24 (2021) - [c83]Virginia Vassilevska Williams:
3SUM and Related Problems in Fine-Grained Complexity (Invited Talk). SoCG 2021: 2:1-2:2 - [c82]Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. FOCS 2021: 1021-1032 - [c81]Amir Abboud, Virginia Vassilevska Williams:
Fine-Grained Hardness for Edit Distance to a Fixed Sequence. ICALP 2021: 7:1-7:14 - [c80]Shyan Akmal, Virginia Vassilevska Williams:
Improved Approximation for Longest Common Subsequence over Small Alphabets. ICALP 2021: 13:1-13:18 - [c79]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. ICALP 2021: 47:1-47:21 - [c78]Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. ICALP 2021: 75:1-75:20 - [c77]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. EC 2021: 841-859 - [c76]Josh Alman, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. SODA 2021: 522-539 - [c75]Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. SODA 2021: 1836-1855 - [e1]Samir Khuller, Virginia Vassilevska Williams:
STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. ACM 2021, ISBN 978-1-4503-8053-9 [contents] - [i53]Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu:
Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths. CoRR abs/2102.06181 (2021) - [i52]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. CoRR abs/2103.03959 (2021) - [i51]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. CoRR abs/2103.06707 (2021) - [i50]Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. CoRR abs/2105.02806 (2021) - [i49]Shyan Akmal, Virginia Vassilevska Williams:
Improved Approximation for Longest Common Subsequence over Small Alphabets. CoRR abs/2105.03028 (2021) - [i48]Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
Hardness of Approximate Diameter: Now for Undirected Graphs. CoRR abs/2106.06026 (2021) - [i47]Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. CoRR abs/2110.15809 (2021) - [i46]Kristin Sheridan, Joseph Berleant, Mark Bathe, Anne Condon, Virginia Vassilevska Williams:
Factorization and pseudofactorization of weighted graphs. CoRR abs/2112.06990 (2021) - [i45]Joseph Berleant, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe:
Isometric Hamming embeddings of weighted graphs. CoRR abs/2112.06994 (2021) - 2020
- [j18]Fabrizio Grandoni, Virginia Vassilevska Williams:
Faster Replacement Paths and Distance Sensitivity Oracles. ACM Trans. Algorithms 16(1): 15:1-15:25 (2020) - [j17]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ACM Trans. Algorithms 16(4): 45:1-45:46 (2020) - [c74]Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams:
New Techniques for Proving Fine-Grained Average-Case Hardness. FOCS 2020: 774-785 - [c73]Virginia Vassilevska Williams, Yinzhan Xu:
Monochromatic Triangles, Triangle Listing and APSP. FOCS 2020: 786-797 - [c72]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph. ICALP 2020: 35:1-35:20 - [c71]Tsvi Kopelowitz, Virginia Vassilevska Williams:
Towards Optimal Set-Disjointness and Set-Intersection Data Structures. ICALP 2020: 74:1-74:16 - [c70]Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams:
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. ITCS 2020: 53:1-53:18 - [c69]Josh Alman, Virginia Vassilevska Williams:
OV Graphs Are (Probably) Hard Instances. ITCS 2020: 83:1-83:18 - [c68]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. OPODIS 2020: 30:1-30:17 - [c67]Virginia Vassilevska Williams, Yinzhan Xu:
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. SODA 2020: 12-29 - [c66]Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams:
Equivalences between triangle and range query problems. SODA 2020: 30-47 - [c65]Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New algorithms and hardness for incremental single-source shortest paths in directed graphs. STOC 2020: 153-166 - [i44]Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs. CoRR abs/2001.10751 (2020) - [i43]Mina Dalirrooyfard, Virginia Vassilevska Williams:
Conditionally optimal approximation algorithms for the girth of a directed graph. CoRR abs/2004.11445 (2020) - [i42]Virginia Vassilevska Williams, Yinzhan Xu:
Monochromatic Triangles, Triangle Listing and APSP. CoRR abs/2007.09318 (2020) - [i41]Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams:
New Techniques for Proving Fine-Grained Average-Case Hardness. CoRR abs/2008.06591 (2020) - [i40]Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams:
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions. CoRR abs/2009.14479 (2020) - [i39]Josh Alman, Virginia Vassilevska Williams:
A Refined Laser Method and Faster Matrix Multiplication. CoRR abs/2010.05846 (2020) - [i38]Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR abs/2010.10134 (2020) - [i37]Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. CoRR abs/2011.05066 (2020)
2010 – 2019
- 2019
- [j16]Jianer Chen, Hans L. Bodlaender, Virginia Vassilevska Williams:
EATCS-IPEC Nerode Prize 2019 - Call for Nominations. Bull. EATCS 127 (2019) - [j15]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM J. Comput. 48(2): 481-512 (2019) - [j14]Aviad Rubinstein, Virginia Vassilevska Williams:
SETH vs Approximation. SIGACT News 50(4): 57-76 (2019) - [j13]Dániel Marx, Virginia Vassilevska Williams, Neal E. Young:
Introduction to the Special Issue on SODA 2017. ACM Trans. Algorithms 15(2): 17:1-17:2 (2019) - [c64]Christine Konicki, Virginia Vassilevska Williams:
Bribery in Balanced Knockout Tournaments. AAMAS 2019: 2066-2068 - [c63]Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams:
Public-Key Cryptography in the Fine-Grained Setting. CRYPTO (3) 2019: 605-635 - [c62]Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP 2019: 13:1-13:14 - [c61]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. ICALP 2019: 46:1-46:14 - [c60]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP 2019: 47:1-47:15 - [c59]Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. ISSAC 2019: 10 - [c58]Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams:
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. STOC 2019: 1167-1178 - [i36]Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams:
Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles. CoRR abs/1904.03741 (2019) - [i35]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR abs/1904.11601 (2019) - [i34]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. CoRR abs/1904.11606 (2019) - [i33]Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams:
Equivalences between triangle and range query problems. CoRR abs/1908.11819 (2019) - [i32]Virginia Vassilevska Williams, Yinzhan Xu:
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications. CoRR abs/1910.04911 (2019) - [i31]Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams:
Public-Key Cryptography in the Fine-Grained Setting. IACR Cryptol. ePrint Arch. 2019: 625 (2019) - 2018
- [j12]Virginia Vassilevska Williams, R. Ryan Williams:
Subcubic Equivalences Between Path, Matrix, and Triangle Problems. J. ACM 65(5): 27:1-27:38 (2018) - [j11]Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu:
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. SIAM J. Comput. 47(3): 1098-1122 (2018) - [j10]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser. SIAM J. Comput. 47(6): 2527-2555 (2018) - [j9]Virginia Vassilevska Williams:
Some Open Problems in Fine-Grained Complexity. SIGACT News 49(4): 29-35 (2018) - [j8]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. ACM Trans. Algorithms 14(3): 27:1-27:23 (2018) - [c57]Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. FOCS 2018: 580-591 - [c56]Virginia Vassilevska Williams:
Fine-grained Algorithms and Complexity. ICDT 2018: 1:1-1:1 - [c55]Josh Alman, Virginia Vassilevska Williams:
Further Limitations of the Known Approaches for Matrix Multiplication. ITCS 2018: 25:1-25:15 - [c54]Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams:
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS 2018: 34:1-34:23 - [c53]Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams:
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. SODA 2018: 1236-1252 - [c52]Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams:
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. SODA 2018: 1374-1392 - [c51]Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams:
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). SODA 2018: 1884-1900 - [c50]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Towards tight approximation bounds for graph diameter and eccentricities. STOC 2018: 267-280 - [c49]Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. SWAT 2018: 33:1-33:12 - [i30]Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures. CoRR abs/1804.06932 (2018) - [i29]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR abs/1808.08494 (2018) - [i28]Josh Alman, Virginia Vassilevska Williams:
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication. CoRR abs/1810.08671 (2018) - [i27]Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR abs/1811.12527 (2018) - 2017
- [j7]Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? SIAM J. Discret. Math. 31(3): 1751-1764 (2017) - [c48]Hooyeon Lee, Virginia Vassilevska Williams:
Complexity of the Stable Invitations Problem. AAAI 2017: 579-585 - [c47]Hooyeon Lee, Virginia Vassilevska Williams:
Parameterized Complexity of Group Activity Selection. AAMAS 2017: 353-361 - [c46]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ICALP 2017: 41:1-41:16 - [c45]Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams:
Preserving Distances in Very Faulty Graphs. ICALP 2017: 73:1-73:14 - [c44]Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams:
Conditional Hardness for Sensitivity Problems. ITCS 2017: 26:1-26:31 - [c43]Daniel Stubbs, Virginia Vassilevska Williams:
Metatheorems for Dynamic Weighted Matching. ITCS 2017: 58:1-58:14 - [i26]Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams:
Conditional Hardness for Sensitivity Problems. CoRR abs/1703.01638 (2017) - [i25]Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams:
Preserving Distances in Very Faulty Graphs. CoRR abs/1703.10293 (2017) - [i24]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. CoRR abs/1707.00362 (2017) - [i23]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. CoRR abs/1707.05095 (2017) - [i22]Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams:
Optimal Vertex Fault Tolerant Spanners (for fixed stretch). CoRR abs/1710.03164 (2017) - [i21]Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams:
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy. CoRR abs/1711.07960 (2017) - [i20]Josh Alman, Virginia Vassilevska Williams:
Further limitations of the known approaches for matrix multiplication. CoRR abs/1712.07246 (2017) - [i19]Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams:
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. CoRR abs/1712.08147 (2017) - 2016
- [j6]Moritz Hardt, Yuval Ishai, Raghu Meka, Virginia Vassilevska Williams:
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). SIAM J. Comput. 45(3): 881 (2016) - [c42]Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? AAAI 2016: 516-522 - [c41]Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA 2016: 67:1-67:14 - [c40]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS 2016: 375-384 - [c39]Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams:
Deterministic Time-Space Trade-Offs for k-SUM. ICALP 2016: 58:1-58:14 - [c38]Virginia Vassilevska Williams:
RNA-Folding - From Hardness to Algorithms. MFCS 2016: 5:1-5:1 - [c37]Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang:
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. SODA 2016: 377-391 - [c36]Greg Bodwin, Virginia Vassilevska Williams:
Better Distance Preservers and Additive Spanners. SODA 2016: 855-872 - [c35]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. SODA 2016: 1256-1271 - [c34]Virginia Vassilevska Williams:
Fine-Grained Algorithms and Complexity (Invited Talk). STACS 2016: 3:1-3:1 - [c33]Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams:
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. STOC 2016: 375-388 - [r1]Virginia Vassilevska Williams:
Knockout Tournaments. Handbook of Computational Social Choice 2016: 453-474 - [i18]Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams:
Deterministic Time-Space Tradeoffs for k-SUM. CoRR abs/1605.07285 (2016) - [i17]Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams:
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. CoRR abs/1611.00721 (2016) - [i16]Moshe Lewenstein, Seth Pettie, Virginia Vassilevska Williams:
Structure and Hardness in P (Dagstuhl Seminar 16451). Dagstuhl Reports 6(11): 1-34 (2016) - 2015
- [c32]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
Tight Hardness Results for LCS and Other Sequence Similarity Measures. FOCS 2015: 59-78 - [c31]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms are Optimal, So is Valiant's Parser. FOCS 2015: 98-117 - [c30]Michael P. Kim, Virginia Vassilevska Williams:
Fixing Tournaments for Kings, Chokers, and More. IJCAI 2015: 561-567 - [c29]Gregory Bodwin, Virginia Vassilevska Williams:
Very Sparse Additive Spanners and Emulators. ITCS 2015: 377-382 - [c28]Virginia Vassilevska Williams:
Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk). IPEC 2015: 17-29 - [c27]Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu:
Finding Four-Node Subgraphs in Triangle Time. SODA 2015: 1671-1680 - [c26]Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams:
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. SODA 2015: 1681-1697 - [c25]Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu:
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. STOC 2015: 41-50 - [i15]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
Quadratic-Time Hardness of LCS and other Sequence Similarity Measures. CoRR abs/1501.07053 (2015) - [i14]Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams:
If the Current Clique Algorithms are Optimal, so is Valiant's Parser. CoRR abs/1504.01431 (2015) - [i13]Gregory Bodwin, Virginia Vassilevska Williams:
Better Distance Preservers and Additive Spanners. CoRR abs/1505.05599 (2015) - [i12]Gregory Bodwin, Virginia Vassilevska Williams:
Very Sparse Additive Spanners and Emulators. CoRR abs/1505.05630 (2015) - [i11]Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang:
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter. CoRR abs/1506.01799 (2015) - [i10]Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. CoRR abs/1510.04622 (2015) - [i9]Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR abs/1511.01137 (2015) - [i8]Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams:
Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made. CoRR abs/1511.06022 (2015) - [i7]Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? CoRR abs/1511.08416 (2015) - 2014
- [c24]Amir Abboud, Virginia Vassilevska Williams:
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. FOCS 2014: 434-443 - [c23]Amir Abboud, Virginia Vassilevska Williams, Oren Weimann:
Consequences of Faster Alignment of Sequences. ICALP (1) 2014: 39-51 - [c22]Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick:
Listing Triangles. ICALP (1) 2014: 223-234 - [c21]Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams:
Better Approximation Algorithms for the Graph Diameter. SODA 2014: 1041-1052 - [i6]Amir Abboud, Virginia Vassilevska Williams:
Popular conjectures imply strong lower bounds for dynamic problems. CoRR abs/1402.0054 (2014) - [i5]Aran Nayebi, Virginia Vassilevska Williams:
Quantum algorithms for shortest paths problems in structured instances. CoRR abs/1410.6220 (2014) - 2013
- [j5]Virginia Vassilevska Williams, Ryan Williams:
Finding, Minimizing, and Counting Weighted Subgraphs. SIAM J. Comput. 42(3): 831-854 (2013) - [c20]Liam Roditty, Virginia Vassilevska Williams:
Fast approximation algorithms for the diameter and radius of sparse graphs. STOC 2013: 515-524 - 2012
- [c19]Fabrizio Grandoni, Virginia Vassilevska Williams:
Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths. FOCS 2012: 748-757 - [c18]Liam Roditty, Virginia Vassilevska Williams:
Subquadratic time approximation algorithms for the girth. SODA 2012: 833-845 - [c17]Virginia Vassilevska Williams:
Multiplying matrices faster than coppersmith-winograd. STOC 2012: 887-898 - [i4]Liam Roditty, Virginia Vassilevska Williams:
Approximating the diameter of a graph. CoRR abs/1207.3622 (2012) - 2011
- [c16]Liam Roditty, Virginia Vassilevska Williams:
Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS 2011: 180-189 - [c15]Isabelle Stanton, Virginia Vassilevska Williams:
Rigging Tournament Brackets for Weaker Players. IJCAI 2011: 357-364 - [c14]Virginia Vassilevska Williams:
Faster Replacement Paths. SODA 2011: 1337-1346 - [c13]Isabelle Stanton, Virginia Vassilevska Williams:
Manipulating Stochastically Generated Single-Elimination Tournaments for Nearly All Players. WINE 2011: 326-337 - [i3]Liam Roditty, Virginia Vassilevska Williams:
Minimum Weight Cycles and Triangles: Equivalences and Algorithms. CoRR abs/1104.2882 (2011) - 2010
- [j4]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
Finding heaviest H-subgraphs in real weighted graphs, with applications. ACM Trans. Algorithms 6(3): 44:1-44:23 (2010) - [j3]Virginia Vassilevska Williams:
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule. ACM Trans. Algorithms 6(4): 70:1-70:24 (2010) - [c12]Virginia Vassilevska Williams:
Fixing a Tournament. AAAI 2010: 895-900 - [c11]Virginia Vassilevska Williams, Ryan Williams:
Subcubic Equivalences between Path, Matrix and Triangle Problems. FOCS 2010: 645-654 - [i2]Virginia Vassilevska Williams:
Faster Replacement Paths. CoRR abs/1007.2216 (2010)
2000 – 2009
- 2009
- [j2]Virginia Vassilevska:
Efficient algorithms for clique problems. Inf. Process. Lett. 109(4): 254-257 (2009) - [j1]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. Theory Comput. 5(1): 173-189 (2009) - [c10]Virginia Vassilevska, Ryan Williams:
Finding, minimizing, and counting weighted subgraphs. STOC 2009: 455-464 - 2008
- [c9]Guy E. Blelloch, Virginia Vassilevska, Ryan Williams:
A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120 - [c8]Virginia Vassilevska:
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. SODA 2008: 465-472 - [c7]Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska:
Uniquely Represented Data Structures for Computational Geometry. SWAT 2008: 17-28 - 2007
- [c6]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
All-pairs bottleneck paths for general graphs in truly sub-cubic time. STOC 2007: 585-589 - 2006
- [c5]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. ICALP (1) 2006: 262-273 - [c4]Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo:
Confronting hardness using a hybrid approach. SODA 2006: 1-10 - [c3]Virginia Vassilevska, Ryan Williams:
Finding a maximum weight triangle in n3-Delta time, with applications. STOC 2006: 225-231 - [i1]Virginia Vassilevska, Ryan Williams, Raphael Yuster:
Finding heaviest H-subgraphs in real weighted graphs, with applications. CoRR abs/cs/0609009 (2006) - 2005
- [c2]Virginia Vassilevska:
Explicit Inapproximability Bounds for the Shortest Superstring Problem. MFCS 2005: 793-800 - 2004
- [c1]Virginia Vassilevska Williams:
Consumer electronics industry standards for in-home entertainment networking and device connectivity. CCNC 2004: 507-510
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-13 00:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
