| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657704 | Theoretical Computer Science | 2005 | 37 Pages |
Abstract
The new algorithms use communication graphs and permutations with certain combinatorial properties that are shown to exist. The algorithms are correct for any permutations, and in particular, the same expected bounds can be achieved using random permutations.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman,