| Publication | Date of Publication | Type |
|---|
| New lower bounds and hierarchy results for restricted branching programs | 2024-01-05 | Paper |
| The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions | 2024-01-05 | Paper |
| Comments on "A characterization of binary decision diagrams" | 2018-09-14 | Paper |
| Read-once projections and formal circuit verification with binary decision diagrams | 2017-11-16 | Paper |
| Worst case examples for operations on OBDDs | 2016-06-16 | Paper |
| Parity OBDDs cannot be handled efficiently enough | 2016-06-09 | Paper |
| Switching functions whose monotone complexity | 2014-03-14 | Paper |
| Tight bounds for blind search on the integers | 2013-03-19 | Paper |
| Tight Bounds for Blind Search on the Integers and the Reals | 2013-03-13 | Paper |
| Precision, local search and unimodal functions | 2011-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081627 | 2011-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081628 | 2011-03-09 | Paper |
| Exact OBDD bounds for some fundamental functions | 2010-10-06 | Paper |
| Functions that have read-once branching programs of quadratic size are not necessarily testable | 2009-04-28 | Paper |
| Metropolis versus simulated annealing and the black-box-complexity of optimization problems | 2008-11-10 | Paper |
| Exact OBDD Bounds for Some Fundamental Functions | 2008-03-07 | Paper |
| New results on the complexity of the middle bit of multiplication | 2008-03-05 | Paper |
| On the analysis of a dynamic evolutionary algorithm | 2008-01-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation | 2007-10-25 | Paper |
| Randomized local search, evolutionary algorithms, and the minimum spanning tree problem | 2007-06-06 | Paper |
| Minimum spanning trees made easier via multi-objective optimization | 2007-01-25 | Paper |
| Upper and lower bounds for randomized search heuristics in black-box optimization | 2006-10-25 | Paper |
| A very simple function that requires exponential size read-once branching programs. | 2006-01-17 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| On converting CNF to DNF | 2005-12-29 | Paper |
| Logic versus Approximation | 2005-12-23 | Paper |
| The one-dimensional Ising model: mutation versus recombination | 2005-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708382 | 2005-11-17 | Paper |
| On the influence of the variable ordering for algorithmic learning using OBDDs | 2005-10-10 | Paper |
| Real royal road functions -- where crossover provably is essential | 2005-09-02 | Paper |
| The analysis of evolutionary algorithms on sorting and shortest paths problems | 2005-05-17 | Paper |
| On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions | 2005-05-04 | Paper |
| On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics | 2005-04-04 | Paper |
| Complexity Theory | 2005-01-12 | Paper |
| Real royal road functions for constant population size | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470521 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460348 | 2004-05-18 | Paper |
| BDDs -- design, analysis, complexity, and applications. | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449717 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436870 | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946959 | 2003-11-20 | Paper |
| The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions | 2003-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418669 | 2003-08-11 | Paper |
| Complexity theory. Limits of the efficiency of algorithms | 2003-07-02 | Paper |
| A simplified correctness proof for a well-known algorithm computing strongly connected components. | 2003-01-21 | Paper |
| How to analyse evolutionary algorithms. | 2003-01-21 | Paper |
| Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. | 2003-01-21 | Paper |
| On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs | 2003-01-14 | Paper |
| The analysis of evolutionary algorithms -- A proof that crossover really can help | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766663 | 2002-07-22 | Paper |
| On the analysis of the \((1+1)\) evolutionary algorithm | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535010 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331299 | 2002-05-15 | Paper |
| Optimal ordered binary decision diagrams for read-once formulas | 2002-04-21 | Paper |
| Dynamic parameter control in simple evolutionary algorithms | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754143 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728854 | 2001-11-06 | Paper |
| Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems | 2001-04-17 | Paper |
| A comparison of free BDDs and transformed BDDs | 2001-01-01 | Paper |
| On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs | 2000-11-20 | Paper |
| Efficient data structures for Boolean functions | 2000-07-04 | Paper |
| Branching Programs and Binary Decision Diagrams | 2000-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946045 | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938776 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835841 | 1999-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699308 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251042 | 1999-10-06 | Paper |
| On the Complexity of the Hidden Weighted Bit Function for Various BDD Models | 1999-09-22 | Paper |
| Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams | 1999-06-28 | Paper |
| On the cut-off point for combinatorial group testing | 1999-03-30 | Paper |
| Completeness and non-completeness results with respect to read-once projections | 1999-02-18 | Paper |
| Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4216333 | 1998-10-26 | Paper |
| Bounds on the number of knight's tours | 1998-03-01 | Paper |
| Efficient algorithms for the transformation between different types of binary decision diagrams | 1997-12-08 | Paper |
| Graph driven BDDs -- a new data structure for Boolean functions | 1997-02-28 | Paper |
| On the effect of local changes in the variable ordering of ordered decision diagrams | 1997-02-27 | Paper |
| On the complexity of encoding in analog circuits | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718221 | 1997-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885895 | 1996-11-04 | Paper |
| The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams | 1996-07-21 | Paper |
| Improving the variable ordering of OBDDs is NP-complete | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4855385 | 1995-11-12 | Paper |
| Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) | 1994-08-31 | Paper |
| Solution of the knight's Hamiltonian path problem on chessboards | 1994-06-08 | Paper |
| BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) | 1993-12-12 | Paper |
| Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions | 1993-08-08 | Paper |
| A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly | 1993-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036705 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035664 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3993546 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016932 | 1993-01-16 | Paper |
| Reduction of OBDDs in linear time | 1993-01-01 | Paper |
| The complexity of the parity function in unbounded fan-in, unbounded depth circuits | 1992-06-28 | Paper |
| The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) | 1992-06-28 | Paper |
| The conjunctive complexity of quadratic Boolean functions | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357542 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359743 | 1990-01-01 | Paper |
| Efficient simulation of circuits by EREW PRAMs | 1990-01-01 | Paper |
| Minimal polynomials for the conjunction of functions on disjoint variables can be very simple | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3031933 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3202956 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3807127 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3821577 | 1988-01-01 | Paper |
| On the complexity of branching programs and decision trees for clique functions | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3762226 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792452 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775483 | 1987-01-01 | Paper |
| The complexity of symmetric functions in bounded-depth circuits | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3757396 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782781 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4728250 | 1986-01-01 | Paper |
| Time-space trade-offs for branching programs | 1986-01-01 | Paper |
| Properties of complexity measures for PRAMs and WRAMs | 1986-01-01 | Paper |
| More on the complexity of slice functions | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686422 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691584 | 1985-01-01 | Paper |
| The critical complexity of all (monotone) boolean functions and monotone graph properties | 1985-01-01 | Paper |
| On the complexity of slice functions | 1985-01-01 | Paper |
| Optimal search with positive switch cost is NP-hard | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335688 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679109 | 1984-01-01 | Paper |
| Optimal decision trees and one-time-only branching programs for symmetric Boolean functions | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221885 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334079 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659518 | 1983-01-01 | Paper |
| Relating monotone formula size and monotone depth of Boolean functions | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770269 | 1982-01-01 | Paper |
| Boolean functions whose monotone complexity is of size \(n^ 2\) / log n | 1982-01-01 | Paper |
| The discrete search problem and the construction of optimal allocations | 1982-01-01 | Paper |
| Discrete Sequential Search with Positive Switch Cost | 1982-01-01 | Paper |
| Best possible asymptotic bounds on the depth of monotone functions in multivalued logic | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343922 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3905208 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912347 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916365 | 1981-01-01 | Paper |
| The construction of an optimal distribution of search effort | 1981-01-01 | Paper |
| An improved complexity hierarchy on the depth of Boolean functions | 1981-01-01 | Paper |
| The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities | 1980-01-01 | Paper |
| A new lower bound on the monotone network complexity of Boolean sums | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3861131 | 1979-01-01 | Paper |
| On separating systems whose elements are sets of at most k elements | 1979-01-01 | Paper |
| Switching functions whose monotone complexity is nearly quadratic | 1979-01-01 | Paper |
| A counterexample to a conjecture of Schnorr referring to monotone networks | 1979-01-01 | Paper |
