- Christoph Meinel, Stephan Waack, 762, Algorithms and Computation, 1993, 379
- Detlef Sieling, Ingo Wegener, 903, Graph-Theoretic Concepts in Computer Science, 1995, 359
- Meena Mahajan, B. V. Raghavendra Rao, 5162, Mathematical Foundations of Computer Science 2008, 2008, 455
- Stanislav Žák, 969, Mathematical Foundations of Computer Science 1995, 1995, 319
- Farid Ablayev, 3777, Stochastic Algorithms: Foundations and Applications, 2005, 190
- Igor Razgon, 8894, Parameterized and Exact Computation, 2014, 319
- Amos Beimel, Anna Gál, “On Arithmetic Branching Programs”, Journal of Computer and System Sciences, 59, № 2, 1999, 195
- J. H�stad, S. Jukna, P. Pudl�k, “Top-down lower bounds for depth-three circuits”, Comput Complexity, 5, № 2, 1995, 99
- Martin Sauerho., 2264, Stochastic Algorithms: Foundations and Applications, 2001, 65
- Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama, “Satisfiability Algorithm for Syntactic Read-k-times Branching Programs”, Theory Comput Syst, 64, № 8, 2020, 1392