Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources
Umesh V. Vazirani · 1985
Article Free Access Share on Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources Author: U V Vazirani University of California, Berkeley, CA University of California, Berkeley, CAView Profile Authors Info & Claims STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computingDecember 1985 Pages 366–378https://doi.org/10.1145/22145.22186Online:01 December 1985Publication History 32citation372DownloadsMetricsTotal Citations32Total Downloads372Last 12 Months8Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF