External matrix multiplication and all-pairs shortest path (Q2390290): Difference between revisions

@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for computing all pair shortest paths in directed graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for memory hierarchies. Advanced lectures
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+A new upper bound on the complexity of the all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+The input/output complexity of transitive closure
@@ Property / cites work: The input/output complexity of transitive closure / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for parallel memory, I: Two-level memories
+Normal rank