The following publications are possibly variants of this publication:
- A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its ApplicationsBeate Bollig, Philipp Woelfel. mst, 38(6):671-685, 2005. [doi]
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. TCS, 362(1-3):86-99, 2006. [doi]
- Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Stephan Waack, Philipp Woelfel. ifipTCS 2002: 83-94
- Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig, Philipp Woelfel, Stephan Waack. eccc, 8(073), 2001. [doi]
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig. eccc, 7(48), 2000. [doi]
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig. mfcs 2000: 222-231 [doi]
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig. ita, 35(2):149-162, 2001. [doi]
- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching ProgramsBeate Bollig. STACS 2003: 295-306 [doi]
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching ProgramsBeate Bollig. ita, 37(1):51-66, 2003. [doi]