Stefan Droste

Address:
Informatik II, Universität Dortmund, D-44221 Dortmund, Germany
Office:
Otto-Hahn-Str. 14, R 342
e-mail:
stefan.droste AT udo.edu
Phone:
Fax:
Photo

Research Interests: Theory of Evolutionary Algorithms, Visual Cryptography.

You can download my PhD-Thesis "Zu Analyse und Entwurf evolutionärer Algorithmen" ("On the Analysis and Design of Evolutionary Algorithms") here in PDF, but beware: it is written in German.

Important: Since 2008 I am working for INFORM GmbH, but you can still contact me via my email-address at Lehrstuhl Informatik 2, see above.

Publications

  • Stefan Droste (2006).
    A Rigorous Analysis of the Compact Genetic Algorithm for Linear Functions.
    Natural Computing, Volume 5, Number 3, pages 257-283.

  • Lothar M. Schmitt, Stefan Droste (2006).
    Convergence to Global Optima for Genetic Programming Systems with Dynamically Scaled Operators.
    GECCO 2006, Proc. of the Genetic and Evolutionary Computation Conference.
    Seattle, WA, July 8-12, 2006, pages 879-886.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (2006).
    Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization.
    Theory of Computing Systems, Volume 39, Number 4, pages 525-544.

  • Stefan Droste (2005).
    Not All Linear Functions Are Equally Difficult for the Compact Genetic Algorithm.
    GECCO 2005, Proc. of the Genetic and Evolutionary Computation Conference.
    Washington, DC, June 25-29, 2005, pages 679-686.
    (Best paper award in "Estimation of Distribution"-Track.)

  • Stefan Droste (2004).
    Analysis of the (1+1) EA for a Noisy OneMax.
    GECCO 2004, Proc. of the Genetic and Evolutionary Computation Conference.
    Seattle, WA, June 26-30, 2004, pages 1088-1099.

  • Stefan Droste (2003).
    Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax.
    GECCO 2003, Proc. of the Genetic and Evolutionary Computation Conference.
    Chicago, IL, July 12-16, 2003, pages 909-921.

  • Stefan Droste and Dirk Wiesmann (2003).
    On the Design of Problem-specific Evolutionary Algorithms.
    Advances in Evolutionary Computing, Ashish Ghosh and Shigeyoshi Tsutsui (Eds.), Springer, pages 153-173.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (2002).
    Optimization with Randomized Search Heuristics - The (A)NFL Theorem, Realistic Scenarios, and Difficult Functions.
    Theoretical Computer Science 287, pages 131-144.

  • Stefan Droste, Thomas Jansen, Karsten Tinnefeld and Ingo Wegener (2002).
    A New Framework for the Valuation of Algorithms for Black-Box Optimization.
    FOGA 2002, Proc. of the Seventh Foundations of Genetic Algorithms Workshop,
    Torremolinos, Spain, September 4-6, 2002, pages 197-214.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (2002).
    On the Analysis of the (1+1) Evolutionary Algorithm.
    Theoretical Computer Science 276, pages 51-81.

  • Stefan Droste (2002).
    Analysis of the (1+1) EA for a Dynamically Changing OneMax-Variant.
    CEC 2002 , Proc. of the Congress on Evolutionary Computation.
    Honolulu, HI, May 12-17, 2002, pages 55-60.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (2000).
    A Natural and Simple Funtions Which is Hard for All Evolutionary Algorithms.
    SEAL 2000 , Proc. of the Third Asia-Pacific Conference on Simulated Evolution and Learning,
    Nagoya, Japan, October 24-27, 2000, pages 2704-2709.

  • Stefan Droste, Dominic Heutelbeck, and Ingo Wegener (2000).
    Distributed Hybrid Genetic Programming for Learning Boolean Functions.
    PPSN VI , Proc. of the Sixth International Conference on Parallel Solving from Nature,
    Paris, France, September 18-20, 2000, pages 181-190.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (2000).
    Dynamic Parameter Control in Simple Evolutionary Algorithms.
    FOGA 2000, Proc. of the Sixth Foundations of Genetic Algorithms Workshop,
    Charlottesville, VA, July 21-23, 2000, pages 275-294.

  • Stefan Droste and Dirk Wiesmann (2000).
    Metric Based Evolutionary Algorithms.
    EuroGP 2000, Proc. of the Third European Conference on Genetic Programming,
    Edinburgh, Scotland, April 15-16, 2000, pages 29-43.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (1999).
    Perhaps Not a Free Lunch But at Least a Free Appetizer.
    GECCO 99, Proc. of the 1st Genetic and Evolutionary Computation Conference,
    Orlando, FL, July 13-17, 1999, pages 833-839.

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

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (1998).
    On the Optimization of Unimodal Functions with the (1+1) Evolutionary Algorithm.
    PPSN V, Proc. of the 5th International Conference on Parallel Problem Solving from Nature,
    Amsterdam, Netherlands, September 27-30, 1998, pages 13-22.

  • Stefan Droste (1998).
    Genetic Programming with Guaranteed Quality.
    GP 98, Proc. of the Third Annual Conference on Genetic Programming,
    Madison, WI, July 22-25, 1998, pages 54-59.

  • Stefan Droste, Thomas Jansen, and Ingo Wegener (1998).
    A Rigorous Complexity Analysis of the (1+1) Evolutionary Algorithm for Linear Functions with Boolean Inputs.
    ICEC 98, Proc. of the IEEE Congress on Evolutionary Computation,
    Anchorage, AK, May 4-9, 1998, pages 499-504.

  • Stefan Droste (1997).
    Efficient Genetic Programming for Finding Good Generalizing Boolean Functions.
    GP 97, Proc. of the Second Annual Conference on Genetic Programming,
    Stanford, CA, July 13-16, 1997, pages 82-87.

  • Stefan Droste (1996).
    New Results on Visual Cryptography.
    CRYPTO 96, Proc. of the 16th Annual International Cryptology Conference,
    Santa Barbara, CA, August 18-22, 1996, pages 401-415.