Ingo Wegener - RankMe

193 papers A* 6A 24B 15Journal 120Unranked 11

Year	Rank	Type	Title / Venue / Authors
2011	J	`jnl`	Precision, Local Search and Unimodal Functions. Algorithmica Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2010	—	`ch.`	Binary Decision Diagrams. Boolean Models and Methods Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Yves Crama, Peter L. Hammer
2010	—	`ch.`	Circuit Complexity. Boolean Models and Methods Matthias Krause, Ingo Wegener, Yves Crama, Peter L. Hammer
2010	J	`jnl`	Editorial. Algorithmica Benjamin Doerr, Frank Neumann, Ingo Wegener
2010	J	`jnl`	Exact OBDD Bounds for Some Fundamental Functions. Theory Comput. Syst. Beate Bollig, Niko Range, Ingo Wegener
2010	J	`jnl`	Tight Bounds for Blind Search on the Integers and the Reals. Comb. Probab. Comput. Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2008	—	`ch.`	Can Single-Objective Optimization Profit from Multiobjective Optimization? Multiobjective Problem Solving from Nature Frank Neumann, Ingo Wegener
2008	B	`conf`	Exact OBDD Bounds for Some Fundamental Functions. SOFSEM Beate Bollig, Niko Range, Ingo Wegener
2008	A	`conf`	Precision, local search and unimodal functions. GECCO Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2008	J	`jnl`	Tight Bounds for Blind Search on the Integers CoRR Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2008	A	`conf`	Tight Bounds for Blind Search on the Integers. STACS Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2007	J	`jnl`	A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. Theor. Comput. Sci. Thomas Jansen, Ingo Wegener
2007	J	`jnl`	Detecting high-order interactions of single nucleotide polymorphisms using genetic programming. Bioinform. Robin Nunkesser, Thorsten Bernholt, Holger Schwender, Katja Ickstadt, Ingo Wegener
2007	J	`jnl`	Exact OBDD Bounds for some Fundamental Functions. Electron. Colloquium Comput. Complex. Beate Bollig, Niko Range, Ingo Wegener
2007	J	`jnl`	New Results on the Complexity of the Middle Bit of Multiplication. Comput. Complex. Ingo Wegener, Philipp Woelfel
2007	J	`jnl`	Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. Frank Neumann, Ingo Wegener
2006	—	`ed.`	Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I ICALP (1) Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
2006	—	`ed.`	Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II ICALP (2) Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
2006	A	`conf`	Maximum cardinality matchings on trees by randomized local search. GECCO Oliver Giel, Ingo Wegener
2006	J	`jnl`	Minimum spanning trees made easier via multi-objective optimization. Nat. Comput. Frank Neumann, Ingo Wegener
2006	J	`jnl`	Modified repeated median filters. Stat. Comput. Thorsten Bernholt, Roland Fried, Ursula Gather, Ingo Wegener
2006	J	`jnl`	On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms Thomas Jansen, Ingo Wegener
2006	A	`conf`	On the local performance of simulated annealing and the (1+1) evolutionary algorithm. GECCO Thomas Jansen, Ingo Wegener
2006	J	`jnl`	Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. Stefan Droste, Thomas Jansen, Ingo Wegener
2005	—	`book`	Complexity theory - exploring the limits of efficient algorithms. Ingo Wegener
2005	A	`conf`	Minimum spanning trees made easier via multi-objective optimization. GECCO Frank Neumann, Ingo Wegener
2005	A	`conf`	New Results on the Complexity of the Middle Bit of Multiplication. CCC Ingo Wegener, Philipp Woelfel
2005	J	`jnl`	On converting CNF to DNF. Theor. Comput. Sci. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
2005	J	`jnl`	On the Choice of the Offspring Population Size in Evolutionary Algorithms. Evol. Comput. Thomas Jansen, Kenneth A. De Jong, Ingo Wegener
2005	J	`jnl`	On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Comb. Probab. Comput. Ingo Wegener, Carsten Witt
2005	J	`jnl`	On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. J. Discrete Algorithms Ingo Wegener, Carsten Witt
2005	J	`jnl`	On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. Matthias Krause, Petr Savický, Ingo Wegener
2005	J	`jnl`	Rankings oder Ratings: Warum, wie und durch wen?. Inform. Spektrum Ingo Wegener
2005	J	`jnl`	Real royal road functions--where crossover provably is essential. Discret. Appl. Math. Thomas Jansen, Ingo Wegener
2005	A*	`conf`	Simulated Annealing Beats Metropolis in Combinatorial Optimization. ICALP Ingo Wegener
2005	J	`jnl`	The one-dimensional Ising model: Mutation versus recombination. Theor. Comput. Sci. Simon Fischer, Ingo Wegener
2004	J	`jnl`	BDDs--design, analysis, complexity, and applications. Discret. Appl. Math. Ingo Wegener
2004	A	`conf`	Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
2004	J	`jnl`	New Results on the Complexity of the Middle Bit of Multiplication Electron. Colloquium Comput. Complex. Ingo Wegener, Philipp Woelfel
2004	—	`conf`	Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) Frank Neumann, Ingo Wegener
2004	—	`conf`	Randomized Search Heuristics as an Alternative to Exact Optimization. Logic versus Approximation Ingo Wegener
2004	J	`jnl`	Real royal road functions for constant population size. Theor. Comput. Sci. Tobias Storch, Ingo Wegener
2004	J	`jnl`	Searching Randomly for Maximum Matchings Electron. Colloquium Comput. Complex. Oliver Giel, Ingo Wegener
2004	J	`jnl`	Simulated Annealing Beats Metropolis in Combinatorial Optimization Electron. Colloquium Comput. Complex. Ingo Wegener
2004	—	`conf`	The Ising Model on the Ring: Mutation Versus Recombination. GECCO (1) Simon Fischer, Ingo Wegener
2004	A	`conf`	The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
2004	J	`jnl`	The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithms Jens Scharnow, Karsten Tinnefeld, Ingo Wegener
2003	A	`conf`	Evolutionary Algorithms and the Maximum Matching Problem. STACS Oliver Giel, Ingo Wegener
2003	J	`jnl`	Functions that have read-once branching programs of quadratic size are not necessarily testable. Inf. Process. Lett. Beate Bollig, Ingo Wegener
2003	—	`book`	Komplexitätstheorie: Grenzen der Effizienz von Algorithmen Ingo Wegener
2003	J	`jnl`	On Converting CNF to DNF Electron. Colloquium Comput. Complex. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
2003	B	`conf`	On Converting CNF to DNF. MFCS Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
2003	A	`conf`	On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. GECCO Ingo Wegener, Carsten Witt
2003	A	`conf`	Real Royal Road Functions for Constant Population Size. GECCO Tobias Storch, Ingo Wegener
2003	J	`jnl`	The Oberwolfach Meeting On Combinatorics, Probability And Computing. Comb. Probab. Comput. Béla Bollobás, Ingo Wegener
2003	J	`jnl`	The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evol. Comput. Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener
2003	B	`conf`	Towards a Theory of Randomized Search Heuristics. MFCS Ingo Wegener
2003	J	`jnl`	Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization Electron. Colloquium Comput. Complex. Stefan Droste, Thomas Jansen, Ingo Wegener
2002	A	`conf`	A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener
2002	J	`jnl`	A simplified correctness proof for a well-known algorithm computing strongly connected components. Inf. Process. Lett. Ingo Wegener
2002	A	`conf`	Fitness Landscapes Based on Sorting and Shortest Paths Problems. PPSN Jens Scharnow, Karsten Tinnefeld, Ingo Wegener
2002	J	`jnl`	How to analyse evolutionary algorithms. Theor. Comput. Sci. Hans-Georg Beyer, Hans-Paul Schwefel, Ingo Wegener
2002	J	`jnl`	Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. Inform. Spektrum Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener
2002	J	`jnl`	On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. Beate Bollig, Martin Sauerhoff, Ingo Wegener
2002	J	`jnl`	On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. Stefan Droste, Thomas Jansen, Ingo Wegener
2002	J	`jnl`	Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. Theor. Comput. Sci. Stefan Droste, Thomas Jansen, Ingo Wegener
2002	J	`jnl`	The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Algorithmica Thomas Jansen, Ingo Wegener
2001	J	`jnl`	A Comparison of Free BDDs and Transformed BDDs. Formal Methods Syst. Des. Detlef Sieling, Ingo Wegener
2001	J	`jnl`	A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs. IEEE Trans. Computers Jawahar Jain, Ingo Wegener, Masahiro Fujita
2001	J	`jnl`	Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evol. Comput. Thomas Jansen, Ingo Wegener
2001	J	`jnl`	Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools. Informatica Didact. Philipp Kersting, Ingo Wegener
2001	A	`conf`	On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. CCC Beate Bollig, Martin Sauerhoff, Ingo Wegener
2001	J	`jnl`	Teaching Nondeterminism as a Special Case of Randomization. Informatica Didact. Ingo Wegener
2001	A*	`conf`	Theoretical Aspects of Evolutionary Algorithms. ICALP Ingo Wegener
2000	A*	`conf`	Analysis of composition complexity and how to obtain smaller canonical graphs. DAC Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo Wegener, Yuan Lu
2000	J	`jnl`	Approximability and Nonapproximability by Binary Decision Diagrams Electron. Colloquium Comput. Complex. Beate Bollig, Ingo Wegener
2000	A*	`conf`	Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. ICALP Beate Bollig, Ingo Wegener
2000	J	`jnl`	Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. J. Comput. Syst. Sci. Beate Bollig, Ingo Wegener
2000	—	`book`	Branching Programs and Binary Decision Diagrams Ingo Wegener
2000	A	`conf`	Distributed Hybrid Genetic Programming for Learning Boolean Functions. PPSN Stefan Droste, Dominic Heutelbeck, Ingo Wegener
2000	A	`conf`	Dynamic Parameter Control in Simple Evolutionary Algorithms. FOGA Stefan Droste, Thomas Jansen, Ingo Wegener
2000	J	`jnl`	Identification of Partial Disjunction, Parity, and Threshold Functions. Theor. Comput. Sci. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
2000	—	`conf`	Introduction: Workshop on Boolean Functions and Applications. ICALP Satellite Workshops Juraj Hromkovic, Ingo Wegener
2000	A	`conf`	On the Choice of the Mutation Probability for the (1+1) EA. PPSN Thomas Jansen, Ingo Wegener
2000	B	`conf`	On the Expected Runtime and the Success Probability of Evolutionary Algorithms. WG Ingo Wegener
2000	A	`conf`	On the Performance of WEAK-HEAPSORT. STACS Stefan Edelkamp, Ingo Wegener
2000	J	`jnl`	Optimal ordered binary decision diagrams for read-once formulas. Discret. Appl. Math. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
2000	—	`book`	Starthilfe Informatik, 2. Auflage Hans-Jürgen Appelrath, Dietrich Boles, Volker Claus, Ingo Wegener
2000	J	`jnl`	Worst case examples for operations on OBDDs. Inf. Process. Lett. Ingo Wegener
1999	A*	`conf`	Approximations by OBDDs and the Variable Ordering Problem. ICALP Matthias Krause, Petr Savický, Ingo Wegener
1999	J	`jnl`	Approximations by OBDDs and the variable ordering problem Electron. Colloquium Comput. Complex. Matthias Krause, Petr Savický, Ingo Wegener
1999	J	`jnl`	Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems Electron. Colloquium Comput. Complex. Beate Bollig, Ingo Wegener
1999	J	`jnl`	Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Theory Comput. Syst. Beate Bollig, Ingo Wegener
1999	J	`jnl`	On P versus NP cap co-NP for decision trees and read-once branching programs. Comput. Complex. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
1999	A	`conf`	On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. ESA Thomas Jansen, Ingo Wegener
1999	J	`jnl`	On the Cut-off Point for Combinatorial Group Testing. Discret. Appl. Math. Paul Fischer, Norbert Klasner, Ingo Wegener
1999	J	`jnl`	On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Informatics Appl. Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener
1999	J	`jnl`	On the performance of WEAK-HEAPSORT Electron. Colloquium Comput. Complex. Stefan Edelkamp, Ingo Wegener
1999	A	`conf`	Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO Stefan Droste, Thomas Jansen, Ingo Wegener
1999	A	`conf`	Relating Branching Program Size and Formula Size over the Full Binary Basis. STACS Martin Sauerhoff, Ingo Wegener, Ralph Werchner
1999	—	`book`	Theoretische Informatik - eine algorithmenorientierte Einführung (2. Auflage) Ingo Wegener
1998	J	`jnl`	A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. Evol. Comput. Stefan Droste, Thomas Jansen, Ingo Wegener
1998	J	`jnl`	A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. Inf. Process. Lett. Beate Bollig, Ingo Wegener
1998	J	`jnl`	Completeness and Non-Completeness Results with Respect to Read-Once Projections. Inf. Comput. Beate Bollig, Ingo Wegener
1998	J	`jnl`	Hierarchy Theorems for Theor. Comput. Sci. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
1998	A	`conf`	On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN Stefan Droste, Thomas Jansen, Ingo Wegener
1998	J	`jnl`	Parity OBDDs Cannot be Handled Efficiently Enough. Inf. Process. Lett. Martin Löbbing, Detlef Sieling, Ingo Wegener
1998	—	`book`	Starthilfe Informatik Starthilfe Informatik Hans-Jürgen Appelrath, Dietrich Boles, Volker Claus, Ingo Wegener
1998	—	`book`	Starthilfe Informatik Hans-Jürgen Appelrath, Dietrich Boles, Volker Claus, Ingo Wegener
1998	J	`jnl`	The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours. Formal Methods Syst. Des. Olaf Schröer, Ingo Wegener
1997	J	`jnl`	Bounds on the Number of Knight's Tours. Discret. Appl. Math. Olaf Kyek, Ian Parberry, Ingo Wegener
1997	J	`jnl`	Bundeswettbewerb Informatik - Die Aufgaben der Endrunden 1996 und 1997. LOG IN Ingo Wegener
1997	B	`conf`	Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. MFCS Beate Bollig, Ingo Wegener
1997	J	`jnl`	Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. Acta Informatica Petr Savický, Ingo Wegener
1997	B	`conf`	On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. MFCS Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
1997	J	`jnl`	On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs Electron. Colloquium Comput. Complex. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
1997	—	`conf`	Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. EuroCOLT Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
1996	—	`book`	Effiziente Algorithmen für grundlegende Funktionen (2. Auflage) Ingo Wegener
1996	J	`jnl`	Improving the Variable Ordering of OBDDs Is NP-Complete. IEEE Trans. Computers Beate Bollig, Ingo Wegener
1996	—	`book`	Kompendium Theoretische Informatik - eine Ideensammlung Ingo Wegener
1996	J	`jnl`	On the Complexity of Encoding in Analog Circuits. Inf. Process. Lett. Ingo Wegener
1996	J	`jnl`	On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. Inf. Process. Lett. Beate Bollig, Martin Löbbing, Ingo Wegener
1996	J	`jnl`	On the complexity of minimizing the OBDD size for incompletely specified functions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Martin Sauerhoff, Ingo Wegener
1996	J	`jnl`	Optimal Ordered Binary Decision Diagrams for Tree-like Circuits Electron. Colloquium Comput. Complex. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
1996	J	`jnl`	Optimal attribute-efficient learning of disjunction, parity, and threshold functions Electron. Colloquium Comput. Complex. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
1996	A	`conf`	Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. STACS Beate Bollig, Ingo Wegener
1996	J	`jnl`	The Number of Knight's Tours Equals 33, 439, 123, 484, 294 - Counting with Binary Decision Diagrams. Electron. J. Comb. Martin Löbbing, Ingo Wegener
1995	J	`jnl`	Didaktische Überlegungen zu einer algorithmenorientierten Einführung in die Theoretische Informatik. Inform. Spektrum Ingo Wegener
1995	J	`jnl`	Graph Driven BDDs - A New Data Structure for Boolean Functions. Theor. Comput. Sci. Detlef Sieling, Ingo Wegener
1995	J	`jnl`	Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams Electron. Colloquium Comput. Complex. Beate Bollig, Ingo Wegener
1995	J	`jnl`	The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams Electron. Colloquium Comput. Complex. Martin Löbbing, Ingo Wegener
1994	J	`jnl`	Comments on "A Characterization of Binary Decision Diagrams". IEEE Trans. Computers Ingo Wegener
1994	—	`conf`	Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. FSTTCS Petr Savický, Ingo Wegener
1994	J	`jnl`	Efficient data structures for Boolean functions. Discret. Math. Ingo Wegener
1994	B	`conf`	New Lower Bounds and Hierarchy Results for Restricted Branching Programs. WG Detlef Sieling, Ingo Wegener
1994	J	`jnl`	On the Power of Different Types of Restricted Branching Programs Electron. Colloquium Comput. Complex. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
1994	J	`jnl`	Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC Inf. Comput. Johan Håstad, Ingo Wegener, Norbert Wurm, Sang-Zin Yi
1994	J	`jnl`	Solution of the knight's Hamiltonian path problem on chessboards. Discret. Appl. Math. Axel Conrad, Tanja Hindrichs, Hussein Morsy, Ingo Wegener
1994	J	`jnl`	The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions. IEEE Trans. Computers Ingo Wegener
1993	J	`jnl`	A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly. Comput. J. Ingo Wegener
1993	J	`jnl`	BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small). Theor. Comput. Sci. Ingo Wegener
1993	J	`jnl`	NC-Algorithms for Operations on Binary Decision Diagrams. Parallel Process. Lett. Detlef Sieling, Ingo Wegener
1993	J	`jnl`	Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions. Inf. Process. Lett. Ingo Wegener
1993	J	`jnl`	Reduction of OBDDs in Linear Time. Inf. Process. Lett. Detlef Sieling, Ingo Wegener
1993	B	`conf`	The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. WG Ingo Wegener
1993	—	`book`	Theoretische Informatik - eine algorithmenorientierte Einführung. Ingo Wegener
1992	J	`jnl`	Das Springerproblem. Inform. Spektrum Jürg Nievergelt, Lutz Prechelt, Ingo Wegener
1992	J	`jnl`	How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates? J. Inf. Process. Cybern. Ingo Wegener
1992	J	`jnl`	The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n Inf. Comput. Ingo Wegener
1991	J	`jnl`	The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits. Theor. Comput. Sci. Ingo Wegener
1991	J	`jnl`	The Conjunctive Complexity of Quadratic Boolean Functions. Theor. Comput. Sci. Katja Lenz, Ingo Wegener
1991	A	`conf`	The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. STACS Ingo Wegener
1990	J	`jnl`	Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt. Inform. Spektrum Ingo Wegener
1990	B	`conf`	Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). MFCS Ingo Wegener
1990	J	`jnl`	Efficient Simulation of Circuits by Erew Prams. Inf. Process. Lett. Ingo Wegener
1990	B	`conf`	Symmetric Functions in AC MFCS Ingo Wegener, Norbert Wurm, Sang-Zin Yi
1989	J	`jnl`	A Note on the Relations Between Critical and Sensitive Complexity. J. Inf. Process. Cybern. Ingo Wegener, László Zádori
1989	—	`book`	Effiziente Algorithmen für grundlegende Funktionen. Ingo Wegener
1989	J	`jnl`	Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple Inf. Comput. Bernd Voigt, Ingo Wegener
1988	B	`conf`	A Remark on Minimal Polynomials of Boolean Functions. CSL Bernd Voigt, Ingo Wegener
1988	J	`jnl`	On the complexity of branching programs and decision trees for clique functions. J. ACM Ingo Wegener
1988	J	`jnl`	Prime implicants and parallel complexity. Bull. EATCS Ingo Wegener
1987	—	`conf`	On the Complexity of Branching Programs and Decision Trees for Clique Functions. TAPSOFT, Vol.1 Ingo Wegener
1987	—	`conf`	The Complexity of Symmetric Boolean Functions. Computation Theory and Logic Ingo Wegener
1987	J	`jnl`	The Complexity of Symmetric Functions in Bounded-Depth Circuits. Inf. Process. Lett. Bettina Brustmann, Ingo Wegener
1987	B	`conf`	The Conjunctive Complexity of Quadratic Boolean Functions. CSL Katja Lenz, Ingo Wegener
1987	J	`jnl`	The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits. J. Inf. Process. Cybern. Ingo Wegener
1987	—	`book`	The complexity of Boolean functions Ingo Wegener
1986	J	`jnl`	More on the Complexity of Slice Functions. Theor. Comput. Sci. Ingo Wegener
1986	J	`jnl`	Nearly Optimal Hierarchies for Network and Formula Size. Acta Informatica Mike Paterson, Ingo Wegener
1986	B	`conf`	Properties of Complexity Measures for PRAMs and WRAMs. MFCS Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener
1986	J	`jnl`	Properties of Complexity Measures for Prams and Wrams. Theor. Comput. Sci. Siegfried Bublitz, Ute Schürfeld, Ingo Wegener
1986	J	`jnl`	Time-Space Trade-offs for Branching Programs. J. Comput. Syst. Sci. Ingo Wegener
1985	J	`jnl`	On the Complexity of Slice Functions. Theor. Comput. Sci. Ingo Wegener
1985	J	`jnl`	Optimal Search With Positive Switch Cost is NP-Hard. Inf. Process. Lett. Ingo Wegener
1985	J	`jnl`	The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties Inf. Control. Ingo Wegener
1985	B	`conf`	The critical complexity of all (monotone) Boolean functions and monotone graph properties. FCT Ingo Wegener
1984	B	`conf`	On the Complexity of Slice Functions. MFCS Ingo Wegener
1984	J	`jnl`	Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions Inf. Control. Ingo Wegener
1984	—	`conf`	Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. CAAP Ingo Wegener
1983	—	`conf`	Proving lower bounds of the monotone complexity of Boolean functions. Logic and Machines Ingo Wegener
1983	J	`jnl`	Relating Monotone Formula Size and Monotone Depth of Boolean Functions. Inf. Process. Lett. Ingo Wegener
1982	J	`jnl`	Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic. Inf. Process. Lett. Ingo Wegener
1982	J	`jnl`	Boolean Functions whose Monotone Complexity is of Size n2/log n. Theor. Comput. Sci. Ingo Wegener
1982	J	`jnl`	Discrete Sequential Search with Positive Switch Cost. Math. Oper. Res. Udo Lössner, Ingo Wegener
1981	J	`jnl`	An Improved Complexity Hierarchy on the Depth of Boolean Functions. Acta Informatica Ingo Wegener
1981	—	`conf`	Boolean Functions Whose Monotone Complexity is of Size n Theoretical Computer Science Ingo Wegener
1980	J	`jnl`	A new Lower Bound on the Monotone Network Complexity of Boolean Sums. Acta Informatica Ingo Wegener
1980	J	`jnl`	The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities. Math. Oper. Res. Ingo Wegener
1979	J	`jnl`	A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. Theor. Comput. Sci. Ingo Wegener
1979	J	`jnl`	On separating systems whose elements are sets of at most k elements. Discret. Math. Ingo Wegener
1979	J	`jnl`	Switching Functions Whose Monotone Complexity is Nearly Quadratic. Theor. Comput. Sci. Ingo Wegener
1978	A*	`conf`	Switching Functions Whose Monotone Complexity Is Nearly Quadratic STOC Ingo Wegener