- E.A. Okol'nishnikova, “Comparing the sizes of nondeterministic branching read-k-times programs”, Discrete Applied Mathematics, 135, № 1-3, 2004, 205
- Stasys Jukna, Georg Schnitger, “Yet harder knapsack problems”, Theoretical Computer Science, 412, № 45, 2011, 6351
- Juraj Hromkovič, “Communication Complexity and Lower Bounds on Multilective Computations”, RAIRO-Theor. Inf. Appl., 33, № 2, 1999, 193
- P. Beame, M. Saks, J.S. Thathachar, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 254
- Paul Beame, Vincent Liew, Mihai Pǎtraşcu, 9134, Automata, Languages, and Programming, 2015, 103
- Anna Gál, “A simple function that requires exponential size read-once branching programs”, Information Processing Letters, 62, № 1, 1997, 13
- Martin Sauerhoff, Philipp Woelfel, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003, 186
- Beate Bollig, Ingo Wegener, “A very simple function that requires exponential size read-once branching programs”, Information Processing Letters, 66, № 2, 1998, 53
- Farid Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Christopher Pollett, “On the computational power of probabilistic and quantum branching program”, Information and Computation, 203, № 2, 2005, 145
- Farid Ablayev, Marek Karpinski, Rustam Mubarakzjanov, “On BPP versus NP∪coNP for ordered read-once branching programs”, Theoretical Computer Science, 264, № 1, 2001, 127