Articles in Conference Proceedings

 

Graph driven free parity-BDDs: algorithms and lower bounds
Proceedings of the 26th Symposium Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Computer Science 2136, Springer Verlag 2001, 212 - 223. (Autoren: H. Brosenne, M. Homeister, St. Waack).

 

Parity Graph-driven read-once branching programs and an exponential lower bound for integer multiplication
Proceedings 2nd IFIP International Conference on Theoretical ComputerScience, 2002, 83-94. (Autoren: B. Bollig, St. Waack, P. Woelfel).

 

Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs
Proceedings of the 28th Symposium Mathematical Foundations of Computer Science (MFCS 2003), Lecture Notes in Computer Science 2747, Springer Verlag 2003, 290 - 299 (Autoren: H. Brosenne, M. Homeister, St. Waack).

 

Quantum Ordered Binary Decision Diagrams with Repeated Test
Proceedings of the 7th International Symposium on Representations and Methodology of Future Computing Technologies 2005, 10-14 (Autoren: M. Homeister, St. Waack ).

 

On approximations by $\oplus$ OBDDs
Proceedings of the 7th International Symposium on Representations and Methodology of Future Computing Technologies 2005, 120-125 (Autoren: H. Brosenne, C. Damm M. Homeister, St. Waack).