default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeate Bollig
Person information
- affiliation: Technical University of Dortmund, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j38]Beate Bollig
, Martin Farenholtz:
On the Relation Between Structured d-DNNFs and SDDs. Theory Comput. Syst. 65(2): 274-295 (2021)- 2020
- [j37]Beate Bollig, Matthias Buttkus:
On Limitations of Structured (Deterministic) DNNFs. Theory Comput. Syst. 64(5): 799-825 (2020)
2010 – 2019
- 2019
- [j36]Beate Bollig, Matthias Buttkus:
On the Relative Succinctness of Sentential Decision Diagrams. Theory Comput. Syst. 63(6): 1250-1277 (2019) - [i13]Beate Bollig, Martin Farenholtz:
On the relation between structured d-DNNFs and SDDs. CoRR abs/1912.01430 (2019) - 2018
- [i12]Beate Bollig, Matthias Buttkus:
On the Relative Succinctness of Sentential Decision Diagrams. CoRR abs/1802.04544 (2018) - 2016
- [j35]Beate Bollig, Marc Bury:
On the OBDD representation of some graph classes. Discret. Appl. Math. 214: 34-53 (2016) - [j34]Beate Bollig:
On the Minimization of (Complete) Ordered Binary Decision Diagrams. Theory Comput. Syst. 59(3): 532-559 (2016) - 2014
- [j33]Beate Bollig, Tobias Pröger:
On efficient implicit OBDD-based algorithms for maximal matchings. Inf. Comput. 239: 29-43 (2014) - [j32]Beate Bollig:
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm. Inf. Process. Lett. 114(3): 124-129 (2014) - [j31]Beate Bollig, Marc Gillé, Tobias Pröger:
Implicit computation of maximum bipartite matchings by sublinear functional operations. Theor. Comput. Sci. 560: 131-146 (2014) - [c25]Beate Bollig:
On the Width of Ordered Binary Decision Diagrams. COCOA 2014: 444-458 - [c24]Beate Bollig:
On the Complexity of Some Ordering Problems. MFCS (2) 2014: 118-129 - [i11]Beate Bollig:
On the Minimization of (Complete) Ordered Binary Decision Diagrams. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j30]Beate Bollig, Michael Capelle:
Priority functions for the approximation of the metric TSP. Inf. Process. Lett. 113(14-16): 584-591 (2013) - 2012
- [j29]Beate Bollig:
On symbolic OBDD-based algorithms for the minimum spanning tree problem. Theor. Comput. Sci. 447: 2-12 (2012) - [c23]Beate Bollig, Tobias Pröger:
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. LATA 2012: 143-154 - [c22]Beate Bollig, Marc Gillé, Tobias Pröger:
Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations. TAMC 2012: 473-486 - 2011
- [j28]Beate Bollig:
Larger lower bounds on the OBDD complexity of integer multiplication. Inf. Comput. 209(3): 333-343 (2011) - [j27]Beate Bollig, Marc Gillé:
Randomized OBDDs for the most significant bit of multiplication need exponential space. Inf. Process. Lett. 111(4): 151-155 (2011) - [j26]Beate Bollig, Jochen Klump:
New Results on the Most Significant Bit of Integer Multiplication. Theory Comput. Syst. 48(1): 170-188 (2011) - [j25]Beate Bollig:
On the OBDD complexity of the most significant bit of integer multiplication. Theor. Comput. Sci. 412(18): 1686-1695 (2011) - [c21]Beate Bollig, Marc Gillé:
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size. SOFSEM 2011: 135-145 - 2010
- [j24]Beate Bollig:
Exponential space complexity for OBDD-based reachability analysis. Inf. Process. Lett. 110(21): 924-927 (2010) - [j23]Beate Bollig, Niko Range, Ingo Wegener:
Exact OBDD Bounds for Some Fundamental Functions. Theory Comput. Syst. 47(2): 593-609 (2010) - [c20]Beate Bollig:
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. COCOA (2) 2010: 16-30 - [c19]Beate Bollig:
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs. IFIP TCS 2010: 286-300 - [c18]Beate Bollig:
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. LATIN 2010: 255-266 - [c17]Beate Bollig:
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. MFCS 2010: 186-197 - [c16]Beate Bollig:
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space. SOFSEM 2010: 224-234 - [p1]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer:
Binary Decision Diagrams. Boolean Models and Methods 2010: 473-505
2000 – 2009
- 2009
- [j22]Beate Bollig:
Integer Multiplicaton and the Complexity of Binary Decision Diagrams. Bull. EATCS 98: 78-106 (2009) - [j21]Beate Bollig:
On the size of (generalized) OBDDs for threshold functions. Inf. Process. Lett. 109(10): 499-503 (2009) - [c15]Beate Bollig:
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication. LATA 2009: 212-223 - [c14]Beate Bollig:
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem. SOFSEM 2009: 129-140 - 2008
- [j20]Beate Bollig:
The optimal read-once branching program complexity for the direct storage access function. Inf. Process. Lett. 106(4): 171-174 (2008) - [j19]Beate Bollig:
A note on the size of OBDDs for the graph of integer multiplication. Inf. Process. Lett. 109(1): 41-43 (2008) - [c13]Beate Bollig, Jochen Klump:
New Results on the Most Significant Bit of Integer Multiplication. ISAAC 2008: 883-894 - [c12]Beate Bollig, Niko Range, Ingo Wegener:
Exact OBDD Bounds for Some Fundamental Functions. SOFSEM 2008: 174-185 - [c11]Beate Bollig:
On the OBDD Complexity of the Most Significant Bit of Integer Multiplication. TAMC 2008: 306-317 - [i10]Beate Bollig:
On the OBDD complexity of the most significant bit of integer multiplication. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i9]Beate Bollig:
The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function. Electron. Colloquium Comput. Complex. TR07 (2007) - [i8]Beate Bollig, Niko Range, Ingo Wegener:
Exact OBDD Bounds for some Fundamental Functions. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j18]Beate Bollig:
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions. J. Univers. Comput. Sci. 12(6): 710-724 (2006) - [j17]Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. Theor. Comput. Sci. 362(1-3): 86-99 (2006) - 2005
- [j16]Beate Bollig:
A large lower bound on the query complexity of a simple boolean function. Inf. Process. Lett. 95(4): 423-428 (2005) - [j15]Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Theory Comput. Syst. 38(6): 671-685 (2005) - [c10]Beate Bollig:
Property Testing and the Branching Program Size of Boolean Functions. FCT 2005: 258-269 - 2003
- [j14]Beate Bollig:
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. Inf. Process. Lett. 86(3): 143-148 (2003) - [j13]Beate Bollig, Ingo Wegener:
Functions that have read-once branching programs of quadratic size are not necessarily testable. Inf. Process. Lett. 87(1): 25-29 (2003) - [j12]Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. RAIRO Theor. Informatics Appl. 37(1): 51-66 (2003) - [c9]Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. STACS 2003: 295-306 - 2002
- [j11]Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178(1): 263-278 (2002) - [c8]Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. IFIP TCS 2002: 83-94 - [c7]Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. MFCS 2002: 131-142 - [i7]Beate Bollig:
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j10]Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. RAIRO Theor. Informatics Appl. 35(2): 149-162 (2001) - [c6]Beate Bollig, Martin Sauerhoff, Ingo Wegener:
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. CCC 2001: 172-183 - [c5]Beate Bollig, Philipp Woelfel:
A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. STOC 2001: 419-424 - [i6]Beate Bollig, Philipp Woelfel, Stephan Waack:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j9]Beate Bollig, Ingo Wegener:
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. J. Comput. Syst. Sci. 61(3): 558-579 (2000) - [c4]Beate Bollig, Ingo Wegener:
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. ICALP 2000: 187-198 - [c3]Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. MFCS 2000: 222-231 - [i5]Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Electron. Colloquium Comput. Complex. TR00 (2000) - [i4]Beate Bollig, Ingo Wegener:
Approximability and Nonapproximability by Binary Decision Diagrams. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j8]Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener:
On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Informatics Appl. 33(2): 103-116 (1999) - [j7]Beate Bollig, Ingo Wegener:
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Theory Comput. Syst. 32(4): 487-503 (1999) - [i3]Beate Bollig, Ingo Wegener:
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [b1]Beate Bollig:
Komplexitätsanalysen für BDD-artige Datenstrukturen. Technical University of Dortmund, Germany, Shaker 1998, ISBN 978-3-8265-3469-0, pp. 1-140 - [j6]Beate Bollig, Ingo Wegener:
Completeness and Non-Completeness Results with Respect to Read-Once Projections. Inf. Comput. 143(1): 24-33 (1998) - [j5]Beate Bollig, Ingo Wegener:
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. Inf. Process. Lett. 66(2): 53-57 (1998) - [j4]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
Hierarchy Theorems for kOBDDs and kIBDDs. Theor. Comput. Sci. 205(1-2): 45-60 (1998) - 1997
- [c2]Beate Bollig, Ingo Wegener:
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. MFCS 1997: 159-168 - 1996
- [j3]Beate Bollig, Martin Löbbing, Ingo Wegener:
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. Inf. Process. Lett. 59(5): 233-239 (1996) - [j2]Beate Bollig, Ingo Wegener:
Improving the Variable Ordering of OBDDs Is NP-Complete. IEEE Trans. Computers 45(9): 993-1002 (1996) - [c1]Beate Bollig, Ingo Wegener:
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. STACS 1996: 491-502 - 1995
- [j1]Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický:
On the Average Case Circuit Delay of Disjunction. Parallel Process. Lett. 5: 275-280 (1995) - [i2]Beate Bollig, Ingo Wegener:
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [i1]Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs. Electron. Colloquium Comput. Complex. TR94 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
