| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Beate Bollig, Tobias Pröger |
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings.  |
LATA  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Marc Gillé, Tobias Pröger |
Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Marc Gillé |
Randomized OBDDs for the most significant bit of multiplication need exponential space. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
On the OBDD complexity of the most significant bit of integer multiplication. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Larger lower bounds on the OBDD complexity of integer multiplication. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Jochen Klump |
New Results on the Most Significant Bit of Integer Multiplication. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Marc Gillé |
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Exponential space complexity for OBDD-based reachability analysis. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Niko Range, Ingo Wegener |
Exact OBDD Bounds for Some Fundamental Functions. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig |
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs. |
IFIP TCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
On the size of (generalized) OBDDs for threshold functions. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Integer Multiplicaton and the Complexity of Binary Decision Diagrams. |
Bulletin of the EATCS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig |
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
variable ordering problem, Computational complexity, ordered binary decision diagrams, threshold functions |
| 1 | Beate Bollig |
The optimal read-once branching program complexity for the direct storage access function. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
A note on the size of OBDDs for the graph of integer multiplication. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
On the OBDD complexity of the most significant bit of integer multiplication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig |
On the OBDD Complexity of the Most Significant Bit of Integer Multiplication. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
Computational complexity, lower bounds, ordered binary decision diagrams, integer multiplication |
| 1 | Beate Bollig, Niko Range, Ingo Wegener |
Exact OBDD Bounds for Some Fundamental Functions. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
Computational complexity, lower bounds, ordered binary decision diagrams |
| 1 | Beate Bollig, Jochen Klump |
New Results on the Most Significant Bit of Integer Multiplication. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Niko Range, Ingo Wegener |
Exact OBDD Bounds for some Fundamental Functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Stephan Waack, Philipp Woelfel |
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions. |
J. UCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig |
A large lower bound on the query complexity of a simple boolean function. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Philipp Woelfel |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Property Testing and the Branching Program Size of Boolean Functions. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Functions that have read-once branching programs of quadratic size are not necessarily testable. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. |
ITA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Martin Sauerhoff, Ingo Wegener |
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Philipp Woelfel |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Stephan Waack, Philipp Woelfel |
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig |
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. |
ITA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Martin Sauerhoff, Ingo Wegener |
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs |
| 1 | Beate Bollig, Philipp Woelfel |
A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
read-once branching programs, computational complexity, lower bounds, integer multiplication |
| 1 | Beate Bollig |
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Approximability and Nonapproximability by Binary Decision Diagrams |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener |
On the complexity of the hidden weighted bit function for various BDD models. |
ITA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. |
Theory Comput. Syst. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener |
Hierarchy Theorems for kOBDDs and kIBDDs. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Completeness and Non-Completeness Results with Respect to Read-Once Projections. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Martin Löbbing, Ingo Wegener |
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Improving the Variable Ordering of OBDDs Is NP-Complete. |
IEEE Trans. Computers |
1996 |
DBLP DOI BibTeX RDF |
verification, NP-completeness, graph algorithms, Ordered binary decision diagrams, variable orderings |
| 1 | Beate Bollig, Ingo Wegener |
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig, Ingo Wegener |
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický |
On the Average Case Circuit Delay of Disjunction. |
Parallel Processing Letters |
1995 |
DBLP BibTeX RDF |
|
| 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) |
1994 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")