1. B. Bollig, S. Waack, P. Woelfel, Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication, in: Proc. Second IFIP, 2002.
2. B. Bollig, P. Woelfel, A lower bound technique for nondeterministic graph-driven read-once branching programs and its applications, in: Proc. 27th MFCS, Lecture Notes in Computer Science, Vol. 2420, Springer, Berlin, 2002.
3. On lower bounds for read-k-times branching programs;Borodin;Comput. Complexity,1993
4. Graph-driven free parity BDDs: Algorithms and lower bounds;Brosenne,2001
5. Lower bounds for general graph-driven read-once parity branching programs;Brosenne,2003