Fast algorithms for bit-serial routing on a hypercube (Q3357513): Difference between revisions

@@ Property / cites work @@
+Hamming Codes, Hypercube Embeddings, and Fault Tolerance
+Normal rank
@@ Property / cites work @@
+Sorting in \(c \log n\) parallel steps
@@ Property / cites work: Sorting in \(c \log n\) parallel steps / rank @@
+Normal rank
@@ Property / cites work @@
+Routing, merging, and sorting on parallel models of computation
+Normal rank
@@ Property / cites work @@
+Deterministic sorting in nearly logarithmic time on the hypercube and related computers
+Normal rank
@@ Property / cites work @@
+Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
+Normal rank
@@ Property / cites work @@
+Tight bounds for oblivious routing in the hypercube
+Normal rank
@@ Property / cites work @@
+Virtual cut-through: A new computer communication switching technique
+Normal rank
@@ Property / cites work @@
+Randomized Routing and Sorting on Fixed-Connection Networks
+Normal rank
@@ Property / cites work @@
+Parallel Algorithms to Set Up the Benes Permutation Network
+Normal rank
@@ Property / cites work @@
+Efficient dispersal of information for security, load balancing, and fault tolerance
+Normal rank
@@ Property / cites work @@
+How to emulate shared memory
@@ Property / cites work: How to emulate shared memory / 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 / full work available at URL @@
+https://doi.org/10.1007/bf02090402
+Normal rank
@@ Property / OpenAlex ID @@
+W2010442238
@@ Property / OpenAlex ID: W2010442238 / rank @@
+Normal rank