On the Power of Different Types of Restricted Branching Programs - Beate Bollig; Martin Sauerhoff; Detlef Sieling; Ingo Wegener (Electron. Colloquium Comput. Complex., 1994)

Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams - Beate Bollig; Ingo Wegener (Electron. Colloquium Comput. Complex., 1995)

On the Average Case Circuit Delay of Disjunction. - Beate Bollig; Martin Hühne; Stefan Pölt; Petr Savický (Parallel Process. Lett., 1995)

On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. - Beate Bollig; Martin Löbbing; Ingo Wegener (Inf. Process. Lett., 1996)

Improving the Variable Ordering of OBDDs Is NP-Complete. - Beate Bollig; Ingo Wegener (IEEE Trans. Computers, 1996)

Completeness and Non-Completeness Results with Respect to Read-Once Projections. - Beate Bollig; Ingo Wegener (Inf. Comput., 1998)

A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. - Beate Bollig; Ingo Wegener (Inf. Process. Lett., 1998)

Hierarchy Theorems for kOBDDs and kIBDDs. - Beate Bollig; Martin Sauerhoff; Detlef Sieling; Ingo Wegener (Theor. Comput. Sci., 1998)

Komplexitätsanalysen für BDD-artige Datenstrukturen. - Beate Bollig (Shaker, 1998)

On the complexity of the hidden weighted bit function for various BDD models. - Beate Bollig; Martin Löbbing; Martin Sauerhoff; Ingo Wegener (RAIRO Theor. Informatics Appl., 1999)

Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. - Beate Bollig; Ingo Wegener (Theory Comput. Syst., 1999)

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication - Beate Bollig (Electron. Colloquium Comput. Complex., 2000)

Approximability and Nonapproximability by Binary Decision Diagrams - Beate Bollig; Ingo Wegener (Electron. Colloquium Comput. Complex., 2000)

Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. - Beate Bollig; Ingo Wegener (J. Comput. Syst. Sci., 2000)

On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. - Beate Bollig; Martin Sauerhoff; Ingo Wegener (CCC, 2001)

A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. - Beate Bollig; Philipp Woelfel (STOC, 2001)

On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. - Beate Bollig; Martin Sauerhoff; Ingo Wegener (Inf. Comput., 2002)

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. - Beate Bollig (Inf. Process. Lett., 2003)

Functions that have read-once branching programs of quadratic size are not necessarily testable. - Beate Bollig; Ingo Wegener (Inf. Process. Lett., 2003)

Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. - Beate Bollig (RAIRO Theor. Informatics Appl., 2003)

Property Testing and the Branching Program Size of Boolean Functions. - Beate Bollig (FCT, 2005)

A large lower bound on the query complexity of a simple boolean function. - Beate Bollig (Inf. Process. Lett., 2005)

A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. - Beate Bollig; Philipp Woelfel (Theory Comput. Syst., 2005)

Testing Membership in Formal Languages Implicitly Represented by Boolean Functions. - Beate Bollig (J. Univers. Comput. Sci., 2006)

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. - Beate Bollig; Stephan Waack; Philipp Woelfel (Theor. Comput. Sci., 2006)

Exact OBDD Bounds for some Fundamental Functions. - Beate Bollig; Niko Range; Ingo Wegener (Electron. Colloquium Comput. Complex., 2007)

The optimal read-once branching program complexity for the direct storage access function. - Beate Bollig (Inf. Process. Lett., 2008)

A note on the size of OBDDs for the graph of integer multiplication. - Beate Bollig (Inf. Process. Lett., 2008)

On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem. - Beate Bollig (SOFSEM, 2009)

Integer Multiplicaton and the Complexity of Binary Decision Diagrams. - Beate Bollig (Bull. EATCS, 2009)

On the size of (generalized) OBDDs for threshold functions. - Beate Bollig (Inf. Process. Lett., 2009)

Binary Decision Diagrams. - Beate Bollig; Martin Sauerhoff; Detlef Sieling; Ingo Wegener; Yves Crama; Peter L. Hammer (Boolean Models and Methods, 2010)

On Symbolic Representations of Maximum Matchings and (Un)directed Graphs. - Beate Bollig (IFIP TCS, 2010)

A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. - Beate Bollig (LATIN, 2010)

Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. - Beate Bollig (MFCS, 2010)

Symbolic OBDD-Based Reachability Analysis Needs Exponential Space. - Beate Bollig (SOFSEM, 2010)

Exponential space complexity for OBDD-based reachability analysis. - Beate Bollig (Inf. Process. Lett., 2010)

Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size. - Beate Bollig; Marc Gillé (SOFSEM, 2011)

Larger lower bounds on the OBDD complexity of integer multiplication. - Beate Bollig (Inf. Comput., 2011)

Randomized OBDDs for the most significant bit of multiplication need exponential space. - Beate Bollig; Marc Gillé (Inf. Process. Lett., 2011)

New Results on the Most Significant Bit of Integer Multiplication. - Beate Bollig; Jochen Klump (Theory Comput. Syst., 2011)

On the OBDD complexity of the most significant bit of integer multiplication. - Beate Bollig (Theor. Comput. Sci., 2011)

An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. - Beate Bollig; Tobias Pröger (LATA, 2012)

On symbolic OBDD-based algorithms for the minimum spanning tree problem. - Beate Bollig (Theor. Comput. Sci., 2012)

Priority functions for the approximation of the metric TSP. - Beate Bollig; Michael Capelle (Inf. Process. Lett., 2013)

On the Width of Ordered Binary Decision Diagrams. - Beate Bollig (COCOA, 2014)

On the Complexity of Some Ordering Problems. - Beate Bollig (MFCS (2), 2014)

On the Minimization of (Complete) Ordered Binary Decision Diagrams. - Beate Bollig (Electron. Colloquium Comput. Complex., 2014)

On efficient implicit OBDD-based algorithms for maximal matchings. - Beate Bollig; Tobias Pröger (Inf. Comput., 2014)

A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm. - Beate Bollig (Inf. Process. Lett., 2014)

Implicit computation of maximum bipartite matchings by sublinear functional operations. - Beate Bollig; Marc Gillé; Tobias Pröger (Theor. Comput. Sci., 2014)

On the OBDD representation of some graph classes. - Beate Bollig; Marc Bury (Discret. Appl. Math., 2016)

On the Relative Succinctness of Sentential Decision Diagrams. - Beate Bollig; Matthias Buttkus (Theory Comput. Syst., 2019)

On Limitations of Structured (Deterministic) DNNFs. - Beate Bollig; Matthias Buttkus (Theory Comput. Syst., 2020)

On the Relation Between Structured d-DNNFs and SDDs. - Beate Bollig; Martin Farenholtz (Theory Comput. Syst., 2021)