Pseudorandomness for network algorithms

Russell Impagliazzo, Noam Nisan, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

166 Scopus citations

Abstract

We define pseudorandom generators for Yao's two party communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive composition of such generators to obtain pseudorandom generators that fool distributed network algorithms. While the construction and the proofs are simple, we demonstrate the generality of such generators by giving several applications.

Original languageAmerican English
Title of host publicationProceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994
PublisherAssociation for Computing Machinery
Pages356-364
Number of pages9
ISBN (Electronic)0897916638
DOIs
StatePublished - 23 May 1994
Event26th Annual ACM Symposium on Theory of Computing, STOC 1994 - Montreal, Canada
Duration: 23 May 199425 May 1994

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129502
ISSN (Print)0737-8017

Conference

Conference26th Annual ACM Symposium on Theory of Computing, STOC 1994
Country/TerritoryCanada
CityMontreal
Period23/05/9425/05/94

Bibliographical note

Publisher Copyright:
© 1994 ACM.

Fingerprint

Dive into the research topics of 'Pseudorandomness for network algorithms'. Together they form a unique fingerprint.

Cite this