The following publications are possibly variants of this publication:
- On Nondeterminism versus Randomness for Read-Once Branching ProgramsMartin Sauerhoff. eccc, 4(30), 1997. [doi]
- Randomness and Nondeterminism are Incomparable for Read-Once Branching ProgramsMartin Sauerhoff. eccc, 5(18), 1998. [doi]
- Complexity theoretical results for randomized branching programsMartin Sauerhoff. PhD thesis, Technical University of Dortmund, Germany, 1999. [doi]
- The Power of Nondeterminism and Randomness for Oblivious Branching ProgramsJuraj Hromkovic, Martin Sauerhoff. mst, 36(2):159-182, 2003. [doi]
- On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable FunctionsMartin Sauerhoff. STACS 1999: 488-499 [doi]