- S. Jukna, A. Razborov, P. Savický, I. Wegener, 1295, Mathematical Foundations of Computer Science 1997, 1997, 319
- Anna Gál, Michal Koucký, Pierre McKenzie, 3967, Computer Science – Theory and Applications, 2006, 178
- Rob Myers, Henning Urbat, 8031, Descriptional Complexity of Formal Systems, 2013, 194
- Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi, Theodore J. Yoder, Sarah Sheldon, “Quantum advantage for computations with limited space”, Nat. Phys., 17, no. 8, 2021, 894
- Jaikumar Radhakrishnan, “Better Lower Bounds for Monotone Threshold Formulas”, Journal of Computer and System Sciences, 54, no. 2, 1997, 221
- Marek Karpinski, 1684, Fundamentals of Computation Theory, 1999, 1
- Farid Ablayev, Marek Karpinski, Rustam Mubarakzjanov, “On BPP versus NP∪coNP for ordered read-once branching programs”, Theoretical Computer Science, 264, no. 1, 2001, 127
- E.A. Okol'nishnikova, “Comparing the sizes of nondeterministic branching read-k-times programs”, Discrete Applied Mathematics, 135, no. 1-3, 2004, 205
- Martin Sauerhoff, 1373, STACS 98, 1998, 105
- Farid Ablayev, 1256, Automata, Languages and Programming, 1997, 195