Skip to content
cs-conference-ranking.org

Beate Bollig

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

22

Venues

11

Active years

1996–2014

Best venue rank

A*

Where they publish

Papers

22 indexed papers, newest first.

YearVenueTitleAuthors
2014COCOAOn the Width of Ordered Binary Decision Diagrams.Beate Bollig
2014MFCSOn the Complexity of Some Ordering Problems.Beate Bollig
2012LATAAn Efficient Implicit OBDD-Based Algorithm for Maximal Matchings.Beate Bollig, Tobias Prger
2012TAMCImplicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations.Beate Bollig, Marc Gill, Tobias Prger
2011SOFSEMRandomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size.Beate Bollig, Marc Gill
2010COCOAOn Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem.Beate Bollig
2010LATINA Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication.Beate Bollig
2010MFCSExponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks.Beate Bollig
2010SOFSEMSymbolic OBDD-Based Reachability Analysis Needs Exponential Space.Beate Bollig
2009LATALarger Lower Bounds on the OBDD Complexity of Integer Multiplication.Beate Bollig
2009SOFSEMOn the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.Beate Bollig
2008ISAACNew Results on the Most Significant Bit of Integer Multiplication.Beate Bollig, Jochen Klump
2008SOFSEMExact OBDD Bounds for Some Fundamental Functions.Beate Bollig, Niko Range, Ingo Wegener
2008TAMCOn the OBDD Complexity of the Most Significant Bit of Integer Multiplication.Beate Bollig
2005FCTProperty Testing and the Branching Program Size of Boolean Functions.Beate Bollig
2003STACSComplexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs.Beate Bollig
2002MFCSA Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.Beate Bollig, Philipp Woelfel
2001STOCA read-once branching program lower bound of Omega(2Beate Bollig, Philipp Woelfel
2000ICALPAsymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.Beate Bollig, Ingo Wegener
2000MFCSRestricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.Beate Bollig
1997MFCSComplexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.Beate Bollig, Ingo Wegener
1996STACSRead-once Projections and Formal Circuit Verification with Binary Decision Diagrams.Beate Bollig, Ingo Wegener