- Petr Savický, Detlef Sieling, 1893, Mathematical Foundations of Computer Science 2000, 2000, 650
- Olga Dorzweiler, Thomas Flamm, Andreas Krebs, Michael Ludwig, 8614, Descriptional Complexity of Formal Systems, 2014, 270
- Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin, “Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method”, ACM Trans. Comput. Theory, 9, no. 1, 2017, 1
- Elizaveta A. Okol'nishnikova, 1279, Fundamentals of Computation Theory, 1997, 376
- Valentine Kabanets, 1776, LATIN 2000: Theoretical Informatics, 2000, 197
- Martin Sauerhoff, 1738, Foundations of Software Technology and Theoretical Computer Science, 1999, 342
- Anna Gál, Michal Koucký, Pierre McKenzie, “Incremental Branching Programs”, Theory Comput Syst, 43, no. 2, 2008, 159
- Emanuele Viola, “Selected challenges in computational lower bounds”, SIGACT News, 48, no. 1, 2017, 39
- Petr Savický, Detlef Sieling, “A hierarchy result for read-once branching programs with restricted parity nondeterminism”, Theoretical Computer Science, 340, no. 3, 2005, 594
- David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum, 1373, STACS 98, 1998, 73