1. Complexity classes in communication complexity theory
2. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2002. An Information Statistics Approach to Data Stream and Communication Complexity. In 43rd Symposium on Foundations of Computer Science (FOCS 2002). 209--218.
3. Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar. 2020. Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020 (LIPIcs, Vol. 176). 23:1--23:15.
4. Ralph Bottesch, Dmitry Gavinsky, and Hartmut Klauck. 2015. Correlation in Hard Distributions in Communication Complexity. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM (LIPIcs, Vol. 40). 544--572.
5. A Tight Bound for Set Disjointness in the Message-Passing Model