Ingo Wegener

Q: What Schools Are Affiliated With Ingo Wegener

Ingo Wegener is affiliated with the following schools: Goethe University Frankfurt, University of Cologne, Technical University of Dortmund, Bielefeld University

Ingo Wegener's AcademicInfluence.com Rankings

Ingo Wegener

Computer Science

#1529

World Rank

#1583

Historical Rank

Database

#3211

World Rank

#3347

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Ingo Wegener Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ingo Wegener was an influential German computer scientist working in the field of theoretical computer science. Education and career Wegener was educated at the Bielefeld University. He earned a diploma in mathematics there in 1976, a doctorate in 1978, and a habilitation in 1981. His doctoral dissertation, Boolesche Funktionen, deren monotone Komplexität fast quadratisch ist, was jointly supervised by and Rudolf Ahlswede.

(See a Problem?)

Ingo Wegener's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The complexity of Boolean functions (1987) (1114)
On the analysis of the (1+1) evolutionary algorithm (2002) (821)
Improving the Variable Ordering of OBDDs Is NP-Complete (1996) (634)
Branching Programs and Binary Deci-sion Diagrams-Theory and Applications (1987) (387)
Branching Programs and Binary Decision Diagrams (1987) (332)
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (2004) (285)
On the Choice of the Offspring Population Size in Evolutionary Algorithms (2005) (234)
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization (2004) (234)
Search Problems (1987) (225)
The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help (2002) (216)
Complexity Theory (2005) (213)
Evolutionary Algorithms and the Maximum Matching Problem (2003) (183)
Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions (2003) (182)
Real royal road functions--where crossover provably is essential (2001) (178)
Minimum spanning trees made easier via multi-objective optimization (2005) (173)
Advances in Computational Intelligence (2003) (154)
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness (2001) (151)
Complexity theory - exploring the limits of efficient algorithms (2005) (148)
How to analyse evolutionary algorithms (2002) (137)
The Complexity of Symmetric Boolean Functions (1987) (135)
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions (2002) (134)
The analysis of evolutionary algorithms on sorting and shortest paths problems (2004) (134)
Graph Driven BDDs - A New Data Structure for Boolean Functions (1995) (117)
On the complexity of branching programs and decision trees for clique functions (1988) (113)
Theoretical Aspects of Evolutionary Algorithms (2001) (112)
A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs (1998) (108)
Perhaps Not a Free Lunch But At Least a Free Appetizer (1999) (106)
Reduction of OBDDs in Linear Time (1993) (95)
Combinatorics, Probability and Computing (2006) (93)
Fitness Landscapes Based on Sorting and Shortest Paths Problems (2002) (88)
Real royal road functions for constant population size (2003) (87)
Simulated Annealing Beats Metropolis in Combinatorial Optimization (2005) (86)
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm (1998) (80)
SIMULATED ANNEALING TO IMPROVE VARIABLE ORDERINGS FOR OBDDsBeate (1995) (79)
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics (2005) (77)
BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small) (1990) (74)
NC-Algorithms for Operations on Binary Decision Diagrams (1993) (71)
A New Framework for the Valuation of Algorithms for Black-Box Optimization (2002) (69)
A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs (1998) (68)
Detecting high-order interactions of single nucleotide polymorphisms using genetic programming (2007) (67)
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help (1999) (62)
On the Choice of the Mutation Probability for the (1+1) EA (2000) (58)
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions (2005) (56)
On the analysis of a dynamic evolutionary algorithm (2006) (55)
The one-dimensional Ising model: Mutation versus recombination (2005) (54)
Solution of the knight's Hamiltonian path problem on chessboards (1994) (50)
The Ising Model on the Ring: Mutation Versus Recombination (2004) (50)
Dynamic Parameter Control in Simple Evolutionary Algorithms (2001) (50)
On converting CNF to DNF (2003) (44)
Hierarchy Theorems for kOBDDs and kIBDDs (1998) (43)
On the complexity of minimizing the OBDD size for incompletely specified functions (1996) (43)
Efficient data structures for Boolean functions (1994) (42)
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation (2007) (42)
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams (1996) (40)
Modified repeated median filters (2006) (40)
On separating systems whose elements are sets of at most k elements (1979) (40)
Advances in Computational Intelligence: Theory and Practice (2002) (40)
The analysis of a recombinative hill-climber on H-IFF (2003) (39)
BDDs--design, analysis, complexity, and applications (2004) (38)
The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions (1994) (38)
On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs (1997) (37)
Can Single-Objective Optimization Profit from Multiobjective Optimization? (2008) (37)
The Number of Knight's Tours Equals 33, 439, 123, 484, 294 - Counting with Binary Decision Diagrams (1996) (35)
A natural and simple function which is hard for all evolutionary algorithms (2000) (34)
Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions (1993) (33)
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions (1997) (33)
Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions (1984) (31)
The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties (1985) (30)
Boolean Functions whose Monotone Complexity is of Size n2/log n (1981) (29)
On the complexity of the hidden weighted bit function for various BDD models (1999) (29)
Discrete Sequential Search with Positive Switch Cost (1982) (28)
Relating Monotone Formula Size and Monotone Depth of Boolean Functions (1983) (28)
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams (1997) (28)
On the utility of populations in evolutionary algorithms (2001) (28)
On the Performance of WEAK-HEAPSORT (2000) (26)
Bounds on the Number of Knight's Tours (1997) (26)
Properties of Complexity Measures for Prams and Wrams (1986) (24)
Optimal Search With Positive Switch Cost is NP-Hard (1985) (24)
The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits (1991) (24)
The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours (1998) (24)
On the Complexity of Slice Functions (1984) (24)
On the Cut-off Point for Combinatorial Group Testing (1999) (24)
The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n (1992) (24)
Switching Functions Whose Monotone Complexity is Nearly Quadratic (1979) (23)
Towards a Theory of Randomized Search Heuristics (2003) (23)
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs (1998) (23)
The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities (1980) (22)
A new lower bound on the monotone network complexity of Boolean sums (1980) (22)
Tight Bounds for Blind Search on the Integers and the Reals (2008) (21)
GECCO 2007: Genetic and Evolutionary Computation Conference (2007) (21)
Time-Space Trade-offs for Branching Programs (1986) (21)
The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions (1993) (20)
On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search (2003) (19)
The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n (1991) (19)
Efficient algorithms for the transformation between different types of binary decision diagrams (1997) (18)
Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0 (1994) (18)
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (2000) (18)
Maximum cardinality matchings on trees by randomized local search (2006) (16)
The Complexity of Symmetric Functions in Bounded-Depth Circuits (1987) (16)
Theory of Evolutionary Algorithms and Genetic Programming (2003) (16)
On the Expected Runtime and the Success Probability of Evolutionary Algorithms (2000) (16)
Automata, Languages and Programming: 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II (Lecture Notes in Computer Science) (2006) (15)
Relating Branching Program Size and Formula Size over the Full Binary Basis (1999) (14)
On the Power of Different Types of Restricted Branching Programs (1994) (14)
Approximations by OBDDs and the Variable Ordering Problem (1999) (13)
The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems (2004) (13)
Distributed Hybrid Genetic Programming for Learning Boolean Functions (2000) (13)
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization (2004) (13)
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams (1996) (12)
Randomized Search Heuristics as an Alternative to Exact Optimization (2004) (12)
Searching Randomly for Maximum Matchings (2004) (11)
Identification of Partial Disjunction, Parity, and Threshold Functions (1999) (11)
A Note on the Relations Between Critical and Sensitive Complexity (1989) (10)
On the local performance of simulated annealing and the (1+1) evolutionary algorithm (2006) (10)
More on the Complexity of Slice Functions (1986) (10)
Optimal ordered binary decision diagrams for read-once formulas (2000) (9)
A simplified correctness proof for a well-known algorithm computing strongly connected components (2002) (9)
Complexity Theoretical Aspects of OFDDs (1996) (9)
Optimal Ordered Binary Decision Diagrams for Fanout-Free Circuits (1996) (9)
The discrete search problem and the construction of optimal allocations (1982) (9)
On the Analysis of Evolutionary Algorithms (2001) (8)
Exact OBDD Bounds for Some Fundamental Functions (2008) (8)
On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs (2001) (8)
Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small) (1990) (8)
On the Behavior of the (1+1) Evolutionary Algorithm on Quadratic Pseudo-Boolean Functions (2001) (7)
On the design and analysis of evolutionary algorithms (2004) (7)
A Rigorous Complexity Analysis Of The (1 + 1)- Evolution Strategy For Separable Functions With Boole (1998) (7)
Comments on "A Characterization of Binary Decision Diagrams" (1994) (7)
Proving lower bounds of the monotone complexity of Boolean functions (1983) (7)
Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size (1990) (7)
A Comparison of Free BDDs and Transformed BDDs (2001) (7)
Worst case examples for operations on OBDDs (2000) (7)
A Remark on Minimal Polynomials of Boolean Functions (1988) (7)
Genetic and Evolutionary Computation Conference 2008 : GECCO 2008 (2008) (7)
Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II (2006) (7)
Analysis of composition complexity and how to obtain smaller canonical graphs (2000) (6)
Functions that have read-once branching programs of quadratic size are not necessarily testable (2003) (6)
Parity OBDDs Cannot be Handled Efficiently Enough (1998) (6)
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes (2004) (6)
Precision, Local Search and Unimodal Functions (2008) (6)
New Results on the Complexity of the Middle Bit of Multiplication (2005) (5)
VARIABLE ORDERINGS FOR OBDDs , SIMULATED ANNEALING (1996) (5)
Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I (2006) (5)
The Conjunctive Complexity of Quadratic Boolean Functions (1987) (5)
Bottom-up-heat sort, a new variant of heap sort beating an average quick sort (1990) (4)
A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks (1979) (4)
Optimal Ordered Binary Decision Diagrams for Tree-like Circuits (1996) (4)
The construction of an optimal distribution of search effort (1981) (4)
A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly (1993) (4)
Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams (1994) (3)
Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple (1989) (3)
Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic (1982) (3)
Completeness and Non-Completeness Results with Respect to Read-Once Projections (1998) (3)
Evolutionary Algorithms , Randomized Local Search , and the Maximum Matching Problem ∗ (2003) (3)
Switching functions whose monotone complexity (1978) (3)
The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits (1987) (3)
On the Complexity of Encoding in Analog Circuits (1996) (3)
Metropolis Versus Simulated Annealing and the Black-Box-Complexity of Optimization Problems (2008) (2)
9. Integer-Valued DDs (2000) (2)
Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II (2006) (2)
Teaching Nondeterminism as a Special Case of Randomization (2001) (2)
An improved complexity hierarchy on the depth of Boolean functions (1981) (2)
Boolean Function Complexity: Symmetry Functions in AC° can be Computed in Constant Depth with Very Small Size (1992) (2)
On the influence of the variable ordering for algorithmic learning using OBDDs (2005) (1)
Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Fitness Landscapes Based on Sorting and Shortest Path Problems (1)
Nearly optimal hierarchies for network and formula size (1986) (1)
Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions (1984) (1)
Automata, Languages and Programming (1998) (1)
Approximability and Nonapproximability by Binary Decision Diagrams (2000) (1)
Communication Complexity and BDD Lower Bound Techniques (2000) (1)
A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs (2001) (1)
Counting with Binary Decision Diagrams (1995) (0)
New polyester compounds, a process for their production and their use as fabric softener (1980) (0)
New thiodiglykolalkxylat derivatives, methods for their manufacture and their use as plasticizers for textiles (1989) (0)
2. BPs and Decision Trees (DTs) (2000) (0)
The mold release agents for hydraulic binders (1994) (0)
Improved washing and cleaning agents for textiles (ii) (1987) (0)
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 Theoretical Aspects of Evolutionary Algorithms (2001) (0)
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 Towards a Theory of Randomized Search Heuristics (2003) (0)
15. Applications in Optimization, Counting, and Genetic Programming (2000) (0)
ON THE COMPLEXITY OF THE HIDDEN WEIGHTED BITFUNCTION FOR VARIOUS BDD MODELSBeate (1998) (0)
6. Free BDDs (FBDDs) and Read-Once BPs (2000) (0)
INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods How to analyse evolutionary algorithms (2002) (0)
Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools (2001) (0)
Approximability and Nonapproximability by Binary Decision Diagrams (Extented Abstract) (2000) (0)
Use of sugar surfactants for treatment of leather and fur (1996) (0)
Identication of Partial Disjunction, Parity, and Threshold Functions 3 (1999) (0)
Finely divided emulsions comprising sugar surfactants (1995) (0)
13. Applications in Verification and Model Checking (2000) (0)
Thiodiglycol derivatives, methods for their manufacture and their use for softening of textiles (1992) (0)
The Ising model on the ring (2004) (0)
Approximability and Non-Approximability by Binary Decision Diagrams ∗ ( Extended Abstract ) (2007) (0)
New dirt-collecting reinigungsverstaerker in aqueous washing and cleaning loesungen (1985) (0)
Liquid, free of inorganic geruestsalzen substantially detergents and cleaners (1982) (0)
The use of detergent mixtures containing cationic sugar surfactants and other surfactants for the production of softeners (1992) (0)
Washing and cleaning products with reduced chemical requirements (1986) (0)
Use of ether sulfonates as low-foam wetting agents in aqueous, acidic and alkaline treatment agents technical (1984) (0)
Introduction: Workshop on Boolean Functions and Applications (2000) (0)
Quaternary ammonium, a procedure to forward frames illing and their use as tekstilbloedgoeringsmidd (1979) (0)
3. Ordered Binary Decision Diagrams (OBDDs) (2000) (0)
Prime implicants and parallel complexity (1988) (0)
11. Randomized BDDs and Algorithms (2000) (0)
low-foaming surfactant (1992) (0)
Efficient Simulation of Circuits by Erew Prams (1990) (0)
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 Minimum Spanning Trees Made Easier Via Multi-Objective Optimization (2005) (0)
Circuit Complexity (2010) (0)
www.econstor.eu Modified repeated median filters (2004) (0)
Textile detergents and cleaners (1986) (0)
The Ising Model on the Ring 1115 2 Randomized Local Search (2004) (0)
COMPLEXITY THEORETICAL ASPECTS OF (1996) (0)
How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates? (1992) (0)
7. BDDs with Repeated Tests (2000) (0)
Concentrated, fliessfaehige anionic surfactants and methods for their production (1988) (0)
Binary Decision Diagrams (2010) (0)
Aqueous concrete release agents (1996) (0)
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 Evolutionary Algorithms and the Maximum Matching Problem (2002) (0)
On the design and analysis of evolutionary algorithms (Algorithm Engineering as a New Paradigm) (2001) (0)
Prof. Dr. math. Ingo Wegener (2010) (0)
CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Dynamic Parameter Control in Simple Evolutionary Algorithms (2000) (0)
Advances in computational intelligence : :theory and practice/ Hans-Paul Schwefel, Ingo Wegener, Klaus Weinert (2002) (0)
Dispersions de resine de colophane stabilisees (1996) (0)
5. The Variable-Ordering Problem (2000) (0)
Pastenfoermiges washing and cleaning agents and methods for manufacturing (1988) (0)
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 Simulated Annealing Beats Metropolis in Combinatorial Optimization (2004) (0)
The Oberwolfach Meeting on Combinatorics, Probability and Computing (2003) (0)
4. The OBDD Size of Selected Functions (2000) (0)
Thiodiglycol derivatives, processes for their preparation and their use as fabric softeners. (1993) (0)
Refrigerant circuit compact unit for a motor vehicle (2014) (0)
14. Further CAD Applications (2000) (0)
8. Decision Diagrams (DDs) Based on Other Decomposition Rules (2000) (0)
New surfactant mixtures and their use (1986) (0)
12. Summary of the Theoretical Results (2000) (0)
North-Holland 53 PROPERTIES OF COMPLEXITY MEASURES FOR PRAMs (2003) (0)
Estersulfonathaltige Tensid-concentrates and their use (1986) (0)
Detergent additive dispensing behavior with improved (1988) (0)
Optimal sequeutial search with discounted income (2013) (0)

This paper list is powered by the following services:

Other Resources About Ingo Wegener

en.wikipedia.org

What Schools Are Affiliated With Ingo Wegener?

Ingo Wegener is affiliated with the following schools: