Ingo Wegener
According to our database1,
Ingo Wegener
authored at least 187 papers
between 1978 and 2011.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at id.loc.gov
-
at gi.de
-
at d-nb.info
-
at isni.org
-
at dl.acm.org
On csauthors.net:
Bibliography
2011
Precision, Local Search and Unimodal Functions.
Algorithmica, 2011
2010
Exact OBDD Bounds for Some Fundamental Functions.
Theory Comput. Syst., 2010
Tight Bounds for Blind Search on the Integers and the Reals.
Combinatorics, Probability & Computing, 2010
Editorial.
Algorithmica, 2010
2008
Tight Bounds for Blind Search on the Integers
CoRR, 2008
Tight Bounds for Blind Search on the Integers.
Proceedings of the STACS 2008, 2008
Exact OBDD Bounds for Some Fundamental Functions.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008
Precision, local search and unimodal functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008
2007
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem.
Theor. Comput. Sci., 2007
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.
Theor. Comput. Sci., 2007
Exact OBDD Bounds for some Fundamental Functions.
Electronic Colloquium on Computational Complexity (ECCC), 2007
New Results on the Complexity of the Middle Bit of Multiplication.
Computational Complexity, 2007
Detecting high-order interactions of single nucleotide polymorphisms using genetic programming.
Bioinformatics, 2007
2006
Modified repeated median filters.
Statistics and Computing, 2006
Minimum spanning trees made easier via multi-objective optimization.
Natural Computing, 2006
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization.
Theory Comput. Syst., 2006
On the analysis of a dynamic evolutionary algorithm.
J. Discrete Algorithms, 2006
On the local performance of simulated annealing and the (1+1) evolutionary algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
Maximum cardinality matchings on trees by randomized local search.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
2005
On converting CNF to DNF.
Theor. Comput. Sci., 2005
The one-dimensional Ising model: Mutation versus recombination.
Theor. Comput. Sci., 2005
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions.
J. Discrete Algorithms, 2005
Rankings oder Ratings: Warum, wie und durch wen?.
Informatik Spektrum, 2005
On the influence of the variable ordering for algorithmic learning using OBDDs.
Inf. Comput., 2005
On the Choice of the Offspring Population Size in Evolutionary Algorithms.
Evolutionary Computation, 2005
Real royal road functions--where crossover provably is essential.
Discrete Applied Mathematics, 2005
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics.
Combinatorics, Probability & Computing, 2005
Simulated Annealing Beats Metropolis in Combinatorial Optimization.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Minimum spanning trees made easier via multi-objective optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005
New Results on the Complexity of the Middle Bit of Multiplication.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005
Complexity theory - exploring the limits of efficient algorithms.
Springer, ISBN: 978-3-540-21045-0, 2005
2004
Real royal road functions for constant population size.
Theor. Comput. Sci., 2004
The analysis of evolutionary algorithms on sorting and shortest paths problems.
J. Math. Model. Algorithms, 2004
New Results on the Complexity of the Middle Bit of Multiplication
Electronic Colloquium on Computational Complexity (ECCC), 2004
Simulated Annealing Beats Metropolis in Combinatorial Optimization
Electronic Colloquium on Computational Complexity (ECCC), 2004
Searching Randomly for Maximum Matchings
Electronic Colloquium on Computational Complexity (ECCC), 2004
BDDs--design, analysis, complexity, and applications.
Discrete Applied Mathematics, 2004
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.
Proceedings of the Parallel Problem Solving from Nature, 2004
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2004
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem.
Proceedings of the Genetic and Evolutionary Computation, 2004
The Ising Model on the Ring: Mutation Versus Recombination.
Proceedings of the Genetic and Evolutionary Computation, 2004
Randomized Search Heuristics as an Alternative to Exact Optimization.
Proceedings of the Logic versus Approximation, 2004
2003
The analysis of a recombinative hill-climber on H-IFF.
IEEE Trans. Evolutionary Computation, 2003
Functions that have read-once branching programs of quadratic size are not necessarily testable.
Inf. Process. Lett., 2003
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Electronic Colloquium on Computational Complexity (ECCC), 2003
On Converting CNF to DNF
Electronic Colloquium on Computational Complexity (ECCC), 2003
The Oberwolfach Meeting On Combinatorics, Probability And Computing.
Combinatorics, Probability & Computing, 2003
Evolutionary Algorithms and the Maximum Matching Problem.
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.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
On Converting CNF to DNF.
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.
Proceedings of the Genetic and Evolutionary Computation, 2003
Real Royal Road Functions for Constant Population Size.
Proceedings of the Genetic and Evolutionary Computation, 2003
Komplexitätstheorie: Grenzen der Effizienz von Algorithmen
Springer, ISBN: 3-540-00161-1, 2003
2002
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions.
Theor. Comput. Sci., 2002
On the analysis of the (1+1) evolutionary algorithm.
Theor. Comput. Sci., 2002
How to analyse evolutionary algorithms.
Theor. Comput. Sci., 2002
A simplified correctness proof for a well-known algorithm computing strongly connected components.
Inf. Process. Lett., 2002
Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.
Informatik Spektrum, 2002
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs.
Inf. Comput., 2002
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
Algorithmica, 2002
Fitness Landscapes Based on Sorting and Shortest Paths Problems.
Proceedings of the Parallel Problem Solving from Nature, 2002
A New Framework for the Valuation of Algorithms for Black-Box Optimization.
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.
IEEE Trans. Evolutionary Computation, 2001
A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs.
IEEE Trans. Computers, 2001
A Comparison of Free BDDs and Transformed BDDs.
Formal Methods in System Design, 2001
Teaching Nondeterminism as a Special Case of Randomization.
Informatica Didactica, 2001
Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools.
Informatica Didactica, 2001
Theoretical Aspects of Evolutionary Algorithms.
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.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001
2000
Identification of Partial Disjunction, Parity, and Threshold Functions.
Theor. Comput. Sci., 2000
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.
J. Comput. Syst. Sci., 2000
Worst case examples for operations on OBDDs.
Inf. Process. Lett., 2000
Approximability and Nonapproximability by Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC), 2000
Optimal ordered binary decision diagrams for read-once formulas.
Discrete Applied Mathematics, 2000
On the Expected Runtime and the Success Probability of Evolutionary Algorithms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000
On the Performance of WEAK-HEAPSORT.
Proceedings of the STACS 2000, 2000
On the Choice of the Mutation Probability for the (1+1) EA.
Proceedings of the Parallel Problem Solving from Nature, 2000
Distributed Hybrid Genetic Programming for Learning Boolean Functions.
Proceedings of the Parallel Problem Solving from Nature, 2000
Introduction: Workshop on Boolean Functions and Applications.
Proceedings of the ICALP Workshops 2000, 2000
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Dynamic Parameter Control in Simple Evolutionary Algorithms.
Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000
Analysis of composition complexity and how to obtain smaller canonical graphs.
Proceedings of the 37th Conference on Design Automation, 2000
Starthilfe Informatik, 2., durchges. Aufl.
Teubner, ISBN: 3-519-10241-2, 2000
Branching Programs and Binary Decision Diagrams
SIAM, ISBN: 0-89871-458-3, 2000
1999
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.
Theory Comput. Syst., 1999
On the complexity of the hidden weighted bit function for various BDD models.
ITA, 1999
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
Electronic Colloquium on Computational Complexity (ECCC), 1999
On the performance of WEAK-HEAPSORT
Electronic Colloquium on Computational Complexity (ECCC), 1999
Approximations by OBDDs and the variable ordering problem
Electronic Colloquium on Computational Complexity (ECCC), 1999
On the Cut-off Point for Combinatorial Group Testing.
Discrete Applied Mathematics, 1999
On P versus NP cap co-NP for decision trees and read-once branching programs.
Computational Complexity, 1999
Relating Branching Program Size and Formula Size over the Full Binary Basis.
Proceedings of the STACS 99, 1999
Approximations by OBDDs and the Variable Ordering Problem.
Proceedings of the Automata, 1999
Perhaps Not a Free Lunch But At Least a Free Appetizer.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
Proceedings of the Algorithms, 1999
Theoretische Informatik - eine algorithmenorientierte Einführung (2. Auflage)
Teubner, ISBN: 3-519-12123-9, 1999
1998
Hierarchy Theorems for kOBDDs and kIBDDs.
Theor. Comput. Sci., 1998
Parity OBDDs Cannot be Handled Efficiently Enough.
Inf. Process. Lett., 1998
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs.
Inf. Process. Lett., 1998
Completeness and Non-Completeness Results with Respect to Read-Once Projections.
Inf. Comput., 1998
The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours.
Formal Methods in System Design, 1998
A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs.
Evolutionary Computation, 1998
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm.
Proceedings of the Parallel Problem Solving from Nature, 1998
Starthilfe Informatik
Teubner, ISBN: 3-519-00241-8, 1998
1997
Bundeswettbewerb Informatik - Die Aufgaben der Endrunden 1996 und 1997.
LOG IN, 1997
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC), 1997
Bounds on the Number of Knight's Tours.
Discrete Applied Mathematics, 1997
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams.
Acta Inf., 1997
On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions.
Proceedings of the Computational Learning Theory, Third European Conference, 1997
1996
On the complexity of minimizing the OBDD size for incompletely specified functions.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1996
Improving the Variable Ordering of OBDDs Is NP-Complete.
IEEE Trans. Computers, 1996
On the Complexity of Encoding in Analog Circuits.
Inf. Process. Lett., 1996
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams.
Inf. Process. Lett., 1996
Optimal attribute-efficient learning of disjunction, parity, and threshold functions
Electronic Colloquium on Computational Complexity (ECCC), 1996
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits
Electronic Colloquium on Computational Complexity (ECCC), 1996
The Number of Knight's Tours Equals 33, 439, 123, 484, 294 --- Counting with Binary Decision Diagrams.
Electr. J. Comb., 1996
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams.
Proceedings of the STACS 96, 1996
Effiziente Algorithmen für grundlegende Funktionen (2. Auflage)
Teubner, 1996
Kompendium Theoretische Informatik - eine Ideensammlung
Teubner, ISBN: 3-519-02145-5, 1996
1995
Graph Driven BDDs - A New Data Structure for Boolean Functions.
Theor. Comput. Sci., 1995
Didaktische Überlegungen zu einer algorithmenorientierten Einführung in die Theoretische Informatik.
Informatik Spektrum, 1995
The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC), 1995
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams
Electronic Colloquium on Computational Complexity (ECCC), 1995
1994
Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0.
Inf. Comput., February, 1994
The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions.
IEEE Trans. Computers, 1994
Comments on "A Characterization of Binary Decision Diagrams".
IEEE Trans. Computers, 1994
On the Power of Different Types of Restricted Branching Programs
Electronic Colloquium on Computational Complexity (ECCC), 1994
Efficient data structures for Boolean functions.
Discrete Mathematics, 1994
Solution of the knight's Hamiltonian path problem on chessboards.
Discrete Applied Mathematics, 1994
New Lower Bounds and Hierarchy Results for Restricted Branching Programs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994
Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams.
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).
Theor. Comput. Sci., 1993
NC-Algorithms for Operations on Binary Decision Diagrams.
Parallel Processing Letters, 1993
Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions.
Inf. Process. Lett., 1993
Reduction of OBDDs in Linear Time.
Inf. Process. Lett., 1993
A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly.
Comput. J., 1993
The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993
Theoretische Informatik - eine algorithmenorientierte Einführung.
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
Inf. Comput., March, 1992
Das Springerproblem.
Informatik Spektrum, 1992
How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates?
Elektronische Informationsverarbeitung und Kybernetik, 1992
1991
The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits.
Theor. Comput. Sci., 1991
The Conjunctive Complexity of Quadratic Boolean Functions.
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.
Proceedings of the STACS 91, 1991
1990
Efficient Simulation of Circuits by Erew Prams.
Inf. Process. Lett., 1990
Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt.
Informatik Spektrum, 1990
Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size.
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).
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
Inf. Comput., October, 1989
A Note on the Relations Between Critical and Sensitive Complexity.
Elektronische Informationsverarbeitung und Kybernetik, 1989
Effiziente Algorithmen für grundlegende Funktionen.
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.
J. ACM, 1988
Prime implicants and parallel complexity.
Bulletin of the EATCS, 1988
A Remark on Minimal Polynomials of Boolean Functions.
Proceedings of the CSL '88, 1988
1987
The Complexity of Symmetric Functions in Bounded-Depth Circuits.
Inf. Process. Lett., 1987
The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits.
Elektronische Informationsverarbeitung und Kybernetik, 1987
On the Complexity of Branching Programs and Decision Trees for Clique Functions.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987
The Conjunctive Complexity of Quadratic Boolean Functions.
Proceedings of the CSL '87, 1987
The Complexity of Symmetric Boolean Functions.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987
The complexity of Boolean functions
Wiley-Teubner, 1987
1986
More on the Complexity of Slice Functions.
Theor. Comput. Sci., 1986
Properties of Complexity Measures for Prams and Wrams.
Theor. Comput. Sci., 1986
Time-Space Trade-offs for Branching Programs.
J. Comput. Syst. Sci., 1986
Nearly Optimal Hierarchies for Network and Formula Size.
Acta Inf., 1986
Properties of Complexity Measures for PRAMs and WRAMs.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986
1985
On the Complexity of Slice Functions.
Theor. Comput. Sci., 1985
Optimal Search With Positive Switch Cost is NP-Hard.
Inf. Process. Lett., 1985
The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties
Information and Control, 1985
The critical complexity of all (monotone) Boolean functions and monotone graph properties.
Proceedings of the Fundamentals of Computation Theory, 1985
1984
Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions
Information and Control, 1984
On the Complexity of Slice Functions.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions.
Proceedings of the CAAP'84, 1984
1983
Relating Monotone Formula Size and Monotone Depth of Boolean Functions.
Inf. Process. Lett., 1983
Proving lower bounds of the monotone complexity of Boolean functions.
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983
1982
Boolean Functions whose Monotone Complexity is of Size n2/log n.
Theor. Comput. Sci., 1982
Discrete Sequential Search with Positive Switch Cost.
Math. Oper. Res., 1982
Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic.
Inf. Process. Lett., 1982
1981
An Improved Complexity Hierarchy on the Depth of Boolean Functions.
Acta Inf., 1981
Boolean Functions Whose Monotone Complexity is of Size n2/log n.
Proceedings of the Theoretical Computer Science, 1981
1980
The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities.
Math. Oper. Res., 1980
A new Lower Bound on the Monotone Network Complexity of Boolean Sums.
Acta Inf., 1980
1979
A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks.
Theor. Comput. Sci., 1979
Switching Functions Whose Monotone Complexity is Nearly Quadratic.
Theor. Comput. Sci., 1979
On separating systems whose elements are sets of at most k elements.
Discrete Mathematics, 1979
1978
Switching Functions Whose Monotone Complexity Is Nearly Quadratic
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978