Sprungmarken

Servicenavigation

       

Hauptnavigation

Bereichsnavigation

Hauptinhalt

Schriftenverzeichnis Prof. Dr. Ingo Wegener

Zurück zur Homepage

Bücher/Books

  1. gem. mit R.Ahlswede:
    Suchprobleme (328 S.),
    Teubner, 1979.

  2. gem. mit R. Ahlswede:
    Zadatsi poiska (367 S.),
    MIR-Verlag, Moskau, 1982.

  3. gem. mit R. Ahlswede:
    Search Problems (284 S.),
    Wiley, 1987.

  4. The Complexity of Boolean Functions (457 S.),
    Wiley-Teubner, 1987.
    (Electronic version of this book;available for free.)

  5. Effiziente Algorithmen für grundlegende Funktionen (261 S.),
    Teubner, 1989, 2. Auflage, 1996.
    (Electronic version of this book;available for free.)

  6. Theoretische Informatik - eine algorithmenorientierte Einführung (235 S.),
    Teubner, 1993, 2. Auflage 1999, 3. Auflage 2005.

  7. Kompendium Theoretische Informatik - eine Ideensammlung (189 S.),
    Teubner, 1996, 2. Auflage 2001.

  8. gem. mit H.-J. Appelrath, D. Boles und V. Claus:
    Starthilfe Informatik (158 S.),
    Teubner, 1998.

  9. Branching Programs and Binary Decision Diagrams - Theory and Applications (408 S.),
    SIAM Monographs on Discrete Mathematics and Applications, 2000.

  10. Komplexitätstheorie - Grenzen der Effizienz von Algorithmen (321 S.),
    Springer, 2003.

  11. Complexity Theory - Exploring the Limits of Efficient Algorithms (308 S.),
    Springer, 2005.

  12. Complexity Theory - (chines. Lizenzausgabe),
    Science Press, 2006.

Bücher als Herausgeber

  1. Highlights aus der Informatik (335 S.),
    Springer, 1996.

  2. gem. mit I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M.S. Pinsker, A. Sarközy und Z. Zhang:
    Numbers, Information and Complexity,
    Kluwer Academic Publishers, 2000.

  3. gem. mit H.-P. Schwefel und K. Weinert:
    Advances in Computational Intelligence Theory and Practice,
    Springer, 2003.

  4. gem. mit M. Bugliesi, B. Preneel und V. Sassone:
    Automata, Language and Programming,
    Proc. of 33rd ICALP, Part I, LNCS 4051, Springer, 2006.

  5. gem. mit M. Bugliesi, B. Preneel und V. Sassone
    Automata, Languages and Programming, Proc. of 33rd
    ICALP, Part II, LNCS 4052, Springer, 2006.

Zeitschriften und Tagungsbände/Journal and conference papers
Preprints von noch unveröffentlichten Artikeln können als PS-Dateien geladen werden.
Preprints of papers not yet published are available as PS-files.

  1. Switching functions whose monotone complexity is nearly quadratic,
    Theoretical Computer Science 9, 83-97, 1979
    (auch: 10. STOC, 143-149, 1978 und in russ.
    Übersetzung in Kybernetiveskii Sbornik 18, 55-74, 1981).

  2. A counterexample to a conjecture of Schnorr referring to monotone networks,
    Theoretical Computer Science 9, 147-150, 1979.

  3. On separating systems whose elements are sets of at most k elements,
    Discrete Mathematics 28, 219-222, 1979.

  4. Some results on a discrete search problem,
    6. Conference on Probability Theory, Brasov, 473-487, 1979.

  5. A new lower bound on the monotone network complexity of Boolean sums,
    Acta Informatica 13, 109-114, 1980.

  6. The discrete sequential search problem with nonrandom cost and overlook probabilities,
    Mathematics of Operations Research 5, 373-380, 1980.

  7. An improved complexity hierarchy on the depth of Boolean functions,
    Acta Informatica 15, 147-152, 1981.

  8. Optimal sequential search with discounted income,
    Journal of Information and Optimization Sciences 2, 1-18, 1981.

  9. The construction of an optimal distribution of search effort,
    Naval Research Logistics Quarterly 28, 533-543, 1981.

  10. gem. mit U.Lössner:
    Discrete sequential search with positive switch cost,
    Mathematics of Operations Research 7, 426-440, 1982
    (auch: 7. Symp. Operations Research, Methods of Operations
    Research 45, 391-401, 1982).

  11. The discrete search problem and the construction of optimal allocations,
    Naval Research Logistics Quarterly 29, 203-212, 1982.

  12. Best possible asymptotic bounds on the depth of monotone functions in multivalued logic,
    Information Processing Letters 15, 81-83, 1982.

  13. Boolean functions whose monotone complexity is of size n2/log(n),
    Theoretical Computer Science 21, 213-224, 1982
    (auch: 5. GI Conf. Theoretical Computer Science, LNCS 104,
    22-31, 1981.
    Und: In russ. Übersetzung in Kybernetiveskii Sbornik 21, 69-84, 1984).

  14. Relating monotone formula size and monotone depth of Boolean functions,
    Information Processing Letters 16, 41-42, 1983.

  15. Proving lower bounds on the monotone complexity of Boolean functions,
    Logic and Machines: Decision Problems and Complexity, LNCS 171,
    446-456, 1984.

  16. Optimal decision trees and one-time-only branching programs for symmetric Boolean functions,
    Information and Control 62, 129-143, 1984
    (auch: Proc. 9. CAAP, Cambridge University Press, 313-326, 1984).

  17. Optimal search with positive switch cost is NP-hard,
    Information Processing Letters 21, 49-52, 1985.

  18. On the complexity of slice functions,
    Theoretical Computer Science 38, 55-68, 1985
    (auch: 11. MFCS, LNCS 176, 553-561, 1984).

  19. The critical complexity of all (monotone) Boolean functions and monotone graph properties,
    Information and Control 67, 212-222, 1985
    (auch: FCT'85, LNCS 199, 494-502, 1985).

  20. gem. mit J.Jaschinski:
    Optimal search for a definite of many objects,
    9. Symp. Operations Research, Methods of
    Operations Research 49, 39-46, 1985.

  21. Time-space trade-offs for branching programs,
    Journal of Computer and System Sciences 32, 91-96, 1986.

  22. gem. mit M.Paterson:
    Nearly optimal hierarchies for network and formula size,
    Acta Informatica 23, 217-221, 1986.

  23. gem. mit U.Schürfeld:
    On the CREW PRAM complexity of Boolean functions,
    Parallel Computing '85, North Holland, 247-252, 1986.

  24. More on the complexity of slice functions,
    Theoretical Computer Science 43, 201-211, 1986.

  25. gem. mit S.Bublitz, U.Schürfeld, B.Voigt:
    Properties of complexity measures for PRAMs and WRAMs,
    Theoretical Computer Science 48, 53-73, 1987
    (auch: 12. MFCS, LNCS 233, 230-238, 1986).

  26. gem. mit B.Brustmann:
    The complexity of symmetric functions in bounded-depth circuits,
    Information Processing Letters 25, 217-219, 1987.

  27. The range of new lower bound techniques for WRAMs and bounded depth circuits,
    EIK-Journal of Information Processing and Cybernetics 23, 537-543, 1987.

  28. The complexity of symmetric Boolean functions,
    Logic and Computation Theory, LNCS 270, 433-442, 1987.

  29. On the complexity of branching programs and decision trees for clique functions,
    Journal of the ACM 35, 461-471, 1988
    (auch TAPSOFT '87 - CAAP '87, LNCS 249, 1-12, 1987).

  30. Prime implicants and parallel complexity,
    EATCS Bulletin 35, 198-204, 1988.

  31. gem. mit B.Voigt:
    Minimal polynomials for the conjunction of functions on disjoint variables can be very simple,
    Information and Computation 83, 65-79, 1989.

  32. gem. mit B.Voigt:
    A remark on minimal polynomials of Boolean functions,
    2. Workshop on Computer Science Logic, LNCS 385, 372-383, 1989.

  33. gem. mit L.Zádori:
    A note on the relations between critical and sensitive complexity,
    EIK-Journal of Information Processing and Cybernetics 25, 417-421, 1989.

  34. Efficient simulation of circuits by EREW PRAMs,
    Information Processing Letters 35, 99-102, 1990.

  35. gem. mit K.Lenz:
    The conjunctive complexity of quadratic Boolean functions,
    Theoretical Computer Science 81, 257-268, 1991
    (auch 1. Workshop on Computer Science Logic, LNCS 329, 138-150, 1988).

  36. The complexity of the parity function in unbounded fan-in, unbounded depth circuits,
    Theoretical Computer Science 85, 155-170, 1991.

  37. gem. mit N.Wurm u. S.Yi:
    Symmetric functions in AC0 can be computed in constant depth with very small size,
    London Mathematical Society, Lecture Note Series 169, Cambridge
    University Press, 129-139, 1992
    (auch MFCS'90, LNCS 452, 523-529, 1990).

  38. The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n,
    Information and Computation 97, 86-96, 1992
    (auch STACS'91, LNCS 480, 137-147, 1991).

  39. How far can we count in constant depth with a polylogarithmic number of gates?,
    EIK-Journal of Information Processing and Cybernetics 28, 79-82, 1992.

  40. BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small),
    Theoretical Computer Science 118, 81-98, 1993
    (auch MFCS'90, LNCS 452, 516-522, 1990).

  41. A simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantly,
    The Computer Journal 36, 286-288, 1993.

  42. gem. mit D.Sieling:
    NC-algorithms for operations on binary decision diagrams,
    Parallel Processing Letters 3, 3-12, 1993.

  43. gem. mit D.Sieling:
    Reduction of OBDDs in linear time,
    Information Processing Letters 48, 139-144, 1993.

  44. Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions,
    Information Processing Letters 46, 85-87, 1993.

  45. gem. mit J.Håstad, N.Wurm, S.Yi:
    Optimal depth, very small size circuits for symmetric functions in AC0,
    Information and Computation 108, 200-211, 1994.

  46. gem. mit A.Conrad, T.Hindrichs, H.Morsy:
    Solution of the knight's Hamiltonian path problem on chessboards,
    Discrete Applied Mathematics 50, 125-134, 1994.

  47. Efficient data structures for Boolean functions,
    Discrete Mathematics 136, 347-372, 1994
    (auch in Trends in Discrete Mathematics, Topics in
    Discrete Mathematics 9, North-Holland, 347-372, 1995).

  48. The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions,
    IEEE Trans. of Computers 43 (11), 1262-1269, 1994
    (auch 19. Int. Workshop on Graph-Theoretic Concepts
    in Computer Science WG '93, LNCS 790, 252-263, 1994).

  49. Comments on "A characterization of binary decision diagrams",
    IEEE Transactions on Computers 43 (4), 383-384, 1994.

  50. gem. mit B.Bollig und P.Savický:
    On the improvement of variable orderings for OBDDs,
    IFIP Workshop on Logic and Architecture Synthesis, Grenoble, 71-80, 1994.

  51. gem. mit D.Sieling:
    New lower bounds and hierarchy results for restricted branching programs,
    Proc. of 20th Int. Workshop WG'94, Graph-Theoretic Concepts in Computer
    Science, LNCS 903, 359-370, 1995.

  52. gem. mit D.Sieling:
    Graph driven BDD's - a new data structure for Boolean functions,
    Theoretical Computer Science 141, 283-310, 1995.

  53. gem. mit B.Bollig und M.Löbbing:
    Simulated annealing to improve variable orderings for OBDDs,
    Proc. of the International Workshop on Logic
    Synthesis (IWLS 95), (5-1)-(5-10), 1995.

  54. gem. mit B.Bollig, M.Löbbing und M.Sauerhoff:
    Complexity theoretical aspects of OFDDs,
    Representation of Discrete Functions (Hrsg. T. Sasao und M. Fujita),
    249-268, Kluwer Academic Publishers, 1996
    (auch Proc. IFIP Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 198-205, 1995).

  55. Unbounded fan-in circuits,
    Advances in the Theory of Computation and Computational Mathematics
    (Ed. Lee L. Keener), 123-153,
    Ablex Publishing Corporation, Norwood, NewJersey, 1996.

  56. gem. mit M.Löbbing:
    The number of knight's tours equals 33, 439, 123, 484, 294 - counting with binary decision diagrams,
    The Electronic Journal of Combinatorics 3, #R5, 1996.

  57. gem. mit B.Bollig:
    Read-once projections and formal circuit verification with binary decision diagrams,
    STACS'96, LNCS 1046, 491-502, 1996.

  58. gem. mit B.Bollig:
    Improving the variable ordering of OBDDs is NP-complete,
    IEEE Trans. on Computers 45 (9), 993-1002, 1996.

  59. gem. mit B.Bollig und M.Löbbing:
    On the effect of local changes in the variable ordering of ordered decision diagrams,
    Information Processing Letters 59, 233-239, 1996.

  60. On the complexity of encoding in analog circuits,
    Information Processing Letters 60, 49-52, 1996.

  61. gem. mit M.Sauerhoff:
    On the complexity of minimizing the OBDD size for incompletely specified functions,
    IEEE Trans. on Computer-Aided Design of Integrated Circuits and
    Systems, 15 (11), 1435-1437, 1996.

  62. gem. mit P.Savický:
    Efficient algorithms for the transformation between different types of binary decision diagrams,
    Acta Informatica 34, 245-256, 1997
    (auch: Proc. of 14. Conf. on the Foundations of Software Technology and Theoretical Computer Science, LNCS 880, 390-401, 1994).

  63. gem. mit O.Kyek und I.Parberry:
    Bounds on the number of knight's tours,
    Discrete Applied Mathematics 74, 171-181, 1997.

  64. gem. mit B.Bollig:
    Partitioned BDDs vs. other BDD models,
    Proc. of the International Workshop on Logic Synthesis, IWLS 97, 1997.

  65. gem. mit O.Schröer:
    The theory of zero-suppressed BDDs and the number of knight's tours,
    Formal Methods in System Design, 13, 235-253, 1998
    (Tagungsversion mit M.Löbbing und O.Schröer, Proc. IFIP Workshop on Applications of the Reed-Muller Expansion in Circuit Design, 38-45, 1995).

  66. gem. mit B.Bollig, M.Sauerhoff und D.Sieling:
    Hierarchy theorems for kOBDDs and kIBDDs,
    Theoretical Computer Science 205, 45-60, 1998.

  67. gem. mit D.Sieling:
    On the representation of partially symmetric Boolean functions by ordered multiple valued decision diagrams,
    Multiple-Valued Logic 4, 63-96, 1998.

  68. gem. mit B.Bollig:
    Completeness and non-completeness results with respect to read-once projections,
    Information and Computation 143, 24-33, 1998.

  69. gem. mit S.Droste und T. Jansen:
    A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs,
    Evolutionary Computation 6, 185-196, 1998.
    (auch: A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with Boolean inputs,
    WCCI 98 - Int. Conf. on Evolutionary Computation ICEC 98, 499-504).

  70. gem. mit B.Bollig:
    A very simple function that requires exponential size read-once branching programs,
    Information Processing Letters 66, 53-57, 1998.

  71. gem. mit M.Löbbing und D.Sieling:
    Parity OBDDs cannot be handled efficiently enough,
    Information Processing Letters 67, 163-168, 1998.

  72. gem. mit S.Droste und T.Jansen:
    On the optimization of unimodal functions with the (1+1) evolutionary algorithm,
    Parallel Problem Solving from Nature - PPSN V, LNCS 1498, 13-22, 1998.

  73. gem. mit B.Bollig:
    Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams,
    Theory of Computing Systems, 32, 487-503, 1999
    (auch Proc. of 22nd Int. Symp. on Mathematical Foundations of Computer
    Science (MFCS), LNCS 1295, 159-168, 1997).

  74. gem. mit P.Fischer und N.Klasner:
    On the cut-off point for combinatorial group testing,
    Discrete Applied Mathematics 91, 83-92, 1999.

  75. gem. mit B.Bollig, M.Löbbing und M.Sauerhoff:
    On the complexity of the hidden weighted bit function for various BDD models,
    RAIRO - Theoretical Informatics and Applications 33, 103-115, 1999.

  76. gem. mit M.Sauerhoff und R.Werchner:
    Relating branching program size and formula size over the full binary basis,
    STACS 1999, LNCS 1563, 57-67, 1999.

  77. gem. mit S.Droste und T.Jansen:
    Perhaps not a free lunch but at least a free appetizer,
    GECCO 1999, Genetic and Evolutionary Computation Conference, 833-839, 1999.

  78. gem. mit M.Krause und P.Savicky:
    Approximations by OBDDs and the variabe ordering problem,
    ICALP 1999, LNCS 1644, 493-502, 1999.

  79. gem. mit S.Jukna, A.Razborov und P.Savický:
    On P versus NP n co-NP for decision trees and read-once branching programs,
    Computational Complexity 8, 357-370, 1999
    (auch Proc. of 22nd Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS 1295, 319-326, 1997).

  80. gem. mit M.Sauerhoff und R.Werchner:
    Optimal ordered binary decision diagrams for read-once formulas,
    Discrete Applied Mathematics 103, 237-258, 2000
    (mit dem Titel Optimal ordered binary decision diagrams for fanout-free circuits
    auch in Proc. of Sixth Workshop on Synthesis and System Integration of
    Mixed Technologies (SASIMI'96), Fukuoka, Japan, 197-204).

  81. gem. mit R.Uehara und K.Tsuchida:
    Identification of partial disjunction, parity, and threshold functions,
    Theoretical Computer Science 230, 131-147, 2000
    (mit dem Titel Optimal attribute-efficient learning of disjunction,
    parity, and threshold functions auch in Proc. of the 3rd European Conference on Computational Learning Theory, EuroColt 97, LNAI 1208, 171-184, 1997).

  82. gem. mit S.Edelkamp:
    On the performance of WEAK-HEAPSORT,
    STACS'2000, LNCS 1770, 254-266, 2000.

  83. Communication complexity and BDD lower bound techniques, Numbers, Information and Complexity,
    (Hrsg. I.Althöfer, N.Cai, G. Dueck,
    L.Khachatrian, M.S.Pinsker, A.Sarhörzy, I.Wegener, Z.Zhang),
    615-628, Kluwer Academic Publishers, 2000.

  84. Worst case examples for operations on OBDDs,
    Information Processing Letters 74, 91-96, 2000.

  85. gem. mit B.Bollig:
    Asymptotically optimal lower bounds for OBDDs and the solution of some basic OBDD problems,
    Journal of Computer and System Sciences 61, 558-579, 2000.
    (auch ICALP 2000, LNCS 1853, 187-198, 2000).

  86. gem. mit J.Jain, K.Mohanram, D.Moundanos und Y.Lu:
    Analysis of composition, and how to obtain smaller canonical graphs,
    37. DAC (Design Automation Conference), 681-686, 2000.

  87. gem. mit T.Jansen:
    On the choice of the mutation probability for the (1+1)EA,
    Parallel Problem Solving from Nature - PPSN VI, LNCS 1917, 89-98, 2000.

  88. gem. mit S.Droste und D.Heutelbeck:
    Distributed hybrid genetic programming for learning Boolean functions,
    Parallel Problem Solving from Nature - PPSN VI, LNCS 1917, 181-190, 2000.

  89. On the expected runtime and the success probability of evolutionary algorithms (invited paper),
    WG'2000 (26. Workshop Graph-Theoretic Concepts in Computer Science), LNCS 1928, 1-10, 2000.

  90. gem. mit S.Droste und T.Jansen:
    A natural and simple function which is hard for all evolutionary algorithms,
    SEAL'2000 (3rd Asia Pacific Conference on Simulated Evolution and
    Learning) als Teil von IECON'2000 (Int. Conf. on Industrial Electronics, Control and Instrumentation), 2704-2709, 2000.

  91. gem. mit T.Jansen:
    On the utility of populations in evolutionary algorithms,
    GECCO 2001, Genetic and Evolutionary Computation Conference, 1034-1041, 2001.

  92. gem. mit S.Droste und T.Jansen:
    Dynamic parameter control in simple evolutionary algorithms,
    FOGA'2000, Foundations of Genetic Algorithms 6, 275-294, 2001.

  93. gem. mit D.Sieling:
    A comparison of free BDDs and transformed BDDs,
    Formal Methods in System Design 19, 223-236, 2001.

  94. gem. mit J.Jain und M.Fujita:
    A note on complexity of OBDD composition and efficiency of partitioned-OBDDs over OBDDs,
    IEEE Trans. on Computers 50, 1289-1290, 2001
    (mit dem Titel Complexity of OBDD construction and efficiency of partitioned-OBDDs over OBDDs
    auch 4. Int. Workshop on Applications of the Reed-Müller Expansion in Circuit Design (Reed-Müller '99), 157-160, 1999).

  95. gem. mit T.Jansen:
    Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness,
    IEEE Trans. on Evolutionary Computation 5, 589-599, 2001.

  96. Theoretical aspects of evolutionary algorithms
    (invited paper), ICALP 2001, LNCS 2076, 64-78, 2001.

  97. gem. mit B. Bollig und M.Sauerhoff:
    On the nonapproximability of boolean functions by OBDDs and read-k-times branching programs,
    Information and Computation 178, 263-278, 2002
    (auch 16. IEEE Conf. on Computational Complexity, 172-183, 2001).

  98. Methods for the analysis of evolutionary algorithms on pseudo-boolean functions,
    in Evolutionary Optimization (Hrsg. R.Sarker, X.Yao, and M.Mohammadian), 349-369, Kluwer, 2002.

  99. gem. mit S.Droste und T.Jansen:
    On the analysis of the (1+1) evolutionary algorithm,
    Theoretical Computer Science 276, 51-81, 2002.

  100. gem. mit T.Jansen:
    The analysis of evolutionary algorithms - a proof that crossover really can help,
    Algorithmica 34, 47-66, 2002 (auch ESA '99, LNCS 1643, 184-193, 1999).

  101. A simplified correctness proof for a well-known algorithm computing strongly connected components,
    Information Processing Letters 83, 17-19, 2002.

  102. gem. mit H.-G. Beyer und H.-P. Schwefel:
    How to analyse evolutionary algorithms,
    Theoretical Computer Science 287, 101-130, 2002.

  103. gem. mit J. Scharnow und K. Tinnefeld:
    Fitness landscapes based on sorting and shortest paths problems,
    Parallel Problem Solving from Nature - PPSN VII, LNCS 2439, 54-63, 2002, (Best Paper Award).

  104. gem. mit S.Droste und T.Jansen:
    Optimization with randomized search heuristics - The (A)NFL theorem, realistic scenarios, and difficult functions,
    Theoretical Computer Science 287, 131-144, 2002.

  105. gem. mit S. Droste, T. Jansen und K. Tinnefeld:
    A new framework for the valuation of algorithms for black-box optimization,
    FOGA 2002, Foundations of Genetic Algorithms 7, 253-270, 2003.

  106. gem. mit O.Giel:
    Evolutionary algorithms and the maximum matching problem,
    20. STACS, LNCS 2607, 415-426, 2003.

  107. gem. mit B.Bollig:
    Functions that have read-once branching programs of quadratic size are not necessarily testable,
    Information Processing Letters 87, 25-29, 2003.

  108. Towards a theory of randomized search heuristics,
    MFCS'2003, LNCS 2747, 125-141, 2003.

  109. gem. mit M.Dietzfelbinger, B. Naudts und C. van Hoyweghen:
    The analysis of a recombinative hill-climber on H-IFF,
    IEEE Trans. on Evolutionary Computation 7, 417-423, 2003.

  110. gem. mit T. Storch:
    Real royal road functions for constant population size,
    Theoretical Computer Science 320, 123-134, 2004
    (auch GECCO'2003, Generic and Evolutionary Computation Conference, LNCS 2724, 1406-1417, 2003).

  111. BDDs-design, analysis, complexity, and applications,
    Discrete Applied Mathematics 138, 229-251, 2004.

  112. gem. mit F. Neumann:
    Randomized local search, evolutionary algorithms, and the minimum spanning tree problem,
    Theoretical Computer Science 378, 32-40, 2007
    (auch GECCO'2004, Genetic and Evolutionary Computation Conference, LNCS 3102, 713-724, 2004).

  113. gem. mit P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt und S. Tannenbaum:
    The Ising model: Simple evolutionary algorithms as adaptation schemes,
    PPSN '2004, LNCS 3242, 31-40, 2004.

  114. gem. mit P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt und S. Tannenbaum:
    Experimental supplements to the theoretical analysis of EAs on problems from combinatorial optimization,
    PPSN'2004, LNCS 3242, 21-30, 2004.

  115. gem. mit J. Scharnow und K. Tinnefeld:
    The analysis of evolutionary algorithms on sorting and shortest paths problems,
    Journal of Mathematical Modelling and Algorithms 3, 349-366, 2004.

  116. gem. mit T.Jansen:
    Real royal road functions - where crossover provably is essential,
    Discrete Applied Mathematics 149, 111-125, 2005
    (auch GECCO 2001, Genetic and Evolutionary Computation Conference, 375-382, 2001).

  117. gem. mit C.Witt:
    On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions,
    Journal of Discrete Algorithms 3, 61-78, 2005.

  118. gem. mit C.Witt:
    On the optimization of monotone polynomials by simple randomized search heuristics,
    Combinatorics, Probability and Computing 14, 225-247, 2005
    (mit dem Titel On the optimization of monotone polynomials by the (1+1)EA and randomized local search
    auch GECCO 2003, Genetic and Evolutionary Computation Conference, LNCS 2723, 622-633, 2003, Best Paper Award).

  119. gem. mit F. Neumann:
    Minimum spanning trees made easier via multi-objective optimization,
    Natural Computing 5, 305-319, 2006
    (auch GECCO 2005, Genetic and Evolutionary Computation Conference, ACM, 763-769, 2005, Best Paper Award).

  120. gem. mit P. Woelfel:
    New results on the complexity of the middle bit of multiplication,
    Computational Complexity 16, 298-323, 2007
    (auch Computational Complexity Conference (CCC), IEEE, 100-110,2005).

  121. Simulated annealing beats Metropolis in combinatorial optimization,
    ICALP 2005, LNCS 3580, 589-601, 2005.

  122. gem. mit M. Krause und P. Savicky:
    On the influence of the variable ordering for algorithmic learning using OBDDs,
    Information and Computation 201, 160-177, 2005.

  123. gem. mit S. Fischer
    The Ising model on the ring: Mutation versus recombination
    Theoretical Computer Science 344, 208-225, 2005.
    (auch GECCO 2004, LNCS 3102, 1113-1124, 2004).

  124. gem. mit P.B.Miltersen und J.Radhakrishnan:
    On converting CNF to DNF,
    Theoretical Computer Science 347, 325-335, 2005.
    (auch MFCS'2003, LNCS 2747, 612-621, 2003).

  125. gem. mit T. Jansen und K. De Jong:
    On the choice of the offspring population size in evolutionary algorithms,
    Evolutionary Computation 13, 413-440, 2005.

  126. gem. mit S. Droste und T. Jansen
    Upper and lower bounds for randomized search heuristics in black-box optimization,
    Theory of Computing Systems 4, 525-544, 2006.

  127. gem. mit T.Jansen:
    On the analysis of a dynamic evolutionary algorithm,
    Journal of Discrete Algorithms 4, 181-199, 2006.

  128. gem. mit T. Bernholt, R. Fried und U. Gather:
    Modified repeated median filters,
    Statistics and Computing 16, 173-192, 2006.

  129. gem. mit T. Jansen:
    The local performance of simulated annealing and the (1+1) evolutionary algorithm,
    GECCO 2006 (Genetic and Evolutionary Computation Conference), Proceedings, ACM,
    Vol. 1, 469-475, 2006, Best Paper Award.

  130. gem. mit O. Giel:
    Maximum cardinality matchings on trees by randomized local search,
    GECCO 2006 (Genetic and Evolutionary Computation Conference), Proceedings, ACM,
    Vol. 1, 539-546, 2006.

  131. gem. mit M. Krause:
    Circuit complexity,
    erscheint als Beitrag zur Monographie "Boolean Functions Vol. II" (Eds. Y. Crama, P. Hammer).

  132. gem. mit B.Bollig, M.Sauerhoff und D.Sieling:
    Binary decision diagrams,
    erscheint als Beitrag zur Monographie "Boolean Functions Vol. II" (Eds. Y.Crama, P. Hammer).

  133. gem. mit T. Jansen:
    A comparison of simulated annealing with a simple evolutionary algorithm
    on pseudo-boolean functions of unitation,
    Theoretical Computer Science 386, 73-93, 2007.

  134. gem. m. R. Nunkesser, T. Bernholt, H. Schwender und K. Ickstadt:
    Detecting high-order interactions of single nucleotide polymorphisms using genetic programming,
    Bioninformatics 23(24), 3280-3288, 2007.

  135. gem. m. B. Bollig und N. Range:
    Exact OBDD bounds for some fundamental functions,
    SOFSEM 2008, LNCS 4910, 174-185, 2008.

  136. gem. m. M. Dietzfelbinger, J.E. Rowe und P. Woelfel:
    Tight bounds for blind search on the integers,
    erscheint in STACS'2008.
    Proc. 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Vol. 8001 of
    Dagstuhl Seminar Proceedings, 241-252, IFBI, Schloss Dagstuhl, 2008.

  137. gem. m. F. Neumann:
    Can single-objective optimization profit from multiobjective optimization?
    In: Multiobjective Problem Solving from Nature,
    Springer (Ed. J. Knowles, D. Corne and K. Deb), 2007.

  138. gem. m. M. Dietzfelbinger, J.E. Rowe und P. Woelfel:
    Precision, local search and unimodal functions,
    erscheint in GECCO 2008.

Weitere referierte Beiträge

  1. Bekannte Sortierverfahren und eine HEAPSORT-Variante,
    die QUICKSORT schlägt,
    Informatik-Spektrum 13, 321-330, 1990.

  2. gem. mit A.Conrad, T.Hindrichs und H.Morsy:
    Wie es dem Springer gelingt, Schachbretter beliebiger Größe
    und zwischen beliebig vorgegebenen Anfangs- und
    Endfeldern vollständig abzureiten,
    Spektrum der Wissenschaft, 10-14, Februar 1992.

  3. Springerwege auf großen Schachbrettern,
    Informatik-Spektrum 15, 172, 1992.

  4. Ein Plädoyer für eine lebendige und anschauliche Fachsprache,
    LOG IN 14 (Heft 4), 22-24, 1994.

  5. Didaktische Überlegungen zu einer algorithmenorientierten
    Einführung in die Theoretische Informatik,
    Informatik-Spektrum 18, 79-83, 1995.

  6. Bundeswettbewerb Informatik -
    Die Aufgaben der Endrunden 1996 und 1997,
    LOG IN 17 (Heft 6), 29-34, 1997.

  7. Evolutionäre Algorithmen,
    LOG IN 20 (Heft 1), 62-64, 2000.

  8. gem. mit P.Kersting:
    Hardware for basic arithmetic operations as a subject of computer
    science courses in high schools,
    Informatica Didactica 2
    (elektron. Zeitschrift, 30 Seiten), 2001.

  9. Teaching nondeterminism as a special case of randomization,
    Informatica Didactica 4 (elektron. Zeitschrift, 11 Seiten), 2002.

  10. gem. mit T. Bernholt, A. Gülich, T. Hofmeister und N. Schmitt:
    Komplexitätstheorie, effiziente Algorithmen und die Bundesliga,
    Informatik-Spektrum 25, 488-502, 2002.

Weitere Artikel

  1. Conference reports and nationalism,
    EATCS Bulletin 53, 500, 1994.

  2. Zeit und Zeiteinteilung - Wie lange arbeiten Studenten für ihr Studium,
    Frankfurter Rundschau, 5.1.1995, Aus Hochschule und Schule.

  3. Springerkreise erstmals berechnet,
    Frankfurter Rundschau, 18.5.1996, Wissenschaft und Technik.

  4. gem. mit M. Löbbing:
    Vivat Victoria oder der Weg des Springers - Nachweisverfahren für
    Hardwareverifikation entwickelt,
    forschung - Mitteilungen der DFG 2/96, Titelblatt und 25-27, 1996.
    Engl. Version: Vivat Victoria or the Knight's progress,
    Reports of the DFG 1/97, 12-14.

  5. gem. mit M. Löbbing:
    Knight moves - was macht der Springer allein auf dem Schachbrett?,
    Highlights aus der Informatik (Hrsg. I. Wegener), 63-82, Springer, 1996.

  6. gem. mit A. Engelke:
    Forschungsförderung durch die Deutsche Forschungsgemeinschaft
    (DFG) - Eine Information über Antragstellung und Begutachtungsverfahren,
    Informatik-Spektrum 19, 333-336, 1996.

  7. Informatik-Handbuch
    (Hrsg. Rechenberg/Pomberger),
    Kapitel A5, Grenzen der Berechenbarkeit, S. 99-106, und
    Kapitel A6, Komplexität, S. 107-128, Hanser, 1997
    (2. Auflage, S. 111-118 und 119-142, 1999).

  8. Entwurf und Analyse von Algorithmen,
    GI-Informatiktage 1999, Konradin Verlag, 35-42, 2000.

  9. Lexikon der Mathematik,
    Spektrum - Akademischer Verlag, 5 Bände, 2000-2002.
    Bearbeitung der 110 Stichwörter im Gebiet Komplexitätstheorie.

  10. On the design and analysis of evolutionary algorithms,
    Workshop on Algorithm Engineering as a New Paradigm, 36-47, 2000.

  11. Algorithmen.
    In: Informatik für Ingenieure kompakt (Hrsg. K. Bruns und P.
    Klimsa). Vieweg, 71-98, 2001.

  12. Die Verwaltung einer Universität und die Liebe zum Theater.
    In: Bürokratie und Subversion (Hrsg. W. Grünzweig, M. Kleiner
    und W. Weber),
    LIT Verlag, 153-155, 2002.

  13. gem. mit S. Droste, T. Jansen, G. Rudolph, H.-P. Schwefel und K.Tinnefeld:
    Theory of evolutionary algorithms and genetic programming.
    In: Advances in Computational Intelligence (Hrsg. H.-P.
    Schwefel, I. Wegener und K. Weinert), 107-144, 2003.

  14. Komplexitätstheorie.
    In: Faszination Mathematik (Hrsg. G. Walz),
    Spektrum Akademischer Verlag, 195-197, 2003.

  15. Randomized search heuristics as an alternative to exact optimization.
    In: Logic versus Approximation. Essays Dedicated to Michael M. Richter
    on the Occasion of his 65th Birthday. (Ed. W. Lenski), LNCS 3075,
    138-149, 2004.

  16. Rankings oder Ratings: Warum, wie und durch wen?
    Informatik-Spektrum 28, 129-130, 2005.

  17. Hans-Paul Schwefel as colleague
    Festschrift Hans-Paul Schwefel, LS 11, Univ. Dortmund, 105-106, 2006.

  18. Lehrprofessuren - Königsweg oder Irrweg?
    MünchnerUni Magazin 2, 22, 2007.

Buchbesprechungen (ab 2002)

  1. T. Schickinger und A. Steger:
    Diskrete Strukturen 1+2.
    Springer. Besprechung im Informatik-Spektrum 25, 2002.

  2. R. Brandenberg und P. Gritzmann:
    Das Geheimnis des kürzesten Weges.
    Springer. Besprechung im Informatik-Spektrum 25, 2002.

  3. P. Clote und E. Kranakis: Boolean Functions and Computation Models.
    Springer. Besprechung in The Computer Journal, 2002.

  4. D. Harel: Das Affenpuzzle und weitere bad news aus der Computerwelt.
    Springer. Besprechung im Spektrum der Wissenschaft 90-92, November 2003.