Beate Bollig

Improving the variable ordering of OBDDs is NP-complete

Beate Bollig, Ingo Wegener · IEEE Transactions on Computers · 1996 · 544 citations

Circuit Complexity, Computational Complexity Theory, Engineering +20

On the effect of local changes in the variable ordering of ordered decision diagrams

Beate Bollig, Martin Löbbing, Ingo Wegener · Information Processing Letters · 1996 · 38 citations

Order Theory, Variable Ordering, Decision Tree +7

Hierarchy theorems for kOBDDs and kIBDDs

Beate Bollig, Martin Sauerhoff, Detlef Sieling et al. · Theoretical Computer Science · 1998 · 36 citations

Domain Theory, Automated Reasoning, Topological Combinatorics +2

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models

Beate Bollig, Martin Löbbing, Martin Sauerhoff et al. · RAIRO - Theoretical Informatics and Applications · 1999 · 33 citations

Circuit Complexity, Computational Complexity Theory, Engineering +20

A read-once branching program lower bound of Ω(2^n/4) for integer multiplication using universal hashing

Beate Bollig, Philipp Woelfel · 2001 · 28 citations