1. Arkadev Chattopadhyay, Michal Koucký, Bruno Loff & Sagnik Mukhopadhyay (2017). Simulation Theorems via Pseudorandom Properties. CoRR.
http://arxiv.org/abs/1704.06807
.
2. Irit Dinur, Prahladh Harsha, Srikanth Srinivasan & Girish Varma (2015). Derandomized Graph Product Results Using the Low Degree Long Code. In 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, 275–287.
3. Irit Dinur & Or Meir (2016). Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. In 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, 3:1–3:51.
4. Edmonds, Jeff, Impagliazzo, Russell, Rudich, Steven, Sgall, Jiri: Communication complexity towards lower bounds on circuit depth. Computational Complexity 10(3), 210–246 (2001)
5. Peter Frankl & Norihide Tokushige: The Erdős-Ko-Rado Theorem for Integer Sequences. Combinatorica 19(1), 55–63 (1999)