- Miikka Vilander, “Games for Succinctness of Regular Expressions”, Electron. Proc. Theor. Comput. Sci., 346, 2021, 258
- Eyal Kushilevitz, Enav Weinreb, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, 63
- Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu, “The communication complexity of the Hamming distance problem”, Information Processing Letters, 99, № 4, 2006, 149
- K. L. Rychkov, “Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions”, J. Appl. Ind. Math., 9, № 4, 2015, 580
- Lauri T Hella, Miikka S Vilander, “Formula size games for modal logic and μ-calculus”, Journal of Logic and Computation, 29, № 8, 2019, 1311
- A.C.-C. Yao, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, 302
- Alexander A. Razborov, Feasible Mathematics II, 1995, 344
- Алексей Дмитриевич Коршунов, Aleksei Dmitrievich Korshunov, “Монотонные булевы функции”, УМН, 58, № 5, 2003, 89
- Alexander A. Razborov, An Invitation to Mathematics, 2011, 97
- Ankit Garg, Visu Makam, Rafael Oliveira, Avi Wigderson, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 824