- Jianbin Qin, Chuan Xiao, “Pigeonring”, Proc. VLDB Endow., 12, № 1, 2018, 28
- A.R. Woods, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 202
- Søren Riis, Meera Sitharam, “Uniformly generated submodules of permutation modules”, Journal of Pure and Applied Algebra, 160, № 2-3, 2001, 285
- Giordano Fusco, Eric Bach, 4484, Theory and Applications of Models of Computation, 2007, 632
- Samuel R. Buss, “Towards NP–P via proof complexity and search”, Annals of Pure and Applied Logic, 163, № 7, 2012, 906
- Дмитрий Олегович Соколов, Математические основы информатики и информационно-коммуникационных систем, 2021, 69
- Sam Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi, “Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes”, Journal of Computer and System Sciences, 62, № 2, 2001, 267
- Emil Jeřábek, “Dual weak pigeonhole principle, Boolean complexity, and derandomization”, Annals of Pure and Applied Logic, 129, № 1-3, 2004, 1
- Samuel Buss, Leszek Kołodziejczyk, Konrad Zdanowski, “Collapsing modular counting in bounded arithmetic and constant depth propositional proofs”, Trans. Amer. Math. Soc., 367, № 11, 2015, 7517
- Dmitry Sokolov, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 78