Skip to main content
SpringerLink
Log in

Communication complexity

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 172))

Included in the following conference series:

Abstract

We shall consider the communication complexity introduced by Papadimitriou and Sipser [4]. The hierarchy of this communication complexity is proved for both deterministic and nondeterministic models. The communication complexity hierarchy for k-way communication is also established.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abelson, Lower bounds on information transfer in distributed computations. Proc. of the 19-th Annual Symposium on Foundations of Computer Science, 1978.

    Google Scholar 

  2. Lipton and Sedgewick, Lower bounds for VLSI. Proc. of the 13-th Symposium on Theory of Computing, 1981, 300–307.

    Google Scholar 

  3. Melhorn and Schmidt, Las Vegas is better than determinism in VLSI and distributed computing. Proc. of the 14-th Annual Symposium on Theory of Computing, 1982, 330–337.

    Google Scholar 

  4. Papadimitriou and Sipser, Communication Complexity. Proc. of the 23-th Annual Symposium on Foundations of Computer Science, 1982, 189–195.

    Google Scholar 

  5. Savage, Area — time tradeoffs for matrix multiplication and related problems in VLSI models. Proc. of the Allerton Conference, 1979.

    Google Scholar 

  6. Thompson, Area-time complexity of VLSI. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 81–88.

    Google Scholar 

  7. Vuillemin, A combinatorial limit on the computational power of VLSI circuits. Proc. of the 11-th Annual Symposium on Foundations of Computer Science, 1980, 294–300.

    Google Scholar 

  8. Yao, Some complexity questions related to distributive computing. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 209–311.

    Google Scholar 

  9. Yao, The entropic limitations on VLSI computations. Proc. of the 13-th Annual Symposium on Theory of Computing, 1981, 308–311.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Cybernetics, Komensky University, 842 15, Bratislava, Czechoslovakia

    Juraj Hromkovič

Authors
  1. Juraj Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hromkovič, J. (1984). Communication complexity. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation