Rakesh Kumar Sinha, Jayram S Thathachar, “Efficient Oblivious Branching Programs for Threshold and Mod Functions”, Journal of Computer and System Sciences, 55, № 3, 1997, 373
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
P. Beame, M. Saks, J.S. Thathachar, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 254
Martin Sauerhoff, “Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines”, Journal of Computer and System Sciences, 66, № 3, 2003, 473
Allan Borodin, 762, Algorithms and Computation, 1993, 209
Beate Bollig, Stephan Waack, Philipp Woelfel, Foundations of Information Technology in the Era of Network and Mobile Computing, 2002, 83
Detlef Sieling, 1738, Foundations of Software Technology and Theoretical Computer Science, 1999, 356
Stasys Jukna, “A note on read-$k$ times branching programs”, RAIRO-Theor. Inf. Appl., 29, № 1, 1995, 75
R.K. Sinha, J.S. Thathachar, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994, 309
Beate Bollig, “Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs”, RAIRO-Theor. Inf. Appl., 37, № 1, 2003, 51