Matthias Homeister

According to our database, Matthias Homeister authored at least 9 papers between 2001 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

On approximation by XOR-OBDDs.

Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack

Inf. Process. Lett., 2007

2006

Lower bounds for restricted read-once parity branching programs.

Matthias Homeister

Theor. Comput. Sci., 2006

Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance.

Henrik Brosenne, Matthias Homeister, Stephan Waack

Inf. Process. Lett., 2006

2005

Quantum Computing verstehen - Grundlagen, Anwendungen, Perspektiven.

Matthias Homeister

Computational intelligence, Vieweg, ISBN: 978-3-528-05921-7, 2005

2003

On lower bounds for parity branching programs.

Matthias Homeister

PhD thesis, 2003

Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs

Matthias Homeister

Electron. Colloquium Comput. Complex., 2003

Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.

Henrik Brosenne, Matthias Homeister, Stephan Waack

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

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

2001

Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.

Henrik Brosenne, Matthias Homeister, Stephan Waack

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001