Average and randomized communication complexity
Authors:
- A. OrlitskyAOA. Orlitsky
- A. El GamalAGA. El Gamal
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (1) , 3-16
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Average and randomized communication complexityIEEE Transactions on Information Theory, 1990
- Communication Complexity of Computing the Hamming DistanceSIAM Journal on Computing, 1986
- Unbiased bits from sources of weak randomness and probabilistic communication complexity1985
- Communication complexity1982
- Some complexity questions related to distributive computing(Preliminary Report)1979
- Lower bounds on information transfer in distributed computations1978
- Vergleich der hypergeometrischen mit der Binomial-VerteilungMetrika, 1966
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948