Size-estimation framework with applications to transitive closure and reachability (Q1384531): Difference between revisions

@@ Property / cites work @@
+Parallel Depth-First Search in General Directed Graphs
+Normal rank
@@ Property / cites work @@
+Q4188569
@@ Property / cites work: Q4188569 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794956
@@ Property / cites work: Q3794956 / rank @@
+Normal rank
@@ Property / cites work @@
+A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
+Normal rank
@@ Property / cites work @@
+On optimizing multiplications of sparse matrices
@@ Property / cites work: On optimizing multiplications of sparse matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624436
@@ Property / cites work: Q5624436 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
+Normal rank
@@ Property / cites work @@
+Q3029980
@@ Property / cites work: Q3029980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+High-Probability Parallel Transitive-Closure Algorithms
+Normal rank