Previous Publications

• Journal Articles
  • Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack.
    On approximation by ⊕-OBDDs.
    Information Processing Letters, 102:17-21, Elsevier, 2007.
    Article at Science Direct.

  • Henrik Brosenne, Matthias Homeister, Stephan Waack.
    Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance.
    Information Processing Letters, 98:6-10, Elsevier, 2006.
    Article at Science Direct.

  • Henrik Brosenne, Matthias Homeister und Stephan Waack.
    Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs.
    RAIRO-Theoretical Informatics and Applications, 36(3):229-247, EDP Sciences, 2002.
    Article at EDP Sciences.

• Articles in Conference Proceedings
  • Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack.
    On Approximation by ParityOBDDs.
    Proceedings of the 7th International Symposium on Representations and Methodology of Future Computing Technologies, 2005.

  • Henrik Brosenne, Matthias Homeister, Stephan Waack.
    Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.
    Proceedings of the 28th Symposium Mathematical Foundations of Computer Science (MFCS 2003), Lecture Notes in Computer Science, 2747:290-299, Springer Verlag, 2003

  • Henrik Brosenne, Matthias Homeister, Stephan Waack.
    Graph Driven Free Parity-BDDs: Algorithms and Lower Bounds (extended version).
    Proceedings of the 26th Symposium Mathematical Foundations of Computer Science (MFCS 2001), Lecture Notes in Computer Science, 2136:212-223, Springer Verlag, 2001.

 

Back to Publications at Henrik Brosenne