Analysis of randomized load distribution for reproduction trees in linear arrays and rings (Q1885897): Difference between revisions

@@ Property / cites work @@
+Taking random walks to grow trees in hypercubes
@@ Property / cites work: Taking random walks to grow trees in hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138971
@@ Property / cites work: Q3138971 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393310
@@ Property / cites work: Q4393310 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5727090
@@ Property / cites work: Q5727090 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-bound and backtrack search on mesh-connected arrays of processors
+Normal rank
@@ Property / cites work @@
+Randomized parallel algorithms for backtrack search and branch-and-bound computation
+Normal rank
@@ Property / cites work @@
+Dynamic Tree Embeddings in Butterflies and Hypercubes
+Normal rank
@@ Property / cites work @@
+Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
+Normal rank
@@ Property / cites work @@
+A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
+Normal rank
@@ Property / cites work @@
+On the performance of randomized embedding of reproduction trees in static networks
+Normal rank
@@ Property / cites work @@
+Lower bounds for dynamic tree embedding in bipartite networks
+Normal rank
@@ Property / cites work @@
+Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
+Normal rank