The following pages link to Virginia Vassilevska Williams (Q2304934):
Displaying 50 items.
- (Q871155) (redirect page) (← links)
- Finding nonoverlapping substructures of a sparse matrix (Q871156) (← links)
- Efficient algorithms for clique problems (Q976087) (← links)
- Public-key cryptography in the fine-grained setting (Q2304935) (← links)
- Isometric Hamming embeddings of weighted graphs (Q2696622) (← links)
- Finding, Minimizing, and Counting Weighted Subgraphs (Q2848203) (← links)
- Finding heaviest <i>H</i> -subgraphs in real weighted graphs, with applications (Q2930324) (← links)
- Nondecreasing paths in a weighted graph or (Q2930352) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q2941487) (← links)
- Very Sparse Additive Spanners and Emulators (Q2989053) (← links)
- (Q3002808) (← links)
- Faster Replacement Paths and Distance Sensitivity Oracles (Q3384662) (← links)
- Uniquely Represented Data Structures for Computational Geometry (Q3512445) (← links)
- A New Combinatorial Approach for Sparse Graph Problems (Q3521912) (← links)
- (Q3549658) (← links)
- (Q3579446) (← links)
- Confronting hardness using a hybrid approach (Q3581485) (← links)
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (Q3613765) (← links)
- Subtree Isomorphism Revisited (Q4554355) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605) (← links)
- Better Distance Preservers and Additive Spanners (Q4575640) (← links)
- Subtree Isomorphism Revisited (Q4575669) (← links)
- (Q4598197) (← links)
- A 7/3-Approximation for Feedback Vertex Sets in Tournaments (Q4606339) (← links)
- (Q4607968) (← links)
- (Q4607979) (← links)
- Optimal Vertex Fault Tolerant Spanners (for fixed stretch) (Q4608012) (← links)
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems (Q4625648) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- (Q4638076) (← links)
- Further Limitations of the Known Approaches for Matrix Multiplication (Q4993288) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q5020726) (← links)
- Better Distance Preservers and Additive Spanners (Q5035880) (← links)
- (Q5091161) (← links)
- (Q5091199) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- Dynamic Parameterized Problems and Algorithms (Q5111372) (← links)
- (Q5111404) (← links)
- (Q5116497) (← links)
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication (Q5120467) (← links)
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY (Q5122163) (← links)
- (Q5133022) (← links)
- New algorithms and hardness for incremental single-source shortest paths in directed graphs (Q5144905) (← links)
- Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications (Q5146762) (← links)
- Consequences of Faster Alignment of Sequences (Q5167729) (← links)
- Listing Triangles (Q5167744) (← links)
