The following pages link to Virginia Vassilevska Williams (Q2304934):
Displaying 30 items.
- Finding, minimizing, and counting weighted subgraphs (Q5172740) (← links)
- Graph pattern detection: hardness for all induced patterns and faster non-induced cycles (Q5212856) (← links)
- Towards tight approximation bounds for graph diameter and eccentricities (Q5230295) (← links)
- Who Can Win a Single-Elimination Tournament? (Q5348496) (← links)
- Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made (Q5361845) (← links)
- Finding Four-Node Subgraphs in Triangle Time (Q5363056) (← links)
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter (Q5363057) (← links)
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) (Q5363756) (← links)
- (Q5365121) (← links)
- Better Approximation Algorithms for the Graph Diameter (Q5384040) (← links)
- Multiplying matrices faster than coppersmith-winograd (Q5415522) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492909) (← links)
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms (Q5495016) (← links)
- Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822) (← links)
- (Q5743440) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- Dynamic Parameterized Problems and Algorithms (Q5888936) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q6139832) (← links)
- Factorization and pseudofactorization of weighted graphs (Q6162029) (← links)
- Isometric Hamming embeddings of weighted graphs (Q6385557) (← links)
- Improved girth approximation in weighted undirected graphs (Q6538619) (← links)
- Listing 6-cycles (Q6545098) (← links)
- Algorithmic trade-offs for girth approximation in undirected graphs (Q6575136) (← links)
- Better lower bounds for shortcut sets and additive spanners via an improved alternation product (Q6575212) (← links)
- A refined laser method and faster matrix multiplication (Q6601301) (← links)
- Simpler and higher lower bounds for shortcut sets (Q6645453) (← links)
- New bounds for matrix multiplication: from alpha to omega (Q6645500) (← links)
- Improved roundtrip spanners, emulators, and directed girth approximation (Q6645536) (← links)
- Fast 2-approximate all-pairs shortest paths (Q6645539) (← links)
