Q4638076 (Q4638076): Difference between revisions

@@ Property / author @@
-Monika R. Henzinger
@@ Property / author: Monika R. Henzinger / rank @@
-Normal rank
@@ Property / author @@
-Virginia Vassilevska Williams
@@ Property / author: Virginia Vassilevska Williams / rank @@
-Normal rank
@@ Property / author @@
+Monika R. Henzinger
@@ Property / author: Monika R. Henzinger / rank @@
+Normal rank
@@ Property / author @@
+Virginia Vassilevska Williams
@@ Property / author: Virginia Vassilevska Williams / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01638
@@ Property / arXiv ID: 1703.01638 / rank @@
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
+Normal rank
@@ Property / cites work @@
+Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
+Normal rank
@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault tolerant reachability for directed graphs
@@ Property / cites work: Fault tolerant reachability for directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fault tolerant subgraph for single source reachability: generic and optimal
+Normal rank
@@ Property / cites work @@
+Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
+Normal rank
@@ Property / cites work @@
+Q5743393
@@ Property / cites work: Q5743393 / rank @@
+Normal rank
@@ Property / cites work @@
+A nearly optimal oracle for avoiding failed vertices and edges
+Normal rank
@@ Property / cites work @@
+Improved Purely Additive Fault-Tolerant Spanners
@@ Property / cites work: Improved Purely Additive Fault-Tolerant Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-Tolerant Approximate Shortest-Path Trees
@@ Property / cites work: Fault-Tolerant Approximate Shortest-Path Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Compact and Fast Sensitivity Oracles for Single-Source Distances
+Normal rank
@@ Property / cites work @@
+Multiple-edge-fault-tolerant approximate shortest-path trees
+Normal rank
@@ Property / cites work @@
+Fault Tolerant Additive Spanners
@@ Property / cites work: Fault Tolerant Additive Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility
+Normal rank
@@ Property / cites work @@
+More algorithms for all-pairs shortest paths in weighted graphs
+Normal rank
@@ Property / cites work @@
+(1 + ∊)-Approximate <i>f</i>-Sensitive Distance Oracles
+Normal rank
@@ Property / cites work @@
+\(f\)-sensitivity distance oracles and routing schemes
+Normal rank
@@ Property / cites work @@
+Q4598272
@@ Property / cites work: Q4598272 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
+Normal rank
@@ Property / cites work @@
+Q4633861
@@ Property / cites work: Q4633861 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity oracles for failure prone graphs
@@ Property / cites work: Connectivity oracles for failure prone graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity Oracles for Graphs Subject to Vertex Failures
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
+Normal rank
@@ Property / cites work @@
+Q4606319
@@ Property / cites work: Q4606319 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Higher Lower Bounds from the 3SUM Conjecture
@@ Property / cites work: Higher Lower Bounds from the 3SUM Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A faster computation of the most vital edge of a shortest path
+Normal rank
@@ Property / cites work @@
+Dual Failure Resilient BFS Structure
@@ Property / cites work: Dual Failure Resilient BFS Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Fault Tolerant Approximate BFS Structures
@@ Property / cites work: Fault Tolerant Approximate BFS Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Towards polynomial lower bounds for dynamic problems
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Replacement paths and             <i>k</i>             simple shortest paths in unweighted directed graphs
+Normal rank
@@ Property / cites work @@
+Q5365121
@@ Property / cites work: Q5365121 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank