Virginia Vassilevska Williams
Computational Theory and Mathematics · 2010–2020
A researcher in the Science corpus: 7 papers; trusts 17 researchers and is trusted by 20 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 17 citations into it; #1,206 of 12,182 by trust here, #3,339 by citations
- Artificial Intelligence — 10 citations into it
- Algorithms & Complexity — 8 citations into it
- Computer Networks and Communications — 7 citations into it; #3,602 of 9,886 by trust here, #7,492 by citations
Whom Virginia Vassilevska Williams trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Don Coppersmith
- Alfred V. Aho
- Ryan Williams
- A. Davie
- John E. Hopcroft
- Frédéric Magniez
- Jeffrey D. Ullman
- Amir Abboud
- Michael Grant
- Marcin Mucha
Who trusts Virginia Vassilevska Williams overall
- Amir Abboud
- F. Gall
- James B. Orlin
- Daniel A. Spielman
- Michael B. Cohen
- Yin Tat Lee
- Shang-Hua Teng
- Monika Henzinger
- Zhao Song
- Jelani Nelson
Papers from Virginia Vassilevska Williams's perspective
Ordered by how strongly the researchers Virginia Vassilevska Williams trusts endorse each paper. Same corpus, a different order for every researcher.
- Quantum algorithms for the triangle problem (ACM-SIAM Symposium on Discrete Algorithms)
- Multiplying matrices faster than coppersmith-winograd (Symposium on the Theory of Computing)
- Gaussian elimination is not optimal
- All pairs shortest paths using bridging sets and rectangular matrix multiplication (JACM)
- A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- Matrix multiplication via arithmetic progressions
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (JACM)
- Exact indexing of dynamic time warping (Knowledge and Information Systems)
- Probabilistic Machines Can Use Less Running Time
- Fuzzy sets and systems: theory and applications (Mathematics in Science and Engineering)
Their papers
- Consequences of Faster Alignment of Sequences (2014) — 166 citations
- Tight Hardness Results for LCS and Other Sequence Similarity Measures (2015) — 263 citations
- Multiplying matrices faster than coppersmith-winograd (2012) — 1,045 citations
- Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems (2014) — 414 citations
- Subcubic Equivalences between Path, Matrix and Triangle Problems (2010) — 488 citations
- A Refined Laser Method and Faster Matrix Multiplication (2020) — 526 citations
- Multiplying matrices in O(n 2:373 ) time (2014) — 48 citations