1. Brodal, G.S., Husfeldt, T.: A communication complexity proof that symmetric functions have logarithmic depth. BRICS (1996). https://www.brics.dk/RS/96/1/BRICS-RS-96-1.pdf
2. Chin, A.: On the depth complexity of the counting functions. Inf. Process. Lett. 35(6), 325–328 (1990). https://doi.org/10.1016/0020-0190(90)90036-W
3. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience, New York, USA (2006)
4. Dementiev, Y., Ignatiev, A., Sidelnik, V., Smal, A., Ushakov, M.: New bounds on the half-duplex communication complexity. Electron. Colloquium Comput. Complex. 27, 117 (2020). https://eccc.weizmann.ac.il/report/2020/117
5. Hoover, K., Impagliazzo, R., Mihajlin, I., Smal, A.: Half-duplex communication complexity. Electron. Colloquium Comput. Complex. 25, 89 (2018). https://eccc.weizmann.ac.il/report/2018/089