Published September 1995
| public
Book Section - Chapter
Coding for Distributed Computation
- Creators
- Rajagopalan, Sridhar
-
Schulman, Leonard J.
Chicago
An error occurred while generating the citation.
Abstract
We show that any distributed protocol which runs on a noiseless network in time T, can be simulated on an identical noisy network with a slow-down factor proportional to log(d+1), where d is the maximum degree in the network, and with exponentially small probability of error. On every channel of our network we implement communications using tree codes.
Additional Information
© 1995 IEEE. Date of Current Version: 06 August 2002. Received support from NSF PYI Award CCR 8896202 and NSF grant IRI 91-20074 and a DIMACS postdoctoral fellowship. Supported in part by an NSF Postdoctoral Fellowship.Additional details
- Eprint ID
- 29451
- DOI
- 10.1109/ISIT.1995.550440
- Resolver ID
- CaltechAUTHORS:20120224-093023413
- NSF PYI
- CCR 8896202
- NSF
- IRI-91-20074
- DIMACS postdoctoral fellowship
- NSF Postdoctoral Fellowship
- Created
-
2012-02-24Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5280200