Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. - Henrik Brosenne; Matthias Homeister; Stephan Waack (MFCS, 2001)

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)

Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. - Henrik Brosenne; Matthias Homeister; Stephan Waack (MFCS, 2003)

Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. - Henrik Brosenne; Matthias Homeister; Stephan Waack (Inf. Process. Lett., 2006)

Obere und untere Schranken für eingeschränkte Parity-Branchingprogramme. - Henrik Brosenne (2006)

On approximation by XOR-OBDDs. - Henrik Brosenne; Carsten Damm; Matthias Homeister; Stephan Waack (Inf. Process. Lett., 2007)

Performance Study of PANA Pre-authentication for Interdomain Handover. - Patryk Chamuczynski; Omar Alfandi; Constantin Werner; Henrik Brosenne; Dieter Hogrefe (ICNS, 2008)

Fast Re-Authentication for Inter-Domain Handover using Context Transfer. - Omar Alfandi; Henrik Brosenne; Constantin Werner; Dieter Hogrefe (ICOIN, 2008)

Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication. - Patryk Chamuczynski; Omar Alfandi; Henrik Brosenne; Constantin Werner; Dieter Hogrefe (PerCom, 2008)

Security Verification of Trust-Based Authentication Handover in IP Networks. - Saleh Al-shadly; Omar Alfandi; Henrik Brosenne; Dieter Hogrefe (ICCCN, 2011)