Editing Communication complexity (section)

== Applications ==
Lower bounds in communication complexity can be used to prove lower bounds in [[decision tree complexity]], [[VLSI circuit]]s, data structures, [[streaming algorithms]], [[space–time tradeoff]]s for Turing machines and more.<ref name=":0" />

Conitzer and Sandholm<ref>{{Cite book |last1=Conitzer |first1=Vincent |last2=Sandholm |first2=Tuomas |chapter=Communication complexity of common voting rules |date=2005-06-05 |title=Proceedings of the 6th ACM conference on Electronic commerce |chapter-url=https://doi.org/10.1145/1064009.1064018 |series=EC '05 |location=New York, NY, USA |publisher=Association for Computing Machinery |pages=78–87 |doi=10.1145/1064009.1064018 |isbn=978-1-59593-049-1|url=https://figshare.com/articles/journal_contribution/6604214 }}</ref> studied the communication complexity of some common [[Electoral system|voting rules]], which are essential in political and non political organizations. [[Compilation complexity]] is a closely related notion, which can be seen as a single-round communication complexity.