The following pages link to Beate Bollig (Q171934):
Displaying 50 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- Larger lower bounds on the OBDD complexity of integer multiplication (Q553298) (← links)
- On the effect of local changes in the variable ordering of ordered decision diagrams (Q671612) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- The optimal read-once branching program complexity for the direct storage access function (Q963361) (← links)
- A note on the size of OBDDs for the graph of integer multiplication (Q975522) (← links)
- On the size of (generalized) OBDDs for threshold functions (Q987805) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- A large lower bound on the query complexity of a simple Boolean function (Q1041802) (← links)
- Completeness and non-completeness results with respect to read-once projections (Q1271310) (← links)
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs (Q1275068) (← links)
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553) (← links)
- Exponential space complexity for OBDD-based reachability analysis (Q1675755) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Randomized OBDDs for the most significant bit of multiplication need exponential space (Q1944061) (← links)
- Exact OBDD bounds for some fundamental functions (Q1959388) (← links)
- On the relation between structured \(d\)-DNNFs and SDDs (Q2035477) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- New results on the most significant bit of integer multiplication (Q2429728) (← links)
- On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (Q2581005) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- (Q2754143) (← links)
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication (Q2771493) (← links)
- An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings (Q2890187) (← links)
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059) (← links)
- On the Complexity of Some Ordering Problems (Q2922601) (← links)
- On the Width of Ordered Binary Decision Diagrams (Q2942417) (← links)
- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem (Q3066440) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- (Q3081627) (← links)
- On Symbolic Representations of Maximum Matchings and (Un)directed Graphs (Q3163890) (← links)
- (Q3397629) (← links)
- Symbolic OBDD-Based Reachability Analysis Needs Exponential Space (Q3401094) (← links)
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656) (← links)
- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication (Q3557025) (← links)
- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks (Q3586083) (← links)
- New Results on the Most Significant Bit of Integer Multiplication (Q3597887) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (Q3618582) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)
- (Q4418658) (← links)
