Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources
- 1 January 1985
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 366-378
- https://doi.org/10.1145/22145.22186