![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 7 | Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack: On approximation by XOR-OBDDs. Inf. Process. Lett. 102(1): 17-21 (2007) | |
| 6 | 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) | |
| 4 | Henrik Brosenne, Matthias Homeister, Stephan Waack: Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. MFCS 2003: 290-299 | |
| 2 | 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) | |
| 1 | Henrik Brosenne, Matthias Homeister, Stephan Waack: Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. MFCS 2001: 212-223 |
Selection of 5 from 7 records - Matthias Homeister has 3 coauthors
Copyright © 2009-12-08 by Michael Ley (ley@uni-trier.de)