| Publication | Date of Publication | Type |
|---|
New lower bounds and hierarchy results for restricted branching programs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Comments on "A characterization of binary decision diagrams"
IEEE Transactions on Computers | 2018-09-14 | Paper |
Read-once projections and formal circuit verification with binary decision diagrams
STACS 96 | 2017-11-16 | Paper |
Worst case examples for operations on OBDDs
Information Processing Letters | 2016-06-16 | Paper |
Parity OBDDs cannot be handled efficiently enough
Information Processing Letters | 2016-06-09 | Paper |
Switching functions whose monotone complexity
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 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
Combinatorics, Probability and Computing | 2013-03-13 | Paper |
Precision, local search and unimodal functions
Algorithmica | 2011-03-30 | Paper |
Binary decision diagrams
| 2011-03-09 | Paper |
scientific article; zbMATH DE number 5862918 (Why is no real title available?)
| 2011-03-09 | Paper |
Exact OBDD bounds for some fundamental functions
Theory of Computing Systems | 2010-10-06 | Paper |
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters | 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
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
New results on the complexity of the middle bit of multiplication
Computational Complexity | 2008-03-05 | Paper |
On the analysis of a dynamic evolutionary algorithm
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
Theoretical Computer Science | 2007-10-25 | Paper |
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science | 2007-06-06 | Paper |
Minimum spanning trees made easier via multi-objective optimization
Natural Computing | 2007-01-25 | Paper |
Upper and lower bounds for randomized search heuristics in black-box optimization
Theory of Computing Systems | 2006-10-25 | Paper |
A very simple function that requires exponential size read-once branching programs.
Information Processing Letters | 2006-01-17 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On converting CNF to DNF
Theoretical Computer Science | 2005-12-29 | Paper |
Logic versus Approximation
Lecture Notes in Computer Science | 2005-12-23 | Paper |
The one-dimensional Ising model: mutation versus recombination
Theoretical Computer Science | 2005-12-05 | Paper |
scientific article; zbMATH DE number 2229972 (Why is no real title available?)
| 2005-11-17 | Paper |
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation | 2005-10-10 | Paper |
Real royal road functions -- where crossover provably is essential
Discrete Applied Mathematics | 2005-09-02 | Paper |
The analysis of evolutionary algorithms on sorting and shortest paths problems
JMMA. Journal of Mathematical Modelling and Algorithms | 2005-05-17 | Paper |
On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean functions
Journal of Discrete Algorithms | 2005-05-04 | Paper |
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing | 2005-04-04 | Paper |
Complexity Theory
| 2005-01-12 | Paper |
Real royal road functions for constant population size
Theoretical Computer Science | 2004-08-10 | Paper |
scientific article; zbMATH DE number 2077136 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 2065676 (Why is no real title available?)
| 2004-05-18 | Paper |
BDDs -- design, analysis, complexity, and applications.
Discrete Applied Mathematics | 2004-03-29 | Paper |
scientific article; zbMATH DE number 2040661 (Why is no real title available?)
| 2004-02-11 | Paper |
scientific article; zbMATH DE number 2013513 (Why is no real title available?)
| 2003-12-04 | Paper |
scientific article; zbMATH DE number 1423227 (Why is no real title available?)
| 2003-11-20 | Paper |
The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
IEEE Transactions on Computers | 2003-10-16 | Paper |
scientific article; zbMATH DE number 1962832 (Why is no real title available?)
| 2003-08-11 | Paper |
Complexity theory. Limits of the efficiency of algorithms
Springer-Lehrbuch | 2003-07-02 | Paper |
A simplified correctness proof for a well-known algorithm computing strongly connected components.
Information Processing Letters | 2003-01-21 | Paper |
How to analyse evolutionary algorithms.
Theoretical Computer Science | 2003-01-21 | Paper |
Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
Theoretical Computer Science | 2003-01-21 | Paper |
On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
Information and Computation | 2003-01-14 | Paper |
The analysis of evolutionary algorithms -- A proof that crossover really can help
Algorithmica | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1696516 (Why is no real title available?)
| 2002-07-22 | Paper |
On the analysis of the \((1+1)\) evolutionary algorithm
Theoretical Computer Science | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1754585 (Why is no real title available?)
| 2002-06-12 | Paper |
scientific article; zbMATH DE number 1741104 (Why is no real title available?)
| 2002-05-15 | Paper |
Optimal ordered binary decision diagrams for read-once formulas
Discrete Applied Mathematics | 2002-04-21 | Paper |
Dynamic parameter control in simple evolutionary algorithms
| 2002-02-28 | Paper |
scientific article; zbMATH DE number 1670823 (Why is no real title available?)
| 2001-12-09 | Paper |
scientific article; zbMATH DE number 1629827 (Why is no real title available?)
| 2001-11-06 | Paper |
Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
Journal of Computer and System Sciences | 2001-04-17 | Paper |
A comparison of free BDDs and transformed BDDs
Formal Methods in System Design | 2001-01-01 | Paper |
On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
Computational Complexity | 2000-11-20 | Paper |
Efficient data structures for Boolean functions
Discrete Mathematics | 2000-07-04 | Paper |
Branching Programs and Binary Decision Diagrams
| 2000-06-18 | Paper |
scientific article; zbMATH DE number 1421023 (Why is no real title available?)
| 2000-03-22 | Paper |
scientific article; zbMATH DE number 1405791 (Why is no real title available?)
| 2000-02-23 | Paper |
scientific article; zbMATH DE number 1371320 (Why is no real title available?)
| 1999-11-29 | Paper |
scientific article; zbMATH DE number 1361490 (Why is no real title available?)
| 1999-11-10 | Paper |
scientific article; zbMATH DE number 1304312 (Why is no real title available?)
| 1999-10-06 | Paper |
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
RAIRO - Theoretical Informatics and Applications | 1999-09-22 | Paper |
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
Theory of Computing Systems | 1999-06-28 | Paper |
On the cut-off point for combinatorial group testing
Discrete Applied Mathematics | 1999-03-30 | Paper |
Completeness and non-completeness results with respect to read-once projections
Information and Computation | 1999-02-18 | Paper |
Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1214915 (Why is no real title available?)
| 1998-10-26 | Paper |
Bounds on the number of knight's tours
Discrete Applied Mathematics | 1998-03-01 | Paper |
Efficient algorithms for the transformation between different types of binary decision diagrams
Acta Informatica | 1997-12-08 | Paper |
Graph driven BDDs -- a new data structure for Boolean functions
Theoretical Computer Science | 1997-02-28 | Paper |
On the effect of local changes in the variable ordering of ordered decision diagrams
Information Processing Letters | 1997-02-27 | Paper |
On the complexity of encoding in analog circuits
Information Processing Letters | 1997-02-27 | Paper |
scientific article; zbMATH DE number 953276 (Why is no real title available?)
| 1997-01-29 | Paper |
scientific article; zbMATH DE number 910733 (Why is no real title available?)
| 1996-11-04 | Paper |
The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
The Electronic Journal of Combinatorics | 1996-07-21 | Paper |
Improving the variable ordering of OBDDs is NP-complete
IEEE Transactions on Computers | 1996-01-01 | Paper |
scientific article; zbMATH DE number 814908 (Why is no real title available?)
| 1995-11-12 | Paper |
Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
Information and Computation | 1994-08-31 | Paper |
Solution of the knight's Hamiltonian path problem on chessboards
Discrete Applied Mathematics | 1994-06-08 | Paper |
BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
Theoretical Computer Science | 1993-12-12 | Paper |
Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
Information Processing Letters | 1993-08-08 | Paper |
A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly
The Computer Journal | 1993-08-08 | Paper |
scientific article; zbMATH DE number 176874 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176500 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 44419 (Why is no real title available?)
| 1993-01-23 | Paper |
scientific article; zbMATH DE number 89639 (Why is no real title available?)
| 1993-01-16 | Paper |
Reduction of OBDDs in linear time
Information Processing Letters | 1993-01-01 | Paper |
The complexity of the parity function in unbounded fan-in, unbounded depth circuits
Theoretical Computer Science | 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\)
Information and Computation | 1992-06-28 | Paper |
The conjunctive complexity of quadratic Boolean functions
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4209604 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4213429 (Why is no real title available?)
| 1990-01-01 | Paper |
Efficient simulation of circuits by EREW PRAMs
Information Processing Letters | 1990-01-01 | Paper |
Minimal polynomials for the conjunction of functions on disjoint variables can be very simple
Information and Computation | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4130025 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4179291 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4074972 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4094807 (Why is no real title available?)
| 1988-01-01 | Paper |
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4012495 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4057247 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4035741 (Why is no real title available?)
| 1987-01-01 | Paper |
The complexity of symmetric functions in bounded-depth circuits
Information Processing Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4007722 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4045149 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4003532 (Why is no real title available?)
| 1986-01-01 | Paper |
Time-space trade-offs for branching programs
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Properties of complexity measures for PRAMs and WRAMs
Theoretical Computer Science | 1986-01-01 | Paper |
More on the complexity of slice functions
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3910122 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3916178 (Why is no real title available?)
| 1985-01-01 | Paper |
The critical complexity of all (monotone) boolean functions and monotone graph properties
Information and Control | 1985-01-01 | Paper |
On the complexity of slice functions
Theoretical Computer Science | 1985-01-01 | Paper |
Optimal search with positive switch cost is NP-hard
Information Processing Letters | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3867233 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3900678 (Why is no real title available?)
| 1984-01-01 | Paper |
Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
Information and Control | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3889430 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3866582 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3811301 (Why is no real title available?)
| 1983-01-01 | Paper |
Relating monotone formula size and monotone depth of Boolean functions
Information Processing Letters | 1983-01-01 | Paper |
scientific article; zbMATH DE number 4029246 (Why is no real title available?)
| 1982-01-01 | Paper |
Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
Theoretical Computer Science | 1982-01-01 | Paper |
The discrete search problem and the construction of optimal allocations
Naval Research Logistics Quarterly | 1982-01-01 | Paper |
Discrete Sequential Search with Positive Switch Cost
Mathematics of Operations Research | 1982-01-01 | Paper |
Best possible asymptotic bounds on the depth of monotone functions in multivalued logic
Information Processing Letters | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3878849 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3715453 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3724203 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3728011 (Why is no real title available?)
| 1981-01-01 | Paper |
The construction of an optimal distribution of search effort
Naval Research Logistics Quarterly | 1981-01-01 | Paper |
An improved complexity hierarchy on the depth of Boolean functions
Acta Informatica | 1981-01-01 | Paper |
The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities
Mathematics of Operations Research | 1980-01-01 | Paper |
A new lower bound on the monotone network complexity of Boolean sums
Acta Informatica | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3662840 (Why is no real title available?)
| 1979-01-01 | Paper |
On separating systems whose elements are sets of at most k elements
Discrete Mathematics | 1979-01-01 | Paper |
Switching functions whose monotone complexity is nearly quadratic
Theoretical Computer Science | 1979-01-01 | Paper |
A counterexample to a conjecture of Schnorr referring to monotone networks
Theoretical Computer Science | 1979-01-01 | Paper |
