Ingo Wegener

Jonathan E. Rowe

Algorithmica, 2011

2010

Tight Bounds for Blind Search on the Integers and the Reals.

[BibT_eX]

[DOI]

Jonathan E. Rowe

Comb. Probab. Comput., 2010

Editorial.

[BibT_eX]

[DOI]

Benjamin Doerr

Algorithmica, 2010

Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Boolean Models and Methods in Mathematics, 2010

Circuit Complexity.

[BibT_eX]

[DOI]

Proceedings of the Boolean Models and Methods in Mathematics, 2010

2008

Tight Bounds for Blind Search on the Integers.

[BibT_eX]

[DOI]

Jonathan E. Rowe

Proceedings of the STACS 2008, 2008

Can Single-Objective Optimization Profit from Multiobjective Optimization?

[BibT_eX]

[DOI]

Proceedings of the Multiobjective Problem Solving from Nature, 2008

2007

Randomized local search, evolutionary algorithms, and the minimum spanning tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Exact OBDD Bounds for some Fundamental Functions.

[BibT_eX]

[DOI]

Niko Range

Electron. Colloquium Comput. Complex., 2007

New Results on the Complexity of the Middle Bit of Multiplication.

[BibT_eX]

[DOI]

Comput. Complex., 2007

Detecting high-order interactions of single nucleotide polymorphisms using genetic programming.

[BibT_eX]

[DOI]

Bioinform., 2007

2006

Modified repeated median filters.

[BibT_eX]

[DOI]

Stat. Comput., 2006

Minimum spanning trees made easier via multi-objective optimization.

[BibT_eX]

[DOI]

Nat. Comput., 2006

On the analysis of a dynamic evolutionary algorithm.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

On the local performance of simulated annealing and the (1+1) evolutionary algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Maximum cardinality matchings on trees by randomized local search.

[BibT_eX]

[DOI]

Oliver Giel

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2005

On converting CNF to DNF.

[BibT_eX]

[DOI]

Peter Bro Miltersen

Jaikumar Radhakrishnan

Theor. Comput. Sci., 2005

The one-dimensional Ising model: Mutation versus recombination.

[BibT_eX]

[DOI]

Simon Fischer

Theor. Comput. Sci., 2005

On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions.

[BibT_eX]

[DOI]

Carsten Witt

J. Discrete Algorithms, 2005

Rankings oder Ratings: Warum, wie und durch wen?.

[BibT_eX]

[DOI]

Inform. Spektrum, 2005

On the influence of the variable ordering for algorithmic learning using OBDDs.

[BibT_eX]

[DOI]

Matthias Krause

Inf. Comput., 2005

On the Choice of the Offspring Population Size in Evolutionary Algorithms.

[BibT_eX]

[DOI]

Kenneth A. De Jong

Evol. Comput., 2005

Real royal road functions--where crossover provably is essential.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics.

[BibT_eX]

[DOI]

Carsten Witt

Comb. Probab. Comput., 2005

Complexity theory - exploring the limits of efficient algorithms.

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-540-21045-0, 2005

2004

Real royal road functions for constant population size.

[BibT_eX]

[DOI]

Tobias Storch

Theor. Comput. Sci., 2004

The analysis of evolutionary algorithms on sorting and shortest paths problems.

[BibT_eX]

[DOI]

Jens Scharnow

Karsten Tinnefeld

J. Math. Model. Algorithms, 2004

Simulated Annealing Beats Metropolis in Combinatorial Optimization

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Searching Randomly for Maximum Matchings

[BibT_eX]

[DOI]

Oliver Giel

Electron. Colloquium Comput. Complex., 2004

BDDs--design, analysis, complexity, and applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2004

The Ising Model on the Ring: Mutation Versus Recombination.

[BibT_eX]

[DOI]

Simon Fischer

Proceedings of the Genetic and Evolutionary Computation, 2004

Randomized Search Heuristics as an Alternative to Exact Optimization.

[BibT_eX]

[DOI]

Proceedings of the Logic versus Approximation, 2004

2003

The analysis of a recombinative hill-climber on H-IFF.

[BibT_eX]

[DOI]

Bart Naudts

Clarissa Van Hoyweghen

IEEE Trans. Evol. Comput., 2003

Functions that have read-once branching programs of quadratic size are not necessarily testable.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

The Oberwolfach Meeting On Combinatorics, Probability And Computing.

[BibT_eX]

[DOI]

Béla Bollobás

Comb. Probab. Comput., 2003

Evolutionary Algorithms and the Maximum Matching Problem.

[BibT_eX]

[DOI]

Oliver Giel

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Towards a Theory of Randomized Search Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search.

[BibT_eX]

[DOI]

Carsten Witt

Proceedings of the Genetic and Evolutionary Computation, 2003

Komplexitätstheorie: Grenzen der Effizienz von Algorithmen

[BibT_eX]

[DOI]

Springer, ISBN: 3-540-00161-1, 2003

2002

Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

On the analysis of the (1+1) evolutionary algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

How to analyse evolutionary algorithms.

[BibT_eX]

[DOI]

Hans-Georg Beyer

Hans-Paul Schwefel

Theor. Comput. Sci., 2002

A simplified correctness proof for a well-known algorithm computing strongly connected components.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.

[BibT_eX]

[DOI]

Inform. Spektrum, 2002

On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs.

[BibT_eX]

[DOI]

Inf. Comput., 2002

The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.

[BibT_eX]

[DOI]

Algorithmica, 2002

Fitness Landscapes Based on Sorting and Shortest Paths Problems.

[BibT_eX]

[DOI]

Jens Scharnow

Karsten Tinnefeld

Proceedings of the Parallel Problem Solving from Nature, 2002

A New Framework for the Valuation of Algorithms for Black-Box Optimization.

[BibT_eX]

Proceedings of the Seventh Workshop on Foundations of Genetic Algorithms, 2002

2001

Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2001

A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs.

[BibT_eX]

[DOI]

Jawahar Jain

Masahiro Fujita

IEEE Trans. Computers, 2001

A Comparison of Free BDDs and Transformed BDDs.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2001

Teaching Nondeterminism as a Special Case of Randomization.

[BibT_eX]

[DOI]

Informatica Didact., 2001

Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools.

[BibT_eX]

[DOI]

Philipp Kersting

Informatica Didact., 2001

Theoretical Aspects of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000

Identification of Partial Disjunction, Parity, and Threshold Functions.

[BibT_eX]

[DOI]

Ryuhei Uehara

Kensei Tsuchida

Theor. Comput. Sci., 2000

Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

Worst case examples for operations on OBDDs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Approximability and Nonapproximability by Binary Decision Diagrams

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

Optimal ordered binary decision diagrams for read-once formulas.

[BibT_eX]

[DOI]

Ralph Werchner

Discret. Appl. Math., 2000

On the Expected Runtime and the Success Probability of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

On the Choice of the Mutation Probability for the (1+1) EA.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2000

Distributed Hybrid Genetic Programming for Learning Boolean Functions.

[BibT_eX]

[DOI]

Dominic Heutelbeck

Proceedings of the Parallel Problem Solving from Nature, 2000

Introduction: Workshop on Boolean Functions and Applications.

[BibT_eX]

Juraj Hromkovic

Proceedings of the ICALP Workshops 2000, 2000

Dynamic Parameter Control in Simple Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000

Analysis of composition complexity and how to obtain smaller canonical graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th Conference on Design Automation, 2000

Starthilfe Informatik, 2. Auflage

[BibT_eX]

[DOI]

Hans-Jürgen Appelrath

Dietrich Boles

Volker Claus

Vieweg+Teubner Verlag, ISBN: 978-3-519-10241-0, 2000

Branching Programs and Binary Decision Diagrams

[BibT_eX]

[DOI]

SIAM, ISBN: 0-89871-458-3, 2000

1999

Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1999

On the complexity of the hidden weighted bit function for various BDD models.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

On the performance of WEAK-HEAPSORT

[BibT_eX]

[DOI]

Stefan Edelkamp

Electron. Colloquium Comput. Complex., 1999

Approximations by OBDDs and the variable ordering problem

[BibT_eX]

[DOI]

Matthias Krause

Electron. Colloquium Comput. Complex., 1999

On the Cut-off Point for Combinatorial Group Testing.

[BibT_eX]

[DOI]

Paul Fischer

Norbert Klasner

Discret. Appl. Math., 1999

On P versus NP cap co-NP for decision trees and read-once branching programs.

[BibT_eX]

[DOI]

Stasys Jukna

Alexander A. Razborov

Comput. Complex., 1999

Relating Branching Program Size and Formula Size over the Full Binary Basis.

[BibT_eX]

[DOI]

Ralph Werchner

Proceedings of the STACS 99, 1999

Perhaps Not a Free Lunch But At Least a Free Appetizer.

[BibT_eX]

Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

Theoretische Informatik - eine algorithmenorientierte Einführung (2. Auflage)

[BibT_eX]

Teubner, ISBN: 3-519-12123-9, 1999

1998

Hierarchy Theorems for kOBDDs and kIBDDs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Parity OBDDs Cannot be Handled Efficiently Enough.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

A Very Simple Function that Requires Exponential Size Read-Once Branching Programs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Completeness and Non-Completeness Results with Respect to Read-Once Projections.

[BibT_eX]

[DOI]

Inf. Comput., 1998

The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours.

[BibT_eX]

[DOI]

Olaf Schröer

Formal Methods Syst. Des., 1998

A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs.

[BibT_eX]

[DOI]

Evol. Comput., 1998

On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 1998

Starthilfe Informatik

[BibT_eX]

Hans-Jürgen Appelrath

Dietrich Boles

Volker Claus

Teubner, ISBN: 3-519-00241-8, 1998

Starthilfe Informatik

[BibT_eX]

[DOI]

Hans-Jürgen Appelrath

Dietrich Boles

Volker Claus

Vieweg+Teubner Verlag, ISBN: 978-3-519-00241-3, 1998

1997

Bundeswettbewerb Informatik - Die Aufgaben der Endrunden 1996 und 1997.

[BibT_eX]

Bounds on the Number of Knight's Tours.

[BibT_eX]

[DOI]

Olaf Kyek

Ian Parberry

Discret. Appl. Math., 1997

Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams.

[BibT_eX]

[DOI]

Acta Informatica, 1997

On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.

[BibT_eX]

[DOI]

Stasys Jukna

Alexander A. Razborov

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

On the complexity of minimizing the OBDD size for incompletely specified functions.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

Improving the Variable Ordering of OBDDs Is NP-Complete.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1996

On the Complexity of Encoding in Analog Circuits.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Optimal attribute-efficient learning of disjunction, parity, and threshold functions

[BibT_eX]

[DOI]

Ryuhei Uehara

Kensei Tsuchida

Electron. Colloquium Comput. Complex., 1996

Optimal Ordered Binary Decision Diagrams for Tree-like Circuits

[BibT_eX]

[DOI]

Ralph Werchner

Electron. Colloquium Comput. Complex., 1996

The Number of Knight's Tours Equals 33, 439, 123, 484, 294 - Counting with Binary Decision Diagrams.

[BibT_eX]

[DOI]

Electron. J. Comb., 1996

Effiziente Algorithmen für grundlegende Funktionen (2. Auflage)

[BibT_eX]

[DOI]

Teubner, 1996

Kompendium Theoretische Informatik - eine Ideensammlung

[BibT_eX]

Teubner, ISBN: 3-519-02145-5, 1996

1995

Graph Driven BDDs - A New Data Structure for Boolean Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Didaktische Überlegungen zu einer algorithmenorientierten Einführung in die Theoretische Informatik.

[BibT_eX]

Inform. Spektrum, 1995

The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

1994

Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0.

[BibT_eX]

[DOI]

Inf. Comput., February, 1994

The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

Comments on "A Characterization of Binary Decision Diagrams".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

On the Power of Different Types of Restricted Branching Programs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1994

Efficient data structures for Boolean functions.

[BibT_eX]

[DOI]

Discret. Math., 1994

Solution of the knight's Hamiltonian path problem on chessboards.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

New Lower Bounds and Hierarchy Results for Restricted Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993

BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

NC-Algorithms for Operations on Binary Decision Diagrams.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Reduction of OBDDs in Linear Time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly.

[BibT_eX]

[DOI]

Comput. J., 1993

The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Theoretische Informatik - eine algorithmenorientierte Einführung.

[BibT_eX]

Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02123-0, 1993

1992

The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n

[BibT_eX]

[DOI]

Inf. Comput., March, 1992

Das Springerproblem.

[BibT_eX]

Jürg Nievergelt

Lutz Prechelt

Inform. Spektrum, 1992

How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates?

[BibT_eX]

J. Inf. Process. Cybern., 1992

1991

The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

The Conjunctive Complexity of Quadratic Boolean Functions.

[BibT_eX]

[DOI]

Katja Lenz

Theor. Comput. Sci., 1991

The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

1990

Efficient Simulation of Circuits by Erew Prams.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt.

[BibT_eX]

Inform. Spektrum, 1990

Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size.

[BibT_eX]

[DOI]

Norbert Wurm

Sang-Zin Yi

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple

[BibT_eX]

[DOI]

Bernd Voigt

Inf. Comput., October, 1989

A Note on the Relations Between Critical and Sensitive Complexity.

[BibT_eX]

László Zádori

J. Inf. Process. Cybern., 1989

Effiziente Algorithmen für grundlegende Funktionen.

[BibT_eX]

Leitfäden und Monographien der Informatik, Teubner, ISBN: 978-3-519-02276-3, 1989

1988

On the complexity of branching programs and decision trees for clique functions.

[BibT_eX]

[DOI]

J. ACM, 1988

Prime implicants and parallel complexity.

[BibT_eX]

Bull. EATCS, 1988

A Remark on Minimal Polynomials of Boolean Functions.

[BibT_eX]

[DOI]

Bernd Voigt

Proceedings of the CSL '88, 1988

1987

The Complexity of Symmetric Functions in Bounded-Depth Circuits.

[BibT_eX]

[DOI]

Bettina Brustmann

Inf. Process. Lett., 1987

The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits.

[BibT_eX]

J. Inf. Process. Cybern., 1987

The Complexity of Symmetric Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

The complexity of Boolean functions

[BibT_eX]

[DOI]

Wiley-Teubner, 1987

1986

More on the Complexity of Slice Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Properties of Complexity Measures for Prams and Wrams.

[BibT_eX]

[DOI]

Siegfried Bublitz

Ute Schürfeld

Theor. Comput. Sci., 1986

Time-Space Trade-offs for Branching Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1986

Nearly Optimal Hierarchies for Network and Formula Size.

[BibT_eX]

[DOI]

Mike Paterson

Acta Informatica, 1986

Properties of Complexity Measures for PRAMs and WRAMs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

On the Complexity of Slice Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Optimal Search With Positive Switch Cost is NP-Hard.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties

[BibT_eX]

[DOI]

Inf. Control., 1985

1984

Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions

[BibT_eX]

[DOI]

Inf. Control., 1984

Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions.

[BibT_eX]

Proceedings of the CAAP'84, 1984

1983

Relating Monotone Formula Size and Monotone Depth of Boolean Functions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

Proving lower bounds of the monotone complexity of Boolean functions.

[BibT_eX]

[DOI]

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1982

Boolean Functions whose Monotone Complexity is of Size n2/log n.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Discrete Sequential Search with Positive Switch Cost.

[BibT_eX]

[DOI]

Udo Lössner

Math. Oper. Res., 1982

Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1981

An Improved Complexity Hierarchy on the Depth of Boolean Functions.

[BibT_eX]

[DOI]

Acta Informatica, 1981

Boolean Functions Whose Monotone Complexity is of Size n2/log n.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

1980

The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities.

[BibT_eX]

[DOI]

Math. Oper. Res., 1980

A new Lower Bound on the Monotone Network Complexity of Boolean Sums.

[BibT_eX]

[DOI]

Acta Informatica, 1980

1979

A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

Switching Functions Whose Monotone Complexity is Nearly Quadratic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

On separating systems whose elements are sets of at most k elements.

[BibT_eX]

[DOI]