M. Agrawal, T. Thierauf, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 1998, 81
Pavol Ďuriš, Juraj Hromkovič, Stasys Jukna, Martin Sauerhoff, Georg Schnitger, 2010, STACS 2001, 2001, 206
Stasys Jukna, “A note on read-$k$ times branching programs”, RAIRO-Theor. Inf. Appl., 29, № 1, 1995, 75
Juraj Hromkovič, 1450, Mathematical Foundations of Computer Science 1998, 1998, 789
Elizaveta A. Okol’nishnikova, 3777, Stochastic Algorithms: Foundations and Applications, 2005, 107
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, “Hierarchy theorems for kOBDDs and kIBDDs”, Theoretical Computer Science, 205, № 1-2, 1998, 45
Beate Bollig, Stephan Waack, Philipp Woelfel, “Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication”, Theoretical Computer Science, 362, № 1-3, 2006, 86
Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr, 5734, Mathematical Foundations of Computer Science 2009, 2009, 175
Ludmila Glinskih, Artur Riazanov, 13568, LATIN 2022: Theoretical Informatics, 2022, 626
E. A. Okol’nishnikova, Operations Research and Discrete Analysis, 1997, 205