The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Beate Bollig" ( http://dblp.L3S.de/Authors/Beate_Bollig )

URL (Homepage):  http://ls2-www.cs.uni-dortmund.de/~bollig/  Author page on DBLP  Author page in RDF  Community of Beate Bollig in ASPL-2

Publication years (Num. hits)
1994-2000 (19) 2001-2005 (15) 2006-2010 (21) 2011-2014 (15) 2016-2018 (3)
Publication types (Num. hits)
article(47) inproceedings(25) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 23 occurrences of 12 keywords

Results
Found 74 publication records. Showing 73 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Beate Bollig, Matthias Buttkus On the Relative Succinctness of Sentential Decision Diagrams. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Beate Bollig On the Minimization of (Complete) Ordered Binary Decision Diagrams. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Marc Bury On the OBDD representation of some graph classes. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the Minimization of (Complete) Ordered Binary Decision Diagrams. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Beate Bollig A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Tobias Pröger On efficient implicit OBDD-based algorithms for maximal matchings. Search on Bibsonomy Inf. Comput. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Marc Gillé, Tobias Pröger Implicit computation of maximum bipartite matchings by sublinear functional operations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the Width of Ordered Binary Decision Diagrams. Search on Bibsonomy COCOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the Complexity of Some Ordering Problems. Search on Bibsonomy MFCS (2) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Michael Capelle Priority functions for the approximation of the metric TSP. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Beate Bollig On symbolic OBDD-based algorithms for the minimum spanning tree problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Tobias Pröger An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. Search on Bibsonomy LATA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Marc Gillé, Tobias Pröger Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations. Search on Bibsonomy TAMC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Marc Gillé Randomized OBDDs for the most significant bit of multiplication need exponential space. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Beate Bollig Larger lower bounds on the OBDD complexity of integer multiplication. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Jochen Klump New Results on the Most Significant Bit of Integer Multiplication. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the OBDD complexity of the most significant bit of integer multiplication. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Marc Gillé Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Beate Bollig Exponential space complexity for OBDD-based reachability analysis. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Niko Range, Ingo Wegener Exact OBDD Bounds for Some Fundamental Functions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig Symbolic OBDD-Based Reachability Analysis Needs Exponential Space. Search on Bibsonomy SOFSEM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem. Search on Bibsonomy COCOA (2) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig On Symbolic Representations of Maximum Matchings and (Un)directed Graphs. Search on Bibsonomy IFIP TCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the size of (generalized) OBDDs for threshold functions. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Beate Bollig Integer Multiplicaton and the Complexity of Binary Decision Diagrams. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2009 DBLP  BibTeX  RDF
1Beate Bollig On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF variable ordering problem, Computational complexity, ordered binary decision diagrams, threshold functions
1Beate Bollig Larger Lower Bounds on the OBDD Complexity of Integer Multiplication. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the OBDD complexity of the most significant bit of integer multiplication. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Beate Bollig The optimal read-once branching program complexity for the direct storage access function. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Beate Bollig A note on the size of OBDDs for the graph of integer multiplication. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Niko Range, Ingo Wegener Exact OBDD Bounds for Some Fundamental Functions. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, ordered binary decision diagrams
1Beate Bollig, Jochen Klump New Results on the Most Significant Bit of Integer Multiplication. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Beate Bollig On the OBDD Complexity of the Most Significant Bit of Integer Multiplication. Search on Bibsonomy TAMC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, ordered binary decision diagrams, integer multiplication
1Beate Bollig, Niko Range, Ingo Wegener Exact OBDD Bounds for some Fundamental Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Beate Bollig The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Beate Bollig, Stephan Waack, Philipp Woelfel Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Beate Bollig Testing Membership in Formal Languages Implicitly Represented by Boolean Functions. Search on Bibsonomy J. UCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Beate Bollig A large lower bound on the query complexity of a simple boolean function. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Philipp Woelfel A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Beate Bollig Property Testing and the Branching Program Size of Boolean Functions. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Beate Bollig A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Functions that have read-once branching programs of quadratic size are not necessarily testable. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Beate Bollig Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. Search on Bibsonomy ITA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Beate Bollig Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Beate Bollig A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Philipp Woelfel A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Stephan Waack, Philipp Woelfel Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Search on Bibsonomy IFIP TCS The full citation details ... 2002 DBLP  BibTeX  RDF
1Beate Bollig, Philipp Woelfel, Stephan Waack Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Beate Bollig Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Search on Bibsonomy ITA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
1Beate Bollig, Philipp Woelfel A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF read-once branching programs, computational complexity, lower bounds, integer multiplication
1Beate Bollig, Ingo Wegener Approximability and Nonapproximability by Binary Decision Diagrams Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Beate Bollig Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Beate Bollig, Ingo Wegener Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Beate Bollig Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1Beate Bollig, Ingo Wegener Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener On the complexity of the hidden weighted bit function for various BDD models. Search on Bibsonomy ITA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Completeness and Non-Completeness Results with Respect to Read-Once Projections. Search on Bibsonomy Inf. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener Hierarchy Theorems for kOBDDs and kIBDDs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Beate Bollig Komplexitätsanalysen für BDD-artige Datenstrukturen. Search on Bibsonomy 1998   RDF
1Beate Bollig, Ingo Wegener Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Search on Bibsonomy MFCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Improving the Variable Ordering of OBDDs Is NP-Complete. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1996 DBLP  DOI  BibTeX  RDF verification, NP-completeness, graph algorithms, Ordered binary decision diagrams, variable orderings
1Beate Bollig, Martin Löbbing, Ingo Wegener On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Ingo Wegener Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1995 DBLP  BibTeX  RDF
1Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický On the Average Case Circuit Delay of Disjunction. Search on Bibsonomy Parallel Processing Letters The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener On the Power of Different Types of Restricted Branching Programs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1994 DBLP  BibTeX  RDF
Displaying result #1 - #73 of 73 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license