- M. Karchmer, A. Wigderson, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993, 102
- Or Meir, “On Derandomized Composition of Boolean Functions”, comput. complex., 28, no. 4, 2019, 661
- Mika Goos, Rahul Jain, Thomas Watson, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, 565
- Anders Björner, First European Congress of Mathematics Paris, July 6–10, 1992, 1994, 321
- Toniann Pitassi, Robert Robere, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 1207
- A. Beimel, E. Weinreb, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003, 428
- Lance Fortnow, 880, Foundation of Software Technology and Theoretical Computer Science, 1994, 256
- Johan HÅ stad, “The Shrinkage Exponent of de Morgan Formulas is 2”, SIAM J. Comput., 27, no. 1, 1998, 48
- Satyanarayana V. Lokam, 1530, Foundations of Software Technology and Theoretical Computer Science, 1998, 307
- Mika Göös, Rahul Jain, Thomas Watson, “Extension Complexity of Independent Set Polytopes”, SIAM J. Comput., 47, no. 1, 2018, 241