Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1995 | public
Book Section - Chapter

Coding for Distributed Computation

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

Created:
August 20, 2023
Modified:
October 24, 2023