@article{BrosenneHomeisterWaack2002, author = {Brosenne, Henrik and Homeister, Matthias and Waack, Stephan}, title = {Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs}, series = {RAIRO - Theoretical Informatics and Applications (ITA)}, volume = {36}, journal = {RAIRO - Theoretical Informatics and Applications (ITA)}, number = {3}, issn = {1290-385X (Online)}, doi = {10.1051/ita:2002011}, pages = {229 -- 247}, year = {2002}, language = {en} } @inproceedings{BrosenneHomeisterWaack2001, author = {Brosenne, Henrik and Homeister, Matthias and Waack, Stephan}, title = {Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds}, series = {Mathematical foundations of computer science 2001 : 26th international symposium ; proceedings / MFCS 2001, Mari{\´a}nsk{\´e} L{\´a}zně, Czech Republic, August 27 - 31, 2001}, booktitle = {Mathematical foundations of computer science 2001 : 26th international symposium ; proceedings / MFCS 2001, Mari{\´a}nsk{\´e} L{\´a}zně, Czech Republic, August 27 - 31, 2001}, editor = {Sgall, Jiř{\´i}}, publisher = {Springer}, address = {Berlin [u.a.]}, isbn = {978-3-540-44683-5 (Online)}, doi = {10.1007/3-540-44683-4_19}, pages = {212 -- 223}, year = {2001}, language = {en} } @article{BrosenneDammHomeisteretal.2007, author = {Brosenne, Henrik and Damm, Carsten and Homeister, Matthias and Waack, Stephan}, title = {On approximation by ⊕-OBDDs}, series = {Information Processing Letters}, volume = {102}, journal = {Information Processing Letters}, number = {1}, issn = {1872-6119 (Online)}, doi = {10.1016/j.ipl.2006.10.011}, pages = {17 -- 21}, year = {2007}, language = {en} } @article{BrosenneHomeisterWaack2006, author = {Brosenne, Henrik and Homeister, Matthias and Waack, Stephan}, title = {Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance}, series = {Information Processing Letters}, volume = {98}, journal = {Information Processing Letters}, number = {1}, issn = {1872-6119 (Online)}, doi = {10.1016/j.ipl.2005.11.011}, pages = {6 -- 10}, year = {2006}, language = {en} } @inproceedings{BrosenneHomeisterWaack2003, author = {Brosenne, Henrik and Homeister, Matthias and Waack, Stephan}, title = {Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs}, series = {Mathematical foundations of computer science 2003 : 28th international symposium ; proceedings / MFCS 2003, Bratislava, Slovakia, August 25 - 29, 2003}, booktitle = {Mathematical foundations of computer science 2003 : 28th international symposium ; proceedings / MFCS 2003, Bratislava, Slovakia, August 25 - 29, 2003}, editor = {Rovan, Branislav}, publisher = {Springer}, address = {Berlin ; Heidelberg}, isbn = {978-3-540-40671-6 (Print)}, doi = {10.1007/978-3-540-45138-9_23}, pages = {290 -- 299}, year = {2003}, language = {en} }