Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVirginia Vassilevska Williams
Virginia Vassilevska
Person information
- affiliation: MIT
- affiliation (former): Stanford University, USA
- affiliation (former): University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j25]Joseph Berleant
, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe:
Isometric Hamming embeddings of weighted graphs. Discret. Appl. Math. 332: 119-128 (2023)- [j24]Kristin Sheridan, Joseph Berleant, Mark Bathe, Anne Condon, Virginia Vassilevska Williams:
Factorization and pseudofactorization of weighted graphs. Discret. Appl. Math. 337: 81-105 (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) - [c100]Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. ESA 2023: 2:1-2:17 - [c99]Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu:
Faster Detours in Undirected Graphs. ESA 2023: 7:1-7:17 - [c98]Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams:
Approximating Min-Diameter: Standard and Bichromatic. ESA 2023: 17:1-17:14 - [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]