Ingo Wegener Randomized Search Heuristics as an Alternative to Exact Optimization. [Citation Graph (0, 0)][DBLP] Logic versus Approximation, 2004, pp:138-149 [Conf]
Ingo Wegener The Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP] Computation Theory and Logic, 1987, pp:433-442 [Conf]
Ingo Wegener Optimal Decisions Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP] CAAP, 1984, pp:313-325 [Conf]
Ingo Wegener The critical complexity of all (monotone) Boolean functions and monotone graph properties. [Citation Graph (0, 0)][DBLP] FCT, 1985, pp:494-502 [Conf]
Petr Savický, Ingo Wegener Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP] FSTTCS, 1994, pp:390-401 [Conf]
Ingo Wegener Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). [Citation Graph (0, 0)][DBLP] MFCS, 1990, pp:516-522 [Conf]
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. [Citation Graph (0, 0)][DBLP] STACS, 1991, pp:137-147 [Conf]
Ingo Wegener On the Complexity of Branching Programs and Decision Trees for Clique Functions. [Citation Graph (0, 0)][DBLP] TAPSOFT, Vol.1, 1987, pp:1-12 [Conf]
Ingo Wegener Boolean Functions Whose Monotone Complexity is of Size n2/log n. [Citation Graph (0, 0)][DBLP] Theoretical Computer Science, 1981, pp:22-31 [Conf]
Ingo Wegener On the Expected Runtime and the Success Probability of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP] WG, 2000, pp:1-10 [Conf]
Ingo Wegener The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. [Citation Graph (0, 0)][DBLP] WG, 1993, pp:252-263 [Conf]
Petr Savický, Ingo Wegener Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP] Acta Inf., 1997, v:34, n:4, pp:245-256 [Journal]
Ingo Wegener A new Lower Bound on the Monotone Network Complexity of Boolean Sums. [Citation Graph (0, 0)][DBLP] Acta Inf., 1980, v:13, n:, pp:109-114 [Journal]
Ingo Wegener An Improved Complexity Hierarchy on the Depth of Boolean Functions. [Citation Graph (0, 0)][DBLP] Acta Inf., 1981, v:15, n:, pp:147-152 [Journal]
Philipp Kersting, Ingo Wegener Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools. [Citation Graph (0, 0)][DBLP] Informatica Didactica, 2001, v:2, n:, pp:- [Journal]
Ingo Wegener Teaching Nondeterminism as a Special Case of Randomization. [Citation Graph (0, 0)][DBLP] Informatica Didactica, 2001, v:4, n:, pp:- [Journal]
Ingo Wegener, Philipp Woelfel New Results on the Complexity of the Middle Bit of Multiplication [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:107, pp:- [Journal]
Beate Bollig, Ingo Wegener Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:48, pp:- [Journal]
Ingo Wegener The Range of New Lower Bound Techniques for WRAMs and Bounded Depth Circuits. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:10/11, pp:537-543 [Journal]
Ingo Wegener How far Can We Count in Constant Depth with a Polylogarithmic Number of Gates? [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1992, v:28, n:2, pp:79-82 [Journal]
Ingo Wegener, Laszlo Zádori A Note on the Relations Between Critical and Sensitive Complexity. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:8/9, pp:417-421 [Journal]
Olaf Schröer, Ingo Wegener The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours. [Citation Graph (0, 0)][DBLP] Formal Methods in System Design, 1998, v:13, n:3, pp:235-253 [Journal]
Bernd Voigt, Ingo Wegener Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple [Citation Graph (0, 0)][DBLP] Inf. Comput., 1989, v:83, n:1, pp:65-79 [Journal]
Ingo Wegener Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP] Information and Control, 1984, v:62, n:2/3, pp:129-143 [Journal]
Ingo Wegener The Critical Complexity of All (Monotone) Boolean Functions and Monotone Graph Properties [Citation Graph (0, 0)][DBLP] Information and Control, 1985, v:67, n:1-3, pp:212-222 [Journal]
Ingo Wegener The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n [Citation Graph (0, 0)][DBLP] Inf. Comput., 1992, v:97, n:1, pp:86-96 [Journal]
Ingo Wegener A simplified correctness proof for a well-known algorithm computing strongly connected components. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:17-19 [Journal]
Ingo Wegener Best Possible Asymptotic Bounds on the Depth of Monotone Functions in Multivalued Logic. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1982, v:15, n:2, pp:81-83 [Journal]
Ingo Wegener Relating Monotone Formula Size and Monotone Depth of Boolean Functions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1983, v:16, n:1, pp:41-42 [Journal]
Ingo Wegener On the complexity of branching programs and decision trees for clique functions. [Citation Graph (0, 0)][DBLP] J. ACM, 1988, v:35, n:2, pp:461-471 [Journal]
Beate Bollig, Ingo Wegener Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:61, n:3, pp:558-579 [Journal]
Ingo Wegener, Carsten Witt On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2005, v:3, n:1, pp:61-78 [Journal]
Ingo Wegener Bundeswettbewerb Informatik - Die Aufgaben der Endrunden 1996 und 1997. [Citation Graph (0, 0)][DBLP] LOG IN, 1997, v:17, n:6, pp:29-0 [Journal]
Ingo Wegener Comments on "A Characterization of Binary Decision Diagrams". [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:3, pp:383-384 [Journal]
Ingo Wegener The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:11, pp:1262-1269 [Journal]
Martin Sauerhoff, Ingo Wegener On the complexity of minimizing the OBDD size for incompletely specified functions. [Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:11, pp:1435-1437 [Journal]
Ingo Wegener A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1979, v:9, n:, pp:147-150 [Journal]
Ingo Wegener Boolean Functions whose Monotone Complexity is of Size n2/log n. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:21, n:, pp:213-224 [Journal]
Ingo Wegener The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:85, n:1, pp:155-170 [Journal]
Ingo Wegener BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small). [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:118, n:1, pp:81-98 [Journal]
Thomas Jansen, Ingo Wegener Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. [Citation Graph (0, 0)][DBLP] IEEE Trans. Evolutionary Computation, 2001, v:5, n:6, pp:589-599 [Journal]
Ingo Wegener Efficient data structures for Boolean functions. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:136, n:1-3, pp:347-372 [Journal]
Frank Neumann, Ingo Wegener Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:378, n:1, pp:32-40 [Journal]
Thomas Jansen, Ingo Wegener A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:386, n:1-2, pp:73-93 [Journal]
Precision, local search and unimodal functions. [Citation Graph (, )][DBLP]
Exact OBDD Bounds for Some Fundamental Functions. [Citation Graph (, )][DBLP]
Tight Bounds for Blind Search on the Integers. [Citation Graph (, )][DBLP]