The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ingo Wegener: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ingo Wegener
    Randomized Search Heuristics as an Alternative to Exact Optimization. [Citation Graph (0, 0)][DBLP]
    Logic versus Approximation, 2004, pp:138-149 [Conf]
  2. Ingo Wegener
    The Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:433-442 [Conf]
  3. 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]
  4. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:172-183 [Conf]
  5. Ingo Wegener, Philipp Woelfel
    New Results on the Complexity of the Middle Bit of Multiplication. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:100-110 [Conf]
  6. Katja Lenz, Ingo Wegener
    The Conjunctive Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:138-150 [Conf]
  7. Bernd Voigt, Ingo Wegener
    A Remark on Minimal Polynomials of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:372-383 [Conf]
  8. Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo Wegener, Yuan Lu
    Analysis of composition complexity and how to obtain smaller canonical graphs. [Citation Graph (0, 0)][DBLP]
    DAC, 2000, pp:681-686 [Conf]
  9. Thomas Jansen, Ingo Wegener
    On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:184-193 [Conf]
  10. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
    Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:171-184 [Conf]
  11. 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]
  12. 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]
  13. Stefan Droste, Thomas Jansen, Ingo Wegener
    Perhaps Not a Free Lunch But At Least a Free Appetizer. [Citation Graph (0, 0)][DBLP]
    GECCO, 1999, pp:833-839 [Conf]
  14. Simon Fischer, Ingo Wegener
    The Ising Model on the Ring: Mutation Versus Recombination. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:1113-1124 [Conf]
  15. Oliver Giel, Ingo Wegener
    Maximum cardinality matchings on trees by randomized local search. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:539-546 [Conf]
  16. Thomas Jansen, Ingo Wegener
    On the local performance of simulated annealing and the (1+1) evolutionary algorithm. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:469-476 [Conf]
  17. Frank Neumann, Ingo Wegener
    Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    GECCO (1), 2004, pp:713-724 [Conf]
  18. Frank Neumann, Ingo Wegener
    Minimum spanning trees made easier via multi-objective optimization. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:763-769 [Conf]
  19. Tobias Storch, Ingo Wegener
    Real Royal Road Functions for Constant Population Size. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:1406-1417 [Conf]
  20. Ingo Wegener, Carsten Witt
    On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:622-633 [Conf]
  21. Beate Bollig, Ingo Wegener
    Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:187-198 [Conf]
  22. Juraj Hromkovic, Ingo Wegener
    Introduction: Workshop on Boolean Functions and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:227-228 [Conf]
  23. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the Variable Ordering Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:493-502 [Conf]
  24. Ingo Wegener
    Theoretical Aspects of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:64-78 [Conf]
  25. Ingo Wegener
    Simulated Annealing Beats Metropolis in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:589-601 [Conf]
  26. Ingo Wegener
    Proving lower bounds of the monotone complexity of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:446-456 [Conf]
  27. Beate Bollig, Ingo Wegener
    Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:159-168 [Conf]
  28. Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener
    Properties of Complexity Measures for PRAMs and WRAMs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:230-238 [Conf]
  29. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
    On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:319-326 [Conf]
  30. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:612-621 [Conf]
  31. Ingo Wegener
    Towards a Theory of Randomized Search Heuristics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:125-141 [Conf]
  32. Ingo Wegener
    On the Complexity of Slice Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:553-561 [Conf]
  33. 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]
  34. Ingo Wegener, Norbert Wurm, Sang-Zin Yi
    Symmetric Functions in AC0A Can Be Computed in Constant Depth With Very Small Size. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:523-529 [Conf]
  35. 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. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:21-30 [Conf]
  36. 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. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:31-40 [Conf]
  37. Stefan Droste, Dominic Heutelbeck, Ingo Wegener
    Distributed Hybrid Genetic Programming for Learning Boolean Functions. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:181-190 [Conf]
  38. Stefan Droste, Thomas Jansen, Ingo Wegener
    On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. [Citation Graph (0, 0)][DBLP]
    PPSN, 1998, pp:13-22 [Conf]
  39. Thomas Jansen, Ingo Wegener
    On the Choice of the Mutation Probability for the (1+1) EA. [Citation Graph (0, 0)][DBLP]
    PPSN, 2000, pp:89-98 [Conf]
  40. Jens Scharnow, Karsten Tinnefeld, Ingo Wegener
    Fitness Landscapes Based on Sorting and Shortest Paths Problems. [Citation Graph (0, 0)][DBLP]
    PPSN, 2002, pp:54-63 [Conf]
  41. Beate Bollig, Ingo Wegener
    Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:491-502 [Conf]
  42. Stefan Edelkamp, Ingo Wegener
    On the Performance of WEAK-HEAPSORT. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:254-266 [Conf]
  43. Oliver Giel, Ingo Wegener
    Evolutionary Algorithms and the Maximum Matching Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:415-426 [Conf]
  44. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
    Relating Branching Program Size and Formula Size over the Full Binary Basis. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:57-67 [Conf]
  45. 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]
  46. Ingo Wegener
    Switching Functions Whose Monotone Complexity Is Nearly Quadratic [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:143-149 [Conf]
  47. 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]
  48. 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]
  49. Detlef Sieling, Ingo Wegener
    New Lower Bounds and Hierarchy Results for Restricted Branching Programs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:359-370 [Conf]
  50. Ingo Wegener
    On the Expected Runtime and the Success Probability of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:1-10 [Conf]
  51. 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]
  52. Mike Paterson, Ingo Wegener
    Nearly Optimal Hierarchies for Network and Formula Size. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:2, pp:217-221 [Journal]
  53. 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]
  54. 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]
  55. 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]
  56. Thomas Jansen, Ingo Wegener
    The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:47-66 [Journal]
  57. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
    On P versus NP cap co-NP for decision trees and read-once branching programs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:4, pp:357-370 [Journal]
  58. Ingo Wegener
    A Simple Modification of Xunrang and Yuzhang's HEAPSORT Variant Improving its Complexity Significantly. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:3, pp:286-288 [Journal]
  59. Martin Löbbing, Ingo Wegener
    The Number of Knight's Tours Equals 33, 439, 123, 484, 294 --- Counting with Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  60. Ingo Wegener, Carsten Witt
    On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:225-247 [Journal]
  61. Axel Conrad, Tanja Hindrichs, Hussein Morsy, Ingo Wegener
    Solution of the knight's Hamiltonian path problem on chessboards. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:125-134 [Journal]
  62. Paul Fischer, Norbert Klasner, Ingo Wegener
    On the Cut-off Point for Combinatorial Group Testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:83-92 [Journal]
  63. Thomas Jansen, Ingo Wegener
    Real royal road functions--where crossover provably is essential. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:111-125 [Journal]
  64. Olaf Kyek, Ian Parberry, Ingo Wegener
    Bounds on the Number of Knight's Tours. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:2, pp:171-181 [Journal]
  65. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
    Optimal ordered binary decision diagrams for read-once formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:237-258 [Journal]
  66. Ingo Wegener
    BDDs--design, analysis, complexity, and applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:229-251 [Journal]
  67. 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]
  68. Ingo Wegener
    Teaching Nondeterminism as a Special Case of Randomization. [Citation Graph (0, 0)][DBLP]
    Informatica Didactica, 2001, v:4, n:, pp:- [Journal]
  69. Ingo Wegener
    Prime implicants and parallel complexity. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:198-204 [Journal]
  70. Stefan Droste, Thomas Jansen, Ingo Wegener
    A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 1998, v:6, n:2, pp:185-196 [Journal]
  71. Thomas Jansen, Kenneth A. De Jong, Ingo Wegener
    On the Choice of the Offspring Population Size in Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 2005, v:13, n:4, pp:413-440 [Journal]
  72. Beate Bollig, Ingo Wegener
    Approximability and Nonapproximability by Binary Decision Diagrams [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:52, pp:- [Journal]
  73. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On Converting CNF to DNF [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:017, pp:- [Journal]
  74. Stefan Droste, Thomas Jansen, Ingo Wegener
    Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:048, pp:- [Journal]
  75. Oliver Giel, Ingo Wegener
    Searching Randomly for Maximum Matchings [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:076, pp:- [Journal]
  76. Ingo Wegener
    Simulated Annealing Beats Metropolis in Combinatorial Optimization [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:089, pp:- [Journal]
  77. 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]
  78. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
    On the Power of Different Types of Restricted Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:26, pp:- [Journal]
  79. Martin Löbbing, Ingo Wegener
    The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:47, pp:- [Journal]
  80. Martin Sauerhoff, Ingo Wegener, Ralph Werchner
    Optimal Ordered Binary Decision Diagrams for Tree-like Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:22, pp:- [Journal]
  81. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
    Optimal attribute-efficient learning of disjunction, parity, and threshold functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:61, pp:- [Journal]
  82. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
    On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:23, pp:- [Journal]
  83. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the variable ordering problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:11, pp:- [Journal]
  84. 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]
  85. 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]
  86. 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]
  87. 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]
  88. 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]
  89. Detlef Sieling, Ingo Wegener
    A Comparison of Free BDDs and Transformed BDDs. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2001, v:19, n:3, pp:223-236 [Journal]
  90. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:263-278 [Journal]
  91. Beate Bollig, Ingo Wegener
    Completeness and Non-Completeness Results with Respect to Read-Once Projections. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:1, pp:24-33 [Journal]
  92. Johan Håstad, Ingo Wegener, Norbert Wurm, Sang-Zin Yi
    Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:108, n:2, pp:200-211 [Journal]
  93. Matthias Krause, Petr Savický, Ingo Wegener
    On the influence of the variable ordering for algorithmic learning using OBDDs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:201, n:2, pp:160-177 [Journal]
  94. 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]
  95. 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]
  96. 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]
  97. 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]
  98. Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener
    Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2002, v:25, n:6, pp:488-502 [Journal]
  99. Jürg Nievergelt, Lutz Prechelt, Ingo Wegener
    Das Springerproblem. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1992, v:15, n:3, pp:169-172 [Journal]
  100. Ingo Wegener
    Rankings oder Ratings: Warum, wie und durch wen?. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2005, v:28, n:2, pp:129-130 [Journal]
  101. Ingo Wegener
    Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1990, v:13, n:6, pp:321-330 [Journal]
  102. Ingo Wegener
    Didaktische Überlegungen zu einer algorithmenorientierten Einführung in die Theoretische Informatik. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1995, v:18, n:2, pp:79-83 [Journal]
  103. Beate Bollig, Martin Löbbing, Ingo Wegener
    On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:5, pp:233-239 [Journal]
  104. Beate Bollig, Ingo Wegener
    Functions that have read-once branching programs of quadratic size are not necessarily testable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:25-29 [Journal]
  105. Beate Bollig, Ingo Wegener
    A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:2, pp:53-57 [Journal]
  106. Bettina Brustmann, Ingo Wegener
    The Complexity of Symmetric Functions in Bounded-Depth Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:217-219 [Journal]
  107. Martin Löbbing, Detlef Sieling, Ingo Wegener
    Parity OBDDs Cannot be Handled Efficiently Enough. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:4, pp:163-168 [Journal]
  108. Detlef Sieling, Ingo Wegener
    Reduction of OBDDs in Linear Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:3, pp:139-144 [Journal]
  109. Ingo Wegener
    Worst case examples for operations on OBDDs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:3-4, pp:91-96 [Journal]
  110. 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]
  111. 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]
  112. 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]
  113. Ingo Wegener
    Optimal Search With Positive Switch Cost is NP-Hard. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:1, pp:49-52 [Journal]
  114. Ingo Wegener
    Efficient Simulation of Circuits by Erew Prams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:2, pp:99-102 [Journal]
  115. Ingo Wegener
    Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:2, pp:85-87 [Journal]
  116. Ingo Wegener
    On the Complexity of Encoding in Analog Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:1, pp:49-52 [Journal]
  117. Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener
    On the complexity of the hidden weighted bit function for various BDD models. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:103-116 [Journal]
  118. 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]
  119. 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]
  120. Ingo Wegener
    Time-Space Trade-offs for Branching Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:1, pp:91-96 [Journal]
  121. Thomas Jansen, Ingo Wegener
    On the analysis of a dynamic evolutionary algorithm. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:1, pp:181-199 [Journal]
  122. 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]
  123. 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]
  124. Beate Bollig, Ingo Wegener
    Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:4, pp:487-503 [Journal]
  125. Stefan Droste, Thomas Jansen, Ingo Wegener
    Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:4, pp:525-544 [Journal]
  126. Frank Neumann, Ingo Wegener
    Minimum spanning trees made easier via multi-objective optimization. [Citation Graph (0, 0)][DBLP]
    Natural Computing, 2006, v:5, n:3, pp:305-319 [Journal]
  127. Detlef Sieling, Ingo Wegener
    NC-Algorithms for Operations on Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:3-12 [Journal]
  128. Beate Bollig, Ingo Wegener
    Improving the Variable Ordering of OBDDs Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:9, pp:993-1002 [Journal]
  129. Jawahar Jain, Ingo Wegener, Masahiro Fujita
    A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:11, pp:1289-1290 [Journal]
  130. 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]
  131. 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]
  132. 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]
  133. Hans-Georg Beyer, Hans-Paul Schwefel, Ingo Wegener
    How to analyse evolutionary algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:1, pp:101-130 [Journal]
  134. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
    Hierarchy Theorems for kOBDDs and kIBDDs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:45-60 [Journal]
  135. Siegfried Bublitz, Ute Schürfeld, Ingo Wegener
    Properties of Complexity Measures for Prams and Wrams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:53-73 [Journal]
  136. Stefan Droste, Thomas Jansen, Ingo Wegener
    On the analysis of the (1+1) evolutionary algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:51-81 [Journal]
  137. Stefan Droste, Thomas Jansen, Ingo Wegener
    Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:1, pp:131-144 [Journal]
  138. Simon Fischer, Ingo Wegener
    The one-dimensional Ising model: Mutation versus recombination. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:2-3, pp:208-225 [Journal]
  139. Katja Lenz, Ingo Wegener
    The Conjunctive Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:257-268 [Journal]
  140. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
    On converting CNF to DNF. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:325-335 [Journal]
  141. Detlef Sieling, Ingo Wegener
    Graph Driven BDDs - A New Data Structure for Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:283-310 [Journal]
  142. Tobias Storch, Ingo Wegener
    Real royal road functions for constant population size. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:1, pp:123-134 [Journal]
  143. Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
    Identification of Partial Disjunction, Parity, and Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:230, n:1-2, pp:131-147 [Journal]
  144. Ingo Wegener
    Switching Functions Whose Monotone Complexity is Nearly Quadratic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:83-97 [Journal]
  145. 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]
  146. 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]
  147. Ingo Wegener
    On the Complexity of Slice Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:55-68 [Journal]
  148. Ingo Wegener
    More on the Complexity of Slice Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:201-211 [Journal]
  149. 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]
  150. 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]
  151. Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener
    The analysis of a recombinative hill-climber on H-IFF. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Evolutionary Computation, 2003, v:7, n:5, pp:417-423 [Journal]
  152. 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]
  153. Thorsten Bernholt, Roland Fried, Ursula Gather, Ingo Wegener
    Modified repeated median filters. [Citation Graph (0, 0)][DBLP]
    Statistics and Computing, 2006, v:16, n:2, pp:177-192 [Journal]
  154. 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]
  155. 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]
  156. 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]

  157. Precision, local search and unimodal functions. [Citation Graph (, )][DBLP]


  158. Exact OBDD Bounds for Some Fundamental Functions. [Citation Graph (, )][DBLP]


  159. Tight Bounds for Blind Search on the Integers. [Citation Graph (, )][DBLP]


  160. Editorial. [Citation Graph (, )][DBLP]


  161. Detecting high-order interactions of single nucleotide polymorphisms using genetic programming. [Citation Graph (, )][DBLP]


  162. New Results on the Complexity of the Middle Bit of Multiplication. [Citation Graph (, )][DBLP]


  163. Tight Bounds for Blind Search on the Integers [Citation Graph (, )][DBLP]


  164. Exact OBDD Bounds for some Fundamental Functions. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002