Worst-case interactive communication. I. Two messages are almost optimal
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (5) , 1111-1126
- https://doi.org/10.1109/18.57210
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Average and randomized communication complexityIEEE Transactions on Information Theory, 1990
- Worst-case interactive communication. I. Two messages are almost optimalIEEE Transactions on Information Theory, 1990
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984
- Lower bounds on communication complexityPublished by Association for Computing Machinery (ACM) ,1984
- Communication complexityPublished by Association for Computing Machinery (ACM) ,1982
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979
- Lower bounds on information transfer in distributed computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- The zero-error side information problem and chromatic numbers (Corresp.)IEEE Transactions on Information Theory, 1976
- Noiseless coding of correlated information sourcesIEEE Transactions on Information Theory, 1973