Ingo Wegener

发表

Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness

Thomas Jansen, Ingo Wegener, I. Wegener, 2001 .

Graph Driven BDDs - A New Data Structure for Boolean Functions

Ingo Wegener, Detlef Sieling, I. Wegener, 1995, Theor. Comput. Sci..

UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Expected Runtime and the Success Probability of Evolutionary Algorithms

Ingo Wegener, I. Wegener, 2001 .

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

Ingo Wegener, 1987, J. Inf. Process. Cybern..

On the Expected Runtime and the Success Probability of Evolutionary Algorithms

Ingo Wegener, 2000 .

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

Ingo Wegener, Norbert Wurm, Sang-Zin Yi, 1990, MFCS.

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

Ingo Wegener, Martin Löbbing, I. Wegener, 1996, Electron. J. Comb..

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

Thomas Jansen, Ingo Wegener, I. Wegener, 2006, GECCO.

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

Beate Bollig, Ingo Wegener, I. Wegener, 2000, J. Comput. Syst. Sci..

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

Beate Bollig, Ingo Wegener, 2000, J. Comput. Syst. Sci..

Time-Space Trade-offs for Branching Programs

Ingo Wegener, I. Wegener, 1986, J. Comput. Syst. Sci..

The Conjunctive Complexity of Quadratic Boolean Functions

Ingo Wegener, Katja Lenz, 1991, Theor. Comput. Sci..

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

Ingo Wegener, I. Wegener, 1981, Theoretical Computer Science.

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

Alexander A. Razborov, Ingo Wegener, Stasys Jukna, 1997, computational complexity.

Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms

Kenneth A. De Jong, Ingo Wegener, Thomas Jansen, 2004 .

Identification of Partial Disjunction, Parity, and Threshold Functions

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener, 2000, Theor. Comput. Sci..

Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams

Beate Bollig, Ingo Wegener, 1997, MFCS.

On the Complexity of Encoding in Analog Circuits

Ingo Wegener, 1996, Inf. Process. Lett..

Search Problems

Rudolf Ahlswede, Ingo Wegener, R. Ahlswede, 1987 .

Switching Functions Whose Monotone Complexity is Nearly Quadratic

Ingo Wegener, I. Wegener, 1979, Theor. Comput. Sci..

Complexity Theory

Ingo Wegener, I. Wegener, 2005 .

Efficient data structures for Boolean functions

Ingo Wegener, 1994, Discret. Math..

A Comparison of Free BDDs and Transformed BDDs

Ingo Wegener, Detlef Sieling, I. Wegener, 2001, Formal Methods Syst. Des..

Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions

Ingo Wegener, I. Wegener, 2003 .

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

Ingo Wegener, I. Wegener, 1990, MFCS.

Evolutionary Algorithms and the Maximum Matching Problem

Ingo Wegener, Oliver Giel, I. Wegener, 2003, STACS.

Rankings oder Ratings: Warum, wie und durch wen?

Ingo Wegener, 2005, Informatik-Spektrum.

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

Beate Bollig, Ingo Wegener, Martin Sauerhoff, 1999, RAIRO Theor. Informatics Appl..

The analysis of evolutionary algorithms on sorting and shortest paths problems

Ingo Wegener, Jens Scharnow, Karsten Tinnefeld, 2004, J. Math. Model. Algorithms.

Theory of Evolutionary Algorithms and Genetic Programming

Thomas Jansen, Günter Rudolph, Hans-Paul Schwefel, 2003 .

Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener, 1997, EuroCOLT.

Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, 2006, ICALP.

On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help

Thomas Jansen, Ingo Wegener, I. Wegener, 1999 .

Reduction of OBDDs in Linear Time

Ingo Wegener, Detlef Sieling, I. Wegener, 1993, Inf. Process. Lett..

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

Thomas Jansen, Ingo Wegener, Stefan Droste, 2002, FOGA.

Precision, Local Search and Unimodal Functions

Martin Dietzfelbinger, Ingo Wegener, Philipp Woelfel, 2008, GECCO '08.

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

Ingo Wegener, 1993, Theor. Comput. Sci..

Exact OBDD Bounds for Some Fundamental Functions

Beate Bollig, Ingo Wegener, Niko Range, 2009, Theory of Computing Systems.

Fitness Landscapes Based on Sorting and Shortest Paths Problems

Ingo Wegener, Jens Scharnow, Karsten Tinnefeld, 2002, PPSN.

The Oberwolfach Meeting On Combinatorics, Probability And Computing

Béla Bollobás, Ingo Wegener, 2003, Comb. Probab. Comput..

9. Integer-Valued DDs

Ingo Wegener, 2000 .

Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem

Frank Neumann, Ingo Wegener, 2004, GECCO.

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

Ingo Wegener, 1981, Theoretical Computer Science.

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

Ingo Wegener, 1992, Inf. Comput..

A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks

Ingo Wegener, 1979, Theor. Comput. Sci..

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

Martin Dietzfelbinger, Ingo Wegener, Bart Naudts, 2003, IEEE Trans. Evol. Comput..

Automata, Languages and Programming

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, 1998, Lecture Notes in Computer Science.

Prime implicants and parallel complexity

Ingo Wegener, 1988, Bull. EATCS.

11. Randomized BDDs and Algorithms

Ingo Wegener, 2000 .

Dynamic Parameter Control in Simple Evolutionary Algorithms

Thomas Jansen, Ingo Wegener, Stefan Droste, 2001, FOGA.

On the Cut-off Point for Combinatorial Group Testing

Ingo Wegener, Paul Fischer, Norbert Klasner, 1999, Discret. Appl. Math..

Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Choice of the Mutation Probability for the ( 1 + 1 ) EA

Thomas Jansen, Ingo Wegener, Thomas Jansen, 2006 .

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

Ingo Wegener, 1991, Theor. Comput. Sci..

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

Johan Håstad, Ingo Wegener, Norbert Wurm, 1994, Inf. Comput..

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

Beate Bollig, Ingo Wegener, 2003, Inf. Process. Lett..

Komplexitätstheorie, effiziente Algorithmen und die Bundesliga

Ingo Wegener, Thomas Hofmeister, Thorsten Bernholt, 2002, Informatik-Spektrum.

Effiziente Algorithmen für grundlegende Funktionen

Ingo Wegener, 1989, Leitfäden und Monographien der Informatik.

Comments on "A Characterization of Binary Decision Diagrams"

Ingo Wegener, 1994, IEEE Trans. Computers.

5. The Variable-Ordering Problem

Ingo Wegener, 2000 .

Can Single-Objective Optimization Profit from Multiobjective Optimization?

Ingo Wegener, Frank Neumann, I. Wegener, 2008, Multiobjective Problem Solving from Nature.

Optimal ordered binary decision diagrams for read-once formulas

Ingo Wegener, Martin Sauerhoff, Ralph Werchner, 2000, Discret. Appl. Math..

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

Alexander A. Razborov, Ingo Wegener, Stasys Jukna, 1997, MFCS.

Optimal Ordered Binary Decision Diagrams for Tree-like Circuits

Ingo Wegener, Martin Sauerhoff, Ralph Werchner, 1996, Electron. Colloquium Comput. Complex..

Real royal road functions for constant population size

Ingo Wegener, Tobias Storch, I. Wegener, 2003, Theor. Comput. Sci..

On the Complexity of Branching Programs and Decision Trees for Clique Functions

Ingo Wegener, 1987, TAPSOFT, Vol.1.

Parity OBDDs Cannot be Handled Efficiently Enough

Ingo Wegener, Detlef Sieling, Martin Löbbing, 1998, Inf. Process. Lett..

Improving the Variable Ordering of OBDDs Is NP-Complete

Beate Bollig, Ingo Wegener, I. Wegener, 1996, IEEE Trans. Computers.

Analysis of composition complexity and how to obtain smaller canonical graphs

Yuan Lu, Ingo Wegener, Jawahar Jain, 2000, Proceedings 37th Design Automation Conference.

Towards a Theory of Randomized Search Heuristics

Ingo Wegener, I. Wegener, 2003, MFCS.

The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities

Ingo Wegener, 1980, Math. Oper. Res..

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

Ingo Wegener, I. Wegener, 1993, Inf. Process. Lett..

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

Thomas Jansen, Ingo Wegener, Stefan Droste, 2002, Theor. Comput. Sci..

Distributed Hybrid Genetic Programming for Learning Boolean Functions

Dominic Heutelbeck, Ingo Wegener, Stefan Droste, 2000, PPSN.

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

Ingo Wegener, Olaf Schröer, I. Wegener, 1998, Formal Methods Syst. Des..

Nearly optimal hierarchies for network and formula size

Ingo Wegener, Mike Paterson, 2004, Acta Informatica.

14. Further CAD Applications

Ingo Wegener, 2000 .

A Note on the Relations Between Critical and Sensitive Complexity

Ingo Wegener, László Zádori, 1989, J. Inf. Process. Cybern..

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

Thomas Jansen, Ingo Wegener, Stefan Droste, 1998, PPSN.

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

Ingo Wegener, Martin Sauerhoff, Ralph Werchner, 1999, STACS.

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

Ingo Wegener, Frank Neumann, I. Wegener, 2004, Theor. Comput. Sci..

New Results on the Complexity of the Middle Bit of Multiplication

Ingo Wegener, Philipp Woelfel, 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs

Beate Bollig, Ingo Wegener, Martin Sauerhoff, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Modified repeated median filters

Ingo Wegener, Ursula Gather, Roland Fried, 2006, Stat. Comput..

Bounds on the Number of Knight's Tours

Ingo Wegener, Ian Parberry, Olaf Kyek, 1997, Discret. Appl. Math..

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

Ingo Wegener, I. Wegener, 1979, Discret. Math..

Switching functions whose monotone complexity

Ingo Wegener, 1978, STOC '78.

Real royal road functions--where crossover provably is essential

Ingo Wegener, Thomas Jansen, I. Wegener, 2001, Discret. Appl. Math..

Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II

Michele Bugliesi, Bart Preneel, Ingo Wegener, 2006, ICALP.

New Results on the Complexity of the Middle Bit of Multiplication

Ingo Wegener, Philipp Woelfel, 2005, Computational Complexity Conference.

Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, 2006 .

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes

Thomas Jansen, Dirk Sudholt, Ingo Wegener, 2004, PPSN.

Efficient algorithms for the transformation between different types of binary decision diagrams

Ingo Wegener, Petr Savický, 1997, Acta Informatica.

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

Thomas Jansen, Ingo Wegener, I. Wegener, 2007, Theor. Comput. Sci..

On converting CNF to DNF

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, 2005, Theor. Comput. Sci..

Tight Bounds for Blind Search on the Integers and the Reals

Martin Dietzfelbinger, Ingo Wegener, Philipp Woelfel, 2008, Combinatorics, Probability and Computing.

On the utility of populations in evolutionary algorithms

Ingo Wegener, Thomas Jansen, I. Wegener, 2001 .

An improved complexity hierarchy on the depth of Boolean functions

Ingo Wegener, 2004, Acta Informatica.

Worst case examples for operations on OBDDs

Ingo Wegener, I. Wegener, 2000, Inf. Process. Lett..

On the Power of Different Types of Restricted Branching Programs

Beate Bollig, Ingo Wegener, Detlef Sieling, 1994, Electron. Colloquium Comput. Complex..

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

Ingo Wegener, 1993, WG.

GECCO 2007: Genetic and Evolutionary Computation Conference

Thomas Stützle, Riccardo Poli, Mauro Birattari, 2007 .

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

Ingo Wegener, Philipp Kersting, 2001, Informatica Didact..

A new lower bound on the monotone network complexity of Boolean sums

Ingo Wegener, I. Wegener, 1980, Acta Informatica.

On the Performance of WEAK-HEAPSORT

Ingo Wegener, Stefan Edelkamp, S. Edelkamp, 2000, STACS.

On converting CNF to DNF

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, 2003, Theor. Comput. Sci..

Introduction: Workshop on Boolean Functions and Applications

Juraj Hromkovic, Ingo Wegener, I. Wegener, 2000, ICALP Satellite Workshops.

Starthilfe Informatik, 2. Auflage

Hans-Jürgen Appelrath, Volker Claus, Ingo Wegener, 2000 .

Simulated Annealing Beats Metropolis in Combinatorial Optimization

Ingo Wegener, I. Wegener, 2005, ICALP.

More on the Complexity of Slice Functions

Ingo Wegener, I. Wegener, 1986, Theor. Comput. Sci..

Maximum cardinality matchings on trees by randomized local search

Ingo Wegener, Oliver Giel, 2006, GECCO '06.

Improved washing and cleaning agents for textiles (ii)

Ingo Wegener, Alfred Dr Meffert, Andreas Dr Syldatk, 1987 .

New Lower Bounds and Hierarchy Results for Restricted Branching Programs

Ingo Wegener, Detlef Sieling, 1994, WG.

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

Ingo Wegener, Martin Sauerhoff, 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Minimum spanning trees made easier via multi-objective optimization

Frank Neumann, Ingo Wegener, I. Wegener, 2005, GECCO '05.

Advances in Computational Intelligence: Theory and Practice

Hans-Paul Schwefel, Ingo Wegener, Klaus Weinert, 2002 .

Real Royal Road Functions for Constant Population Size

Ingo Wegener, Tobias Storch, 2003, GECCO.

Complexity theory - exploring the limits of efficient algorithms

Ingo Wegener, I. Wegener, 2005 .

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

Ingo Wegener, I. Wegener, 1988, JACM.

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

Ingo Wegener, 1985, Inf. Control..

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

Ingo Wegener, Matthias Krause, Petr Savický, 2005, Inf. Comput..

NC-Algorithms for Operations on Binary Decision Diagrams

Ingo Wegener, Detlef Sieling, 1993, Parallel Process. Lett..

Starthilfe Informatik

Hans-Jürgen Appelrath, Volker Claus, Ingo Wegener, 1998, Starthilfe Informatik.

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

Beate Bollig, Ingo Wegener, I. Wegener, 1998, Inf. Process. Lett..

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

Ingo Wegener, I. Wegener, 2002, Inf. Process. Lett..

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

Ingo Wegener, 1994, IEEE Trans. Computers.

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

Ingo Wegener, 1993, Comput. J..

Teaching Nondeterminism as a Special Case of Randomization

Ingo Wegener, 2001, Informatica Didact..

The Complexity of Symmetric Functions in Bounded-Depth Circuits

Ingo Wegener, Bettina Brustmann, 1987, Inf. Process. Lett..

Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams

Beate Bollig, Ingo Wegener, I. Wegener, 1997, Theory of Computing Systems.

Solution of the knight's Hamiltonian path problem on chessboards

Ingo Wegener, Axel Conrad, Tanja Hindrichs, 1994, Discret. Appl. Math..

On the Analysis of Evolutionary Algorithms

Ingo Wegener, Thomas Jansen, 2001 .

Kompendium Theoretische Informatik - eine Ideensammlung

Ingo Wegener, Ingo Wegener, I. Wegener, 1996 .

Bottom-up-heat sort, a new variant of heap sort beating an average quick sort

Ingo Wegener, I. Wegener, 1990 .

Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II (Lecture Notes in Computer Science)

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, 2006 .

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

Thomas Jansen, Dirk Sudholt, Ingo Wegener, 2004, PPSN.

The critical complexity of all (monotone) Boolean functions and monotone graph properties

Ingo Wegener, 1985, FCT.

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

Ingo Wegener, Petr Savický, 1994, FSTTCS.

Optimal Ordered Binary Decision Diagrams for Fanout-Free Circuits

Ingo Wegener, Martin Sauerhoff, Ralph Werchner, 1996 .

Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer

Thomas Jansen, Ingo Wegener, Stefan Droste, 2022 .

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

Ingo Wegener, I. Wegener, 1990, Informatik-Spektrum.

On the Complexity of Slice Functions

Ingo Wegener, I. Wegener, 1984, Theor. Comput. Sci..

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

Ingo Wegener, Bernd Voigt, 1989, Inf. Comput..

Branching Programs and Binary Decision Diagrams

Ingo Wegener, I. Wegener, 1987 .

Proving lower bounds of the monotone complexity of Boolean functions

Ingo Wegener, I. Wegener, 1983, Logic and Machines.

Efficient Simulation of Circuits by Erew Prams

Ingo Wegener, 1990, Inf. Process. Lett..

Genetic and Evolutionary Computation Conference 2008 : GECCO 2008

Julian F. Miller, Giuliano Antoniol, Maarten Keijzer, 2008, GECCO 2008.

The Ising Model on the Ring: Mutation Versus Recombination

Ingo Wegener, Simon Fischer, 2004, GECCO.

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

Ingo Wegener, Carsten Witt, I. Wegener, 2005, J. Discrete Algorithms.

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

Ingo Wegener, Thomas Jansen, Stefan Droste, 1998, Evolutionary Computation.

Numbers, information and complexity

András Sárközy, Ingo Wegener, Zhen Zhang, 2000 .

8. Decision Diagrams (DDs) Based on Other Decomposition Rules

Ingo Wegener, 2000 .

Precision, local search and unimodal functions

Martin Dietzfelbinger, Ingo Wegener, Philipp Woelfel, 2008, GECCO.

Textile detergents and cleaners

Ingo Wegener, Alfred Dr Meffert, Andreas Dr Syldatk, 1986 .

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

Thomas Jansen, Ingo Wegener, Stefan Droste, 2002, Theor. Comput. Sci..

Approximations by OBDDs and the Variable Ordering Problem

Ingo Wegener, Matthias Krause, Petr Savický, 1999, ICALP.

On the analysis of a dynamic evolutionary algorithm

Thomas Jansen, Ingo Wegener, I. Wegener, 2006, J. Discrete Algorithms.

13. Applications in Verification and Model Checking

Ingo Wegener, I. Wegener, 2000 .

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

Ingo Wegener, Carsten Witt, I. Wegener, 2005, Combinatorics, Probability and Computing.

Advances in computational intelligence : :theory and practice/ Hans-Paul Schwefel, Ingo Wegener, Klaus Weinert

Hans-Paul Schwefel, Ingo Wegener, Klaus Weinert, 2002 .

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

Beate Bollig, Ingo Wegener, Martin Löbbing, 1996, Inf. Process. Lett..

Theoretical Aspects of Evolutionary Algorithms

Ingo Wegener, I. Wegener, 2001, ICALP.

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

Beate Bollig, Ingo Wegener, I. Wegener, 1998, Inf. Comput..

15. Applications in Optimization, Counting, and Genetic Programming

Ingo Wegener, 2000 .

Refrigerant circuit compact unit for a motor vehicle

Ingo Wegener, Makoto Ikegami, 2014 .

The complexity of Boolean functions

Ingo Wegener, I. Wegener, 1987 .

Optimal Search With Positive Switch Cost is NP-Hard

Ingo Wegener, 1985, Inf. Process. Lett..

The Conjunctive Complexity of Quadratic Boolean Functions

Ingo Wegener, Katja Lenz, 1987, CSL.

The Complexity of Symmetric Boolean Functions

Ingo Wegener, I. Wegener, 1987, Computation Theory and Logic.

Searching Randomly for Maximum Matchings

Ingo Wegener, Oliver Giel, I. Wegener, 2004, Electron. Colloquium Comput. Complex..

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

Beate Bollig, Ingo Wegener, Martin Sauerhoff, 2002, Inf. Comput..

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

Ingo Wegener, 1996 .

3. Ordered Binary Decision Diagrams (OBDDs)

Ingo Wegener, 2000 .

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

Ingo Wegener, I. Wegener, 1984, CAAP.

Communication Complexity and BDD Lower Bound Techniques

Ingo Wegener, I. Wegener, 2000 .

Approximability and Nonapproximability by Binary Decision Diagrams

Beate Bollig, Ingo Wegener, 2000, Electron. Colloquium Comput. Complex..

Introduction to Evolutionary Computing

Hans-Paul Schwefel, Ingo Wegener, Klaus Weinert, 2004, Natural Computing Series.

Das Springerproblem

Ingo Wegener, Jürg Nievergelt, Lutz Prechelt, 1992, Inform. Spektrum.

Properties of Complexity Measures for PRAMs and WRAMs

Ingo Wegener, Bernd Voigt, Siegfried Bublitz, 1986, MFCS.

Metropolis Versus Simulated Annealing and the Black-Box-Complexity of Optimization Problems

Ingo Wegener, 2008 .

BDDs--design, analysis, complexity, and applications

Ingo Wegener, I. Wegener, 2004, Discret. Appl. Math..

Discrete Sequential Search with Positive Switch Cost

Ingo Wegener, Udo Lössner, 1982, Math. Oper. Res..

Tight Bounds for Blind Search on the Integers and the Reals

Martin Dietzfelbinger, Ingo Wegener, Philipp Woelfel, 2010, Comb. Probab. Comput..

Exact OBDD Bounds for Some Fundamental Functions

Beate Bollig, Ingo Wegener, Niko Range, 2008, SOFSEM.

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

Ingo Wegener, I. Wegener, 1995, Inform. Spektrum.

Hierarchy Theorems for kOBDDs and kIBDDs

Beate Bollig, Ingo Wegener, Detlef Sieling, 1998, Theor. Comput. Sci..

Bundeswettbewerb Informatik - Die Aufgaben der Endrunden 1996 und 1997

Ingo Wegener, 1997, LOG IN.

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

Ingo Wegener, Masahiro Fujita, Jawahar Jain, 2001, IEEE Trans. Computers.

How to analyse evolutionary algorithms

Hans-Paul Schwefel, Hans-Georg Beyer, Ingo Wegener, 2002, Theor. Comput. Sci..

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

Ingo Wegener, I. Wegener, 1984, Inf. Control..

Theoretische Informatik - eine algorithmenorientierte Einführung

Ingo Wegener, I. Wegener, 1993, Leitfäden und Monographien der Informatik.

On the Complexity of Slice Functions

Ingo Wegener, 1985, Theor. Comput. Sci..

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

Thomas Jansen, Ingo Wegener, I. Wegener, 2002, Algorithmica.

Komplexitätstheorie: Grenzen der Effizienz von Algorithmen

Ingo Wegener, Ingo Wegener, I. Wegener, 2003 .

Properties of Complexity Measures for Prams and Wrams

Ingo Wegener, Siegfried Bublitz, Ute Schürfeld, 1986, Theor. Comput. Sci..

Relating Monotone Formula Size and Monotone Depth of Boolean Functions

Ingo Wegener, I. Wegener, 1983, Inf. Process. Lett..

Randomized Search Heuristics as an Alternative to Exact Optimization

Ingo Wegener, 2004, Logic versus Approximation.

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

Ingo Wegener, 1991, STACS.

UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

Thomas Jansen, Ingo Wegener, Stefan Droste, 2004 .

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

Ingo Wegener, 1992, J. Inf. Process. Cybern..

The one-dimensional Ising model: Mutation versus recombination

Ingo Wegener, Simon Fischer, I. Wegener, 2005, Theor. Comput. Sci..

Circuit Complexity

Peter L. Hammer, Yves Crama, Ingo Wegener, 2010, Boolean Models and Methods.

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

Ingo Wegener, 1999 .

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

Ingo Wegener, Holger Schwender, Robin Nunkesser, 2007, Bioinform..

Binary Decision Diagrams

Peter L. Hammer, Yves Crama, Beate Bollig, 2010, Boolean Models and Methods.

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

Beate Bollig, Ingo Wegener, 1996, STACS.

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

Ingo Wegener, 1982, Inf. Process. Lett..

On the design and analysis of evolutionary algorithms (Algorithm Engineering as a New Paradigm)

Ingo Wegener, 2001 .

A Remark on Minimal Polynomials of Boolean Functions

Ingo Wegener, Bernd Voigt, I. Wegener, 1988, CSL.

Theory of Evolutionary Algorithms (Dagstuhl Seminar 02031)

Ingo Wegener, Colin R. Reeves, Kenneth de Jong, 2021 .

Complexity of Boolean Functions (Dagstuhl Seminar 02121)

Noam Nisan, Rüdiger Reischuk, Ingo Wegener, 2021 .

Theory of Evolutionary Algorithms (Dagstuhl Seminar 00071)

David B. Fogel, Ingo Wegener, Kenneth de Jong, 2021 .

Evolutionary Algorithms , Randomized Local Search , and the Maximum Matching Problem ∗

Ingo Wegener, Oliver Giel, I. Wegener, 2003 .

The construction of an optimal distribution of search effort

Ingo Wegener, 1981 .

On the nonapproximability of boolean Function by OBDDs and read- k -times Branching Programs

Ingo Wegener, Martin Sauerhoff, Beate Bolling, 2002 .

Complexity Theoretical Aspects of OFDDs

Beate Bollig, Ingo Wegener, Martin Sauerhoff, 1996 .

The discrete search problem and the construction of optimal allocations

Ingo Wegener, 1982 .