Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. - Henrik Brosenne; Matthias Homeister; Stephan Waack (MFCS, 2001)

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. - Henrik Brosenne; Matthias Homeister; Stephan Waack (RAIRO Theor. Informatics Appl., 2002)

Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. - Henrik Brosenne; Matthias Homeister; Stephan Waack (MFCS, 2003)

Lower Bounds for the Sum of Graph–driven Read–Once Parity Branching Programs - Matthias Homeister (Electron. Colloquium Comput. Complex., 2003)

On lower bounds for parity branching programs. - Matthias Homeister (2003)

Quantum Computing verstehen - Grundlagen, Anwendungen, Perspektiven. - Matthias Homeister (Vieweg, 2005)

Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. - Henrik Brosenne; Matthias Homeister; Stephan Waack (Inf. Process. Lett., 2006)

Lower bounds for restricted read-once parity branching programs. - Matthias Homeister (Theor. Comput. Sci., 2006)

On approximation by XOR-OBDDs. - Henrik Brosenne; Carsten Damm; Matthias Homeister; Stephan Waack (Inf. Process. Lett., 2007)