 | 2012 |
|---|
| 61 |       | Beate Bollig,
Tobias Pröger:
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings.
LATA 2012: 143-154 |
| 60 | | Beate Bollig,
Marc Gillé,
Tobias Pröger:
Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations.
TAMC 2012: 473-486 |
| 2011 |
|---|
| 59 | | Beate Bollig,
Marc Gillé:
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size.
SOFSEM 2011: 135-145 |
| 58 | | Beate Bollig:
Larger lower bounds on the OBDD complexity of integer multiplication.
Inf. Comput. 209(3): 333-343 (2011) |
| 57 | | Beate Bollig,
Marc Gillé:
Randomized OBDDs for the most significant bit of multiplication need exponential space.
Inf. Process. Lett. 111(4): 151-155 (2011) |
| 56 | | Beate Bollig:
On the OBDD complexity of the most significant bit of integer multiplication.
Theor. Comput. Sci. 412(18): 1686-1695 (2011) |
| 55 | | Beate Bollig,
Jochen Klump:
New Results on the Most Significant Bit of Integer Multiplication.
Theory Comput. Syst. 48(1): 170-188 (2011) |
| 2010 |
|---|
| 54 | | Beate Bollig:
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem.
COCOA (2) 2010: 16-30 |
| 53 | | Beate Bollig:
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs.
IFIP TCS 2010: 286-300 |
| 52 | | Beate Bollig:
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication.
LATIN 2010: 255-266 |
| 51 | | Beate Bollig:
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.
MFCS 2010: 186-197 |
| 50 | | Beate Bollig:
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space.
SOFSEM 2010: 224-234 |
| 49 | | Beate Bollig:
Exponential space complexity for OBDD-based reachability analysis.
Inf. Process. Lett. 110(21): 924-927 (2010) |
| 48 | | Beate Bollig,
Niko Range,
Ingo Wegener:
Exact OBDD Bounds for Some Fundamental Functions.
Theory Comput. Syst. 47(2): 593-609 (2010) |
| 2009 |
|---|
| 47 | | Beate Bollig:
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication.
LATA 2009: 212-223 |
| 46 | | Beate Bollig:
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.
SOFSEM 2009: 129-140 |
| 45 |  | Beate Bollig:
Integer Multiplicaton and the Complexity of Binary Decision Diagrams.
Bulletin of the EATCS 98: 78-106 (2009) |
| 44 | | Beate Bollig:
On the size of (generalized) OBDDs for threshold functions.
Inf. Process. Lett. 109(10): 499-503 (2009) |
| 2008 |
|---|
| 43 | | Beate Bollig,
Jochen Klump:
New Results on the Most Significant Bit of Integer Multiplication.
ISAAC 2008: 883-894 |
| 42 | | Beate Bollig,
Niko Range,
Ingo Wegener:
Exact OBDD Bounds for Some Fundamental Functions.
SOFSEM 2008: 174-185 |
| 41 | | Beate Bollig:
On the OBDD Complexity of the Most Significant Bit of Integer Multiplication.
TAMC 2008: 306-317 |
| 40 | | Beate Bollig:
On the OBDD complexity of the most significant bit of integer multiplication.
Electronic Colloquium on Computational Complexity (ECCC) 15(056): (2008) |
| 39 | | Beate Bollig:
The optimal read-once branching program complexity for the direct storage access function.
Inf. Process. Lett. 106(4): 171-174 (2008) |
| 38 | | Beate Bollig:
A note on the size of OBDDs for the graph of integer multiplication.
Inf. Process. Lett. 109(1): 41-43 (2008) |
| 2007 |
|---|
| 37 | | Beate Bollig,
Niko Range,
Ingo Wegener:
Exact OBDD Bounds for some Fundamental Functions.
Electronic Colloquium on Computational Complexity (ECCC) 14(049): (2007) |
| 36 | | Beate Bollig:
The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function.
Electronic Colloquium on Computational Complexity (ECCC) 14(110): (2007) |
| 2006 |
|---|
| 35 | | Beate Bollig:
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions.
J. UCS 12(6): 710-724 (2006) |
| 34 | | 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 |
|---|
| 33 | | Beate Bollig:
Property Testing and the Branching Program Size of Boolean Functions.
FCT 2005: 258-269 |
| 32 | | Beate Bollig:
A large lower bound on the query complexity of a simple boolean function.
Inf. Process. Lett. 95(4): 423-428 (2005) |
| 31 | | 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) |
| 2003 |
|---|
| 30 | | Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs.
STACS 2003: 295-306 |
| 29 | | Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs.
ITA 37(1): 51-66 (2003) |
| 28 | | 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) |
| 27 | | 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) |
| 2002 |
|---|
| 26 | | 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 |
| 25 | | Beate Bollig,
Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.
MFCS 2002: 131-142 |
| 24 | | Beate Bollig:
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Electronic Colloquium on Computational Complexity (ECCC)(033): (2002) |
| 23 | | 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) |
| 2001 |
|---|
| 22 | | Beate Bollig,
Martin Sauerhoff,
Ingo Wegener:
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.
IEEE Conference on Computational Complexity 2001: 172-183 |
| 21 | | Beate Bollig,
Philipp Woelfel:
A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal.
STOC 2001: 419-424 |
| 20 | | Beate Bollig,
Philipp Woelfel,
Stephan Waack:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Electronic Colloquium on Computational Complexity (ECCC) 8(073): (2001) |
| 19 | | Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
ITA 35(2): 149-162 (2001) |
| 2000 |
|---|
| 18 | | Beate Bollig,
Ingo Wegener:
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.
ICALP 2000: 187-198 |
| 17 | | Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
MFCS 2000: 222-231 |
| 16 | | Beate Bollig:
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Electronic Colloquium on Computational Complexity (ECCC) 7(48): (2000) |
| 15 | | Beate Bollig,
Ingo Wegener:
Approximability and Nonapproximability by Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC) 7(52): (2000) |
| 14 | | 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) |
| 1999 |
|---|
| 13 | | Beate Bollig,
Ingo Wegener:
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
Electronic Colloquium on Computational Complexity (ECCC)(48): (1999) |
| 12 | | Beate Bollig,
Martin Löbbing,
Martin Sauerhoff,
Ingo Wegener:
On the complexity of the hidden weighted bit function for various BDD models.
ITA 33(2): 103-116 (1999) |
| 11 | | Beate Bollig,
Ingo Wegener:
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.
Theory Comput. Syst. 32(4): 487-503 (1999) |
| 1998 |
|---|
| 10 | | Beate Bollig,
Ingo Wegener:
Completeness and Non-Completeness Results with Respect to Read-Once Projections.
Inf. Comput. 143(1): 24-33 (1998) |
| 9 | | Beate Bollig,
Ingo Wegener:
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs.
Inf. Process. Lett. 66(2): 53-57 (1998) |
| 8 | | Beate Bollig,
Martin Sauerhoff,
Detlef Sieling,
Ingo Wegener:
Hierarchy Theorems for kOBDDs and kIBDDs.
Theor. Comput. Sci. 205(1-2): 45-60 (1998) |
| 1997 |
|---|
| 7 | | Beate Bollig,
Ingo Wegener:
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.
MFCS 1997: 159-168 |
| 1996 |
|---|
| 6 | | Beate Bollig,
Ingo Wegener:
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams.
STACS 1996: 491-502 |
| 5 | | Beate Bollig,
Ingo Wegener:
Improving the Variable Ordering of OBDDs Is NP-Complete.
IEEE Trans. Computers 45(9): 993-1002 (1996) |
| 4 | | 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) |
| 1995 |
|---|
| 3 | | Beate Bollig,
Ingo Wegener:
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC) 2(42): (1995) |
| 2 | | Beate Bollig,
Martin Hühne,
Stefan Pölt,
Petr Savický:
On the Average Case Circuit Delay of Disjunction.
Parallel Processing Letters 5: 275-280 (1995) |
| 1994 |
|---|
| 1 | | Beate Bollig,
Martin Sauerhoff,
Detlef Sieling,
Ingo Wegener:
On the Power of Different Types of Restricted Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 1(26): (1994) |
Data released under the ODC-BY 1.0 license — See also our legal information page