51

Exponential space complexity for OBDD-based reachability analysis

Beate Bollig
Journal:
Information Processing Letters
Year:
2010
Language:
english
File:
PDF, 126 KB
english, 2010
52

On symbolic OBDD-based algorithms for the minimum spanning tree problem

Beate Bollig
Journal:
Theoretical Computer Science
Year:
2012
Language:
english
File:
PDF, 310 KB
english, 2012
56

A large lower bound on the query complexity of a simple boolean function

Beate Bollig
Journal:
Information Processing Letters
Year:
2005
Language:
english
File:
PDF, 101 KB
english, 2005
59

On the size of (generalized) OBDDs for threshold functions

Beate Bollig
Journal:
Information Processing Letters
Year:
2009
Language:
english
File:
PDF, 154 KB
english, 2009
60

Larger lower bounds on the OBDD complexity of integer multiplication

Beate Bollig
Journal:
Information and Computation
Year:
2011
Language:
english
File:
PDF, 458 KB
english, 2011
62

On the Relative Succinctness of Sentential Decision Diagrams

Bollig, Beate, Buttkus, Matthias
Journal:
Theory of Computing Systems
Year:
2019
Language:
english
File:
PDF, 1.18 MB
english, 2019
64

On the OBDD complexity of the most significant bit of integer multiplication

Beate Bollig
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 363 KB
english, 2011
65

Completeness and Non-Completeness Results with Respect to Read-Once Projections

Beate Bollig, Ingo Wegener
Journal:
Information and Computation
Year:
1998
Language:
english
File:
PDF, 219 KB
english, 1998