Q5743466 (Q5743466): Difference between revisions

@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Q4230366
@@ Property / cites work: Q4230366 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Combinatorial Approach for Sparse Graph Problems
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Hundreds of impossibility results for distributed computing
+Normal rank
@@ Property / cites work @@
+A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
+Normal rank
@@ Property / cites work @@
+Information Bounds Are Weak in the Shortest Distance Problem
+Normal rank
@@ Property / cites work @@
+Q2754134
@@ Property / cites work: Q2754134 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+Tight bounds for distributed minimum-weight spanning tree verification
+Normal rank
@@ Property / cites work @@
+On the locality of bounded growth
@@ Property / cites work: On the locality of bounded growth / rank @@
+Normal rank
@@ Property / cites work @@
+The price of being near-sighted
@@ Property / cites work: The price of being near-sighted / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed MST for constant diameter graphs
@@ Property / cites work: Distributed MST for constant diameter graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A tight unconditional lower bound on distributed randomwalk computation
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
+Normal rank
@@ Property / cites work @@
+A new approach to all-pairs shortest paths on real-weighted graphs
+Normal rank
@@ Property / cites work @@
+A Shortest Path Algorithm for Real-Weighted Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Distributed verification and hardness of distributed approximation
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Undirected single-source shortest paths with positive integer weights in linear time
+Normal rank