- Eyal Kushilevitz, 44, 1997, 331
- Charles J. Colbourn, Gerzson Kéri, 5557, Coding and Cryptology, 2009, 22
- Lauri Hella, Kerkko Luosto, “Game characterizations for the number of quantifiers”, Math. Struct. Comp. Sci., 2024, 1
- M. Karchmer, R. Raz, A. Wigderson, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, 299
- Bruno Codenotti, “Matrix rigidity”, Linear Algebra and its Applications, 304, no. 1-3, 2000, 181
- P. Hrubeš, S. Jukna, A. Kulikov, P. Pudlák, “On convex complexity measures”, Theoretical Computer Science, 411, no. 16-18, 2010, 1842
- P. Pudlák, V. Rödl, “A combinatorial approach to complexity”, Combinatorica, 12, no. 2, 1992, 221
- Anders Björner, First European Congress of Mathematics, 1994, 321
- NAVIN GOYAL, LUIS RADEMACHER, SANTOSH VEMPALA, “Query Complexity of Sampling and Small Geometric Partitions”, Combinator. Probab. Comp., 24, no. 5, 2015, 733
- Troy Lee, 4393, STACS 2007, 2007, 145