Matthias Homeister

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2007
j4		Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack: On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007)
	2006
j3		Henrik Brosenne, Matthias Homeister, Stephan Waack: Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. Inf. Process. Lett. 98(1): 6-10 (2006)
j2		Matthias Homeister: Lower bounds for restricted read-once parity branching programs. Theor. Comput. Sci. 359(1-3): 1-14 (2006)
	2003
b1		Matthias Homeister: On lower bounds for parity branching programs. University of Göttingen 2003
c2		Henrik Brosenne, Matthias Homeister, Stephan Waack: Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299
i1		Matthias Homeister: Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs. Electronic Colloquium on Computational Complexity (ECCC)(068) (2003)
	2002
j1		Henrik Brosenne, Matthias Homeister, Stephan Waack: Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. ITA 36(3): 229-247 (2002)
	2001
c1		Henrik Brosenne, Matthias Homeister, Stephan Waack: Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. MFCS 2001: 212-223

Coauthor Index

Last update Fri May 24 20:42:51 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page