\(f\)-sensitivity distance oracles and routing schemes (Q692635): Difference between revisions

@@ Property / cites work @@
+Slide—The Key to Polynomial End-to-End Communication
+Normal rank
@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+Improved routing strategies with succinct tables
@@ Property / cites work: Improved routing strategies with succinct tables / rank @@
+Normal rank
@@ Property / cites work @@
+Information dissemination in distributed systems with faulty units
+Normal rank
@@ Property / cites work @@
+Q4449190
@@ Property / cites work: Q4449190 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles for unweighted graphs in expected             <i>O</i>             (             <i>n</i>             <sup>2</sup>             ) time
+Normal rank
@@ Property / cites work @@
+Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
+Normal rank
@@ Property / cites work @@
+Q3579391
@@ Property / cites work: Q3579391 / rank @@
+Normal rank
@@ Property / cites work @@
+A nearly optimal oracle for avoiding failed vertices and edges
+Normal rank
@@ Property / cites work @@
+Optimal communication in networks with randomly distributed byzantine faults
+Normal rank
@@ Property / cites work @@
+Fault Tolerant Spanners for General Graphs
@@ Property / cites work: Fault Tolerant Spanners for General Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Forbidden-Set Routing
@@ Property / cites work: Compact Forbidden-Set Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Routing with Minimum Stretch
@@ Property / cites work: Compact Routing with Minimum Stretch / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental analysis of dynamic all pairs shortest path algorithms
+Normal rank
@@ Property / cites work @@
+Oracles for Distances Avoiding a Failed Node or Link
+Normal rank
@@ Property / cites work @@
+Almost Safe Gossiping in Bounded Degree Networks
@@ Property / cites work: Almost Safe Gossiping in Bounded Degree Networks / rank @@
+Normal rank
@@ Property / cites work @@
+The Byzantine generals strike again
@@ Property / cites work: The Byzantine generals strike again / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Compact routing schemes with low stretch factor
@@ Property / cites work: Compact routing schemes with low stretch factor / rank @@
+Normal rank
@@ Property / cites work @@
+Computing almost shortest paths
@@ Property / cites work: Computing almost shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+The impossibility of implementing reliable communication in the face of crashes
+Normal rank
@@ Property / cites work @@
+Memory requirement for universal routing schemes
@@ Property / cites work: Memory requirement for universal routing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Space-efficiency for routing schemes of stretch factor three
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
+Normal rank
@@ Property / cites work @@
+Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Fault-tolerant broadcasting and gossiping in communication networks
+Normal rank
@@ Property / cites work @@
+Feasibility and complexity of broadcasting with random transmission failures
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+An Optimal Synchronizer for the Hypercube
@@ Property / cites work: An Optimal Synchronizer for the Hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+A trade-off between space and efficiency for routing tables
+Normal rank
@@ Property / cites work @@
+A fully dynamic reachability algorithm for directed graphs with an almost linear update time
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4829021
@@ Property / cites work: Q4829021 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case update times for fully-dynamic all-pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank