Ingo Wegener

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, Local Search and Unimodal Functions. Algorithmica 59(3): 301-322 (2011)

Benjamin Doerr, Frank Neumann, Ingo Wegener: Editorial. Algorithmica 57(1): 119-120 (2010)

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers and the Reals. Combinatorics, Probability & Computing 19(5-6): 711-728 (2010)

Beate Bollig, Niko Range, Ingo Wegener: Exact OBDD Bounds for Some Fundamental Functions. Theory Comput. Syst. 47(2): 593-609 (2010)

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Precision, local search and unimodal functions. GECCO 2008: 771-778

Beate Bollig, Niko Range, Ingo Wegener: Exact OBDD Bounds for Some Fundamental Functions. SOFSEM 2008: 174-185

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel: Tight Bounds for Blind Search on the Integers. CoRR abs/0802.2852 (2008)

Robin Nunkesser, Thorsten Bernholt, Holger Schwender, Katja Ickstadt, Ingo Wegener: Detecting high-order interactions of single nucleotide polymorphisms using genetic programming. Bioinformatics 23(24): 3280-3288 (2007)

Ingo Wegener, Philipp Woelfel: New Results on the Complexity of the Middle Bit of Multiplication. Computational Complexity 16(3): 298-323 (2007)

Frank Neumann, Ingo Wegener: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1): 32-40 (2007)

Thomas Jansen, Ingo Wegener: A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. Theor. Comput. Sci. 386(1-2): 73-93 (2007)

Beate Bollig, Niko Range, Ingo Wegener: Exact OBDD Bounds for some Fundamental Functions. Electronic Colloquium on Computational Complexity (ECCC) 14(049) (2007)

Thomas Jansen, Ingo Wegener: On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4(1): 181-199 (2006)

Stefan Droste, Thomas Jansen, Ingo Wegener: Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. 39(4): 525-544 (2006)

Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3): 305-319 (2006)

Thorsten Bernholt, Roland Fried, Ursula Gather, Ingo Wegener: Modified repeated median filters. Statistics and Computing 16(2): 177-192 (2006)

Thomas Jansen, Ingo Wegener: On the local performance of simulated annealing and the (1+1) evolutionary algorithm. GECCO 2006: 469-476

Oliver Giel, Ingo Wegener: Maximum cardinality matchings on trees by randomized local search. GECCO 2006: 539-546

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener (Eds.): Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I. Lecture Notes in Computer Science 4051, Springer 2006, isbn 3-540-35904-4

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener (Eds.): Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II. Lecture Notes in Computer Science 4052, Springer 2006, isbn 3-540-35907-9

Ingo Wegener: Complexity theory - exploring the limits of efficient algorithms. Springer 2005, isbn 978-3-540-21045-0, pp. I-XI, 1-308

Ingo Wegener, Carsten Witt: On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Combinatorics, Probability & Computing 14(1-2): 225-247 (2005)

Thomas Jansen, Ingo Wegener: Real royal road functions--where crossover provably is essential. Discrete Applied Mathematics 149(1-3): 111-125 (2005)

Thomas Jansen, Kenneth A. De Jong, Ingo Wegener: On the Choice of the Offspring Population Size in Evolutionary Algorithms. Evolutionary Computation 13(4): 413-440 (2005)

Matthias Krause, Petr Savický, Ingo Wegener: On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201(2): 160-177 (2005)

Ingo Wegener: Rankings oder Ratings: Warum, wie und durch wen?. Informatik Spektrum 28(2): 129-130 (2005)

Ingo Wegener, Carsten Witt: On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. J. Discrete Algorithms 3(1): 61-78 (2005)

Simon Fischer, Ingo Wegener: The one-dimensional Ising model: Mutation versus recombination. Theor. Comput. Sci. 344(2-3): 208-225 (2005)

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener: On converting CNF to DNF. Theor. Comput. Sci. 347(1-2): 325-335 (2005)

Ingo Wegener, Philipp Woelfel: New Results on the Complexity of the Middle Bit of Multiplication. IEEE Conference on Computational Complexity 2005: 100-110

Frank Neumann, Ingo Wegener: Minimum spanning trees made easier via multi-objective optimization. GECCO 2005: 763-769

Ingo Wegener: Simulated Annealing Beats Metropolis in Combinatorial Optimization. ICALP 2005: 589-601

Ingo Wegener: BDDs--design, analysis, complexity, and applications. Discrete Applied Mathematics 138(1-2): 229-251 (2004)

Jens Scharnow, Karsten Tinnefeld, Ingo Wegener: The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithms 3(4): 349-366 (2004)

Tobias Storch, Ingo Wegener: Real royal road functions for constant population size. Theor. Comput. Sci. 320(1): 123-134 (2004)

Ingo Wegener: Randomized Search Heuristics as an Alternative to Exact Optimization. Logic versus Approximation 2004: 138-149

Frank Neumann, Ingo Wegener: Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) 2004: 713-724

Simon Fischer, Ingo Wegener: The Ising Model on the Ring: Mutation Versus Recombination. GECCO (1) 2004: 1113-1124

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: Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN 2004: 21-30

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: The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN 2004: 31-40

Oliver Giel, Ingo Wegener: Searching Randomly for Maximum Matchings. Electronic Colloquium on Computational Complexity (ECCC)(076) (2004)

Ingo Wegener: Simulated Annealing Beats Metropolis in Combinatorial Optimization. Electronic Colloquium on Computational Complexity (ECCC)(089) (2004)

Ingo Wegener, Philipp Woelfel: New Results on the Complexity of the Middle Bit of Multiplication. Electronic Colloquium on Computational Complexity (ECCC)(107) (2004)

Ingo Wegener: Komplexitätstheorie: Grenzen der Effizienz von Algorithmen. Springer 2003, isbn 3-540-00161-1

Beate Bollig, Ingo Wegener: Functions that have read-once branching programs of quadratic size are not necessarily testable. Inf. Process. Lett. 87(1): 25-29 (2003)

Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener: The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evolutionary Computation 7(5): 417-423 (2003)

Ingo Wegener, Carsten Witt: On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. GECCO 2003: 622-633

Tobias Storch, Ingo Wegener: Real Royal Road Functions for Constant Population Size. GECCO 2003: 1406-1417

Ingo Wegener: Towards a Theory of Randomized Search Heuristics. MFCS 2003: 125-141

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener: On Converting CNF to DNF. MFCS 2003: 612-621

Oliver Giel, Ingo Wegener: Evolutionary Algorithms and the Maximum Matching Problem. STACS 2003: 415-426

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener: On Converting CNF to DNF. Electronic Colloquium on Computational Complexity (ECCC) 10(017) (2003)

Stefan Droste, Thomas Jansen, Ingo Wegener: Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Electronic Colloquium on Computational Complexity (ECCC)(048) (2003)

Thomas Jansen, Ingo Wegener: The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Algorithmica 34(1): 47-66 (2002)

Beate Bollig, Martin Sauerhoff, Ingo Wegener: On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178(1): 263-278 (2002)

Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener: Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. Informatik Spektrum 25(6): 488-502 (2002)

Ingo Wegener: A simplified correctness proof for a well-known algorithm computing strongly connected components. Inf. Process. Lett. 83(1): 17-19 (2002)

Stefan Droste, Thomas Jansen, Ingo Wegener: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276(1-2): 51-81 (2002)

Hans-Georg Beyer, Hans-Paul Schwefel, Ingo Wegener: How to analyse evolutionary algorithms. Theor. Comput. Sci. 287(1): 101-130 (2002)

Stefan Droste, Thomas Jansen, Ingo Wegener: Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. Theor. Comput. Sci. 287(1): 131-144 (2002)

Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener: A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA 2002: 253-270

Jens Scharnow, Karsten Tinnefeld, Ingo Wegener: Fitness Landscapes Based on Sorting and Shortest Paths Problems. PPSN 2002: 54-63

Philipp Kersting, Ingo Wegener: Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools. Informatica Didactica 2 (2001)

Ingo Wegener: Teaching Nondeterminism as a Special Case of Randomization. Informatica Didactica 4 (2001)

Detlef Sieling, Ingo Wegener: A Comparison of Free BDDs and Transformed BDDs. Formal Methods in System Design 19(3): 223-236 (2001)

Jawahar Jain, Ingo Wegener, Masahiro Fujita: A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs. IEEE Trans. Computers 50(11): 1289-1290 (2001)

Thomas Jansen, Ingo Wegener: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Computation 5(6): 589-599 (2001)

Beate Bollig, Martin Sauerhoff, Ingo Wegener: On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. IEEE Conference on Computational Complexity 2001: 172-183

Ingo Wegener: Theoretical Aspects of Evolutionary Algorithms. ICALP 2001: 64-78

Ingo Wegener: Branching Programs and Binary Decision Diagrams. SIAM 2000, isbn 0-89871-458-3

Hans-Jürgen Appelrath, Dietrich Boles, Volker Claus, Ingo Wegener: Starthilfe Informatik, 2., durchges. Aufl. Teubner 2000, isbn 3-519-10241-2

Martin Sauerhoff, Ingo Wegener, Ralph Werchner: Optimal ordered binary decision diagrams for read-once formulas. Discrete Applied Mathematics 103(1-3): 237-258 (2000)

Ingo Wegener: Worst case examples for operations on OBDDs. Inf. Process. Lett. 74(3-4): 91-96 (2000)

Beate Bollig, Ingo Wegener: Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. J. Comput. Syst. Sci. 61(3): 558-579 (2000)

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Identification of Partial Disjunction, Parity, and Threshold Functions. Theor. Comput. Sci. 230(1-2): 131-147 (2000)

Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo Wegener, Yuan Lu: Analysis of composition complexity and how to obtain smaller canonical graphs. DAC 2000: 681-686

Stefan Droste, Thomas Jansen, Ingo Wegener: Dynamic Parameter Control in Simple Evolutionary Algorithms. FOGA 2000: 275-294

Beate Bollig, Ingo Wegener: Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. ICALP 2000: 187-198

Juraj Hromkovic, Ingo Wegener: Introduction: Workshop on Boolean Functions and Applications. ICALP Satellite Workshops 2000: 227-228

Thomas Jansen, Ingo Wegener: On the Choice of the Mutation Probability for the (1+1) EA. PPSN 2000: 89-98

Stefan Droste, Dominic Heutelbeck, Ingo Wegener: Distributed Hybrid Genetic Programming for Learning Boolean Functions. PPSN 2000: 181-190

Stefan Edelkamp, Ingo Wegener: On the Performance of WEAK-HEAPSORT. STACS 2000: 254-266

Ingo Wegener: On the Expected Runtime and the Success Probability of Evolutionary Algorithms. WG 2000: 1-10

Beate Bollig, Ingo Wegener: Approximability and Nonapproximability by Binary Decision Diagrams. Electronic Colloquium on Computational Complexity (ECCC) 7(52) (2000)

Ingo Wegener: Theoretische Informatik - eine algorithmenorientierte Einführung (2. Auflage). Teubner 1999, isbn 3-519-12123-9

Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener: On P versus NP cap co-NP for decision trees and read-once branching programs. Computational Complexity 8(4): 357-370 (1999)

Paul Fischer, Norbert Klasner, Ingo Wegener: On the Cut-off Point for Combinatorial Group Testing. Discrete Applied Mathematics 91(1-3): 83-92 (1999)

Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener: On the complexity of the hidden weighted bit function for various BDD models. ITA 33(2): 103-116 (1999)

Beate Bollig, Ingo Wegener: Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Theory Comput. Syst. 32(4): 487-503 (1999)

Thomas Jansen, Ingo Wegener: On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. ESA 1999: 184-193

Stefan Droste, Thomas Jansen, Ingo Wegener: Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO 1999: 833-839

Matthias Krause, Petr Savický, Ingo Wegener: Approximations by OBDDs and the Variable Ordering Problem. ICALP 1999: 493-502

Martin Sauerhoff, Ingo Wegener, Ralph Werchner: Relating Branching Program Size and Formula Size over the Full Binary Basis. STACS 1999: 57-67

Matthias Krause, Petr Savický, Ingo Wegener: Approximations by OBDDs and the variable ordering problem. Electronic Colloquium on Computational Complexity (ECCC) 6(11) (1999)

Stefan Edelkamp, Ingo Wegener: On the performance of WEAK-HEAPSORT. Electronic Colloquium on Computational Complexity (ECCC) 6(28) (1999)

Beate Bollig, Ingo Wegener: Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. Electronic Colloquium on Computational Complexity (ECCC)(48) (1999)

Hans-Jürgen Appelrath, Dietrich Boles, Volker Claus, Ingo Wegener: Starthilfe Informatik. Teubner 1998, isbn 3-519-00241-8

Stefan Droste, Thomas Jansen, Ingo Wegener: A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. Evolutionary Computation 6(2): 185-196 (1998)

Olaf Schröer, Ingo Wegener: The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours. Formal Methods in System Design 13(3): 235-253 (1998)

Beate Bollig, Ingo Wegener: Completeness and Non-Completeness Results with Respect to Read-Once Projections. Inf. Comput. 143(1): 24-33 (1998)

Beate Bollig, Ingo Wegener: A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. Inf. Process. Lett. 66(2): 53-57 (1998)

Martin Löbbing, Detlef Sieling, Ingo Wegener: Parity OBDDs Cannot be Handled Efficiently Enough. Inf. Process. Lett. 67(4): 163-168 (1998)

Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener: Hierarchy Theorems for kOBDDs and kIBDDs. Theor. Comput. Sci. 205(1-2): 45-60 (1998)

Stefan Droste, Thomas Jansen, Ingo Wegener: On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN 1998: 13-22

Petr Savický, Ingo Wegener: Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. Acta Inf. 34(4): 245-256 (1997)

Olaf Kyek, Ian Parberry, Ingo Wegener: Bounds on the Number of Knight's Tours. Discrete Applied Mathematics 74(2): 171-181 (1997)

Ingo Wegener: Bundeswettbewerb Informatik - Die Aufgaben der Endrunden 1996 und 1997. LOG IN 17(6): 29- (1997)

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. EuroCOLT 1997: 171-184

Beate Bollig, Ingo Wegener: Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. MFCS 1997: 159-168

Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener: On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. MFCS 1997: 319-326

Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener: On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 4(23) (1997)

Ingo Wegener: Kompendium Theoretische Informatik - eine Ideensammlung. Teubner 1996, isbn 3-519-02145-5

Ingo Wegener: Effiziente Algorithmen für grundlegende Funktionen (2. Auflage). Teubner 1996

Martin Löbbing, Ingo Wegener: The Number of Knight's Tours Equals 33, 439, 123, 484, 294 --- Counting with Binary Decision Diagrams. Electr. J. Comb. 3(1) (1996)

Beate Bollig, Martin Löbbing, Ingo Wegener: On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. Inf. Process. Lett. 59(5): 233-239 (1996)

Ingo Wegener: On the Complexity of Encoding in Analog Circuits. Inf. Process. Lett. 60(1): 49-52 (1996)

Beate Bollig, Ingo Wegener: Improving the Variable Ordering of OBDDs Is NP-Complete. IEEE Trans. Computers 45(9): 993-1002 (1996)

Martin Sauerhoff, Ingo Wegener: On the complexity of minimizing the OBDD size for incompletely specified functions. IEEE Trans. on CAD of Integrated Circuits and Systems 15(11): 1435-1437 (1996)

Beate Bollig, Ingo Wegener: Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. STACS 1996: 491-502

Martin Sauerhoff, Ingo Wegener, Ralph Werchner: Optimal Ordered Binary Decision Diagrams for Tree-like Circuits. Electronic Colloquium on Computational Complexity (ECCC) 3(22) (1996)

Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener: Optimal attribute-efficient learning of disjunction, parity, and threshold functions. Electronic Colloquium on Computational Complexity (ECCC) 3(61) (1996)

Ingo Wegener: Didaktische Überlegungen zu einer algorithmenorientierten Einführung in die Theoretische Informatik. Informatik Spektrum 18(2): 79-83 (1995)

Detlef Sieling, Ingo Wegener: Graph Driven BDDs - A New Data Structure for Boolean Functions. Theor. Comput. Sci. 141(1&2): 283-310 (1995)

Beate Bollig, Ingo Wegener: Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. Electronic Colloquium on Computational Complexity (ECCC) 2(42) (1995)

Martin Löbbing, Ingo Wegener: The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams. Electronic Colloquium on Computational Complexity (ECCC) 2(47) (1995)

Axel Conrad, Tanja Hindrichs, Hussein Morsy, Ingo Wegener: Solution of the knight's Hamiltonian path problem on chessboards. Discrete Applied Mathematics 50(2): 125-134 (1994)

Ingo Wegener: Efficient data structures for Boolean functions. Discrete Mathematics 136(1-3): 347-372 (1994)

Johan Håstad, Ingo Wegener, Norbert Wurm, Sang-Zin Yi: Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC⁰. Inf. Comput. 108(2): 200-211 (1994)

Ingo Wegener: Comments on "A Characterization of Binary Decision Diagrams". IEEE Trans. Computers 43(3): 383-384 (1994)

Ingo Wegener: The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions. IEEE Trans. Computers 43(11): 1262-1269 (1994)

Petr Savický, Ingo Wegener: Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. FSTTCS 1994: 390-401

Detlef Sieling, Ingo Wegener: New Lower Bounds and Hierarchy Results for Restricted Branching Programs. WG 1994: 359-370

Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener: On the Power of Different Types of Restricted Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 1(26) (1994)

Ingo Wegener: Theoretische Informatik - eine algorithmenorientierte Einführung. Leitfäden und Monographien der Informatik, Teubner 1993, isbn 978-3-519-02123-0, pp. I-IX, 1-235

Ingo Wegener: A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly. Comput. J. 36(3): 286-288 (1993)

Ingo Wegener: Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions. Inf. Process. Lett. 46(2): 85-87 (1993)

Detlef Sieling, Ingo Wegener: Reduction of OBDDs in Linear Time. Inf. Process. Lett. 48(3): 139-144 (1993)

Detlef Sieling, Ingo Wegener: NC-Algorithms for Operations on Binary Decision Diagrams. Parallel Processing Letters 3: 3-12 (1993)

Ingo Wegener: BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small). Theor. Comput. Sci. 118(1): 81-98 (1993)

Ingo Wegener: The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. WG 1993: 252-263

Ingo Wegener: How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates? Elektronische Informationsverarbeitung und Kybernetik 28(2): 79-82 (1992)

Ingo Wegener: The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n. Inf. Comput. 97(1): 86-96 (1992)

Jürg Nievergelt, Lutz Prechelt, Ingo Wegener: Das Springerproblem. Informatik Spektrum 15(3): 169-172 (1992)

Katja Lenz, Ingo Wegener: The Conjunctive Complexity of Quadratic Boolean Functions. Theor. Comput. Sci. 81(2): 257-268 (1991)

Ingo Wegener: The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits. Theor. Comput. Sci. 85(1): 155-170 (1991)

Ingo Wegener: The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. STACS 1991: 137-147

Ingo Wegener: Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt. Informatik Spektrum 13(6): 321-330 (1990)

Ingo Wegener: Efficient Simulation of Circuits by Erew Prams. Inf. Process. Lett. 35(2): 99-102 (1990)

Ingo Wegener: Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). MFCS 1990: 516-522

Ingo Wegener, Norbert Wurm, Sang-Zin Yi: Symmetric Functions in AC⁰A Can Be Computed in Constant Depth With Very Small Size. MFCS 1990: 523-529

Ingo Wegener: Effiziente Algorithmen für grundlegende Funktionen. Leitfäden und Monographien der Informatik, Teubner 1989, isbn 978-3-519-02276-3, pp. I-IX, 1-261

Ingo Wegener, László Zádori: A Note on the Relations Between Critical and Sensitive Complexity. Elektronische Informationsverarbeitung und Kybernetik 25(8/9): 417-421 (1989)

Bernd Voigt, Ingo Wegener: Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple. Inf. Comput. 83(1): 65-79 (1989)

Ingo Wegener: Prime implicants and parallel complexity. Bulletin of the EATCS 35: 198-204 (1988)

Ingo Wegener: On the complexity of branching programs and decision trees for clique functions. J. ACM 35(2): 461-471 (1988)

Bernd Voigt, Ingo Wegener: A Remark on Minimal Polynomials of Boolean Functions. CSL 1988: 372-383

Ingo Wegener: The complexity of Boolean functions. Wiley-Teubner 1987

Ingo Wegener: The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits. Elektronische Informationsverarbeitung und Kybernetik 23(10/11): 537-543 (1987)

Bettina Brustmann, Ingo Wegener: The Complexity of Symmetric Functions in Bounded-Depth Circuits. Inf. Process. Lett. 25(4): 217-219 (1987)

Ingo Wegener: The Complexity of Symmetric Boolean Functions. Computation Theory and Logic 1987: 433-442

Katja Lenz, Ingo Wegener: The Conjunctive Complexity of Quadratic Boolean Functions. CSL 1987: 138-150

Ingo Wegener: On the Complexity of Branching Programs and Decision Trees for Clique Functions. TAPSOFT, Vol.1 1987: 1-12

Mike Paterson, Ingo Wegener: Nearly Optimal Hierarchies for Network and Formula Size. Acta Inf. 23(2): 217-221 (1986)

Ingo Wegener: Time-Space Trade-offs for Branching Programs. J. Comput. Syst. Sci. 32(1): 91-96 (1986)

Ingo Wegener: More on the Complexity of Slice Functions. Theor. Comput. Sci. 43: 201-211 (1986)

Siegfried Bublitz, Ute Schürfeld, Ingo Wegener: Properties of Complexity Measures for Prams and Wrams. Theor. Comput. Sci. 48(3): 53-73 (1986)

Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener: Properties of Complexity Measures for PRAMs and WRAMs. MFCS 1986: 230-238

Ingo Wegener: The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties. Information and Control 67(1-3): 212-222 (1985)

Ingo Wegener: Optimal Search With Positive Switch Cost is NP-Hard. Inf. Process. Lett. 21(1): 49-52 (1985)

Ingo Wegener: On the Complexity of Slice Functions. Theor. Comput. Sci. 38: 55-68 (1985)

Ingo Wegener: The critical complexity of all (monotone) Boolean functions and monotone graph properties. FCT 1985: 494-502

Ingo Wegener: Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. Information and Control 62(2/3): 129-143 (1984)

Ingo Wegener: Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. CAAP 1984: 313-325

Ingo Wegener: On the Complexity of Slice Functions. MFCS 1984: 553-561

Ingo Wegener: Relating Monotone Formula Size and Monotone Depth of Boolean Functions. Inf. Process. Lett. 16(1): 41-42 (1983)

Ingo Wegener: Proving lower bounds of the monotone complexity of Boolean functions. Logic and Machines 1983: 446-456

Ingo Wegener: Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic. Inf. Process. Lett. 15(2): 81-83 (1982)

Ingo Wegener: Boolean Functions whose Monotone Complexity is of Size n2/log n. Theor. Comput. Sci. 21: 213-224 (1982)

Ingo Wegener: An Improved Complexity Hierarchy on the Depth of Boolean Functions. Acta Inf. 15: 147-152 (1981)

Ingo Wegener: Boolean Functions Whose Monotone Complexity is of Size n²/log n. Theoretical Computer Science 1981: 22-31

Ingo Wegener: A new Lower Bound on the Monotone Network Complexity of Boolean Sums. Acta Inf. 13: 109-114 (1980)

Ingo Wegener: Switching Functions Whose Monotone Complexity is Nearly Quadratic. Theor. Comput. Sci. 9: 83-97 (1979)

Ingo Wegener: A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. Theor. Comput. Sci. 9: 147-150 (1979)

Ingo Wegener: Switching Functions Whose Monotone Complexity Is Nearly Quadratic. STOC 1978: 143-149