Scholar
Virginia Vassilevska Williams
Google Scholar ID: Wph6P_IAAAAJ
MIT
Theoretical computer science
Fine-grained complexity
Algorithms and data structures
Graph algorithms
Complexity Theory
Follow
Google Scholar
↗
Citations & Impact
All-time
Citations
5,553
H-index
35
i10-index
89
Publications
20
Co-authors
30
list available
Contact
No contact links provided.
Publications
9 items
Preprocessed 3SUM for Unknown Universes with Subquadratic Space
2026
Cited
0
Improved Additive Approximation Algorithms for APSP
2025
Cited
0
Improved girth approximation in weighted undirected graphs
2025
Cited
0
Shortest Paths in Multimode Graphs
2025
Cited
0
All-Pairs Shortest Paths with Few Weights per Node
2025
Cited
0
Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
2025
Cited
0
Average-Case Hardness of Parity Problems: Orthogonal Vectors, k-SUM and More
ACM-SIAM Symposium on Discrete Algorithms · 2025
Cited
0
Beyond 2-Approximation for k-Center in Graphs
ACM-SIAM Symposium on Discrete Algorithms · 2025
Cited
1
Load more
Resume (English only)
Co-authors
30 total
Richard Ryan Williams
MIT
Amir Abboud
Weizmann Institute of Science
Liam Roditty
Bar Ilan University
Andrea Lincoln
Boston University
Fabrizio Grandoni
Professor, IDSIA, USI-SUPSI, Switzerland
Greg Bodwin
University of Michigan
Raphael Yuster
University of Haifa
Uri Zwick
Tel Aviv University
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up