- P. Savický, S. Žák, “A read-once lower bound and a (1,+k)-hierarchy for branching programs”, Theoretical Computer Science, 238, № 1-2, 2000, 347
- Stasys Jukna, “Expanders and time-restricted branching programs”, Theoretical Computer Science, 409, № 3, 2008, 471
- P. Woelfel, Proceedings 17th IEEE Annual Conference on Computational Complexity, 2002, 80
- Kazuo Iwama, Atsuki Nagao, “Read-Once Branching Programs for Tree Evaluation Problems”, ACM Trans. Comput. Theory, 11, № 1, 2019, 1
- Detlef Sieling, 1738, Foundations of Software Technology and Theoretical Computer Science, 1999, 356
- Beate Bollig, Ingo Wegener, “Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems”, Journal of Computer and System Sciences, 61, № 3, 2000, 558
- S. Jukna, S. Žák, “On uncertainty versus size in branching programs”, Theoretical Computer Science, 290, № 3, 2003, 1851
- Pavol Ďuriš, Juraj Hromkovič, Stasys Jukna, Martin Sauerhoff, Georg Schnitger, 2010, STACS 2001, 2001, 206
- Philipp Woelfel, 2285, STACS 2002, 2002, 431
- Detlef Sieling, “Lower Bounds for Linearly Transformed OBDDs and FBDDs”, Journal of Computer and System Sciences, 64, № 2, 2002, 419