Follow
Virginia Vassilevska Williams
Title
Cited by
Cited by
Year
Multiplying matrices faster than Coppersmith-Winograd
VV Williams
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1245*2012
Popular conjectures imply strong lower bounds for dynamic problems
A Abboud, VV Williams
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 434-443, 2014
3672014
A refined laser method and faster matrix multiplication
J Alman, VV Williams
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
3042021
Subcubic equivalences between path, matrix and triangle problems
VV Williams, R Williams
Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010
2942010
Tight hardness results for LCS and other sequence similarity measures
A Abboud, A Backurs, VV Williams
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 59-78, 2015
263*2015
Fast approximation algorithms for the diameter and radius of sparse graphs
L Roditty, V Vassilevska Williams
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
2592013
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
A Abboud, VV Williams, J Wang
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
1712016
On some fine-grained questions in algorithms and complexity
VV Williams
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
1672018
Subcubic equivalences between graph centrality problems, APSP and diameter
A Abboud, F Grandoni, VV Williams
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
1502014
Consequences of faster alignment of sequences
A Abboud, VV Williams, O Weimann
International Colloquium on Automata, Languages, and Programming, 39-51, 2014
1482014
Hardness of easy problems: Basing hardness on popular conjectures such as the strong exponential time hypothesis (invited talk)
V Vassilevska Williams
10th International Symposium on Parameterized and Exact Computation (IPEC 2015), 2015
1422015
Matching triangles and basing hardness on an extremely popular conjecture
A Abboud, V Vassilevska Williams, H Yu
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
1252015
Better approximation algorithms for the graph diameter
S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1182014
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
A Abboud, TD Hansen, VV Williams, R Williams
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1122016
Finding, minimizing, and counting weighted subgraphs
VV Williams, R Williams
SIAM Journal on Computing 42 (3), 831-854, 2013
1112013
If the current clique algorithms are optimal, so is Valiant's parser
A Abboud, A Backurs, VV Williams
SIAM Journal on Computing 47 (6), 2527-2555, 2018
1102018
Subcubic equivalences between path, matrix, and triangle problems
VV Williams, RR Williams
Journal of the ACM (JACM) 65 (5), 1-38, 2018
1092018
Finding, minimizing, and counting weighted subgraphs
V Vassilevska, R Williams
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1052009
Efficient algorithms for clique problems
V Vassilevska
Information Processing Letters 109 (4), 254-257, 2009
942009
Tight hardness for shortest cycles and paths in sparse graphs
A Lincoln, VV Williams, R Williams
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
852018
The system can't perform the operation now. Try again later.
Articles 1–20