Tight bounds for oblivious routing in the hypercube (Q3357537): Difference between revisions

@@ Property / cites work @@
+Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
+Normal rank
@@ Property / cites work @@
+Routing, merging, and sorting on parallel models of computation
+Normal rank
@@ Property / cites work @@
+Oblivious routing with limited buffer capacity
@@ Property / cites work: Oblivious routing with limited buffer capacity / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal time bound for oblivious routing
@@ Property / cites work: An optimal time bound for oblivious routing / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient dispersal of information for security, load balancing, and fault tolerance
+Normal rank
@@ Property / cites work @@
+Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
+Normal rank
@@ Property / cites work @@
+Q3326832
@@ Property / cites work: Q3326832 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Schemes for Parallel Communication
@@ Property / cites work: Efficient Schemes for Parallel Communication / rank @@
+Normal rank
@@ Property / cites work @@
+A Scheme for Fast Parallel Communication
@@ Property / cites work: A Scheme for Fast Parallel Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385523
@@ Property / cites work: Q4385523 / rank @@
+Normal rank