The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Thomas Jansen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zdzislaw Król, Peter Zerfass, Bartosz von Rymon-Lipinski, Thomas Jansen, W. Hauck, Robert Sader, Hans-Florian Zeilhofer, Erwin Keeve
    Computer assisted osteotomy design for autografts in craniofacial reconstructive surgery. [Citation Graph (0, 0)][DBLP]
    CARS, 2001, pp:44-50 [Conf]
  2. Bartosz von Rymon-Lipinski, Thomas Jansen, Zdzislaw Król, Lutz Ritter, Erwin Keeve
    JULIUS - an extendable application framework for medical visualization and surgical planning. [Citation Graph (0, 0)][DBLP]
    CARS, 2001, pp:184-189 [Conf]
  3. Hans-Georg Beyer, Thomas Jansen, Colin R. Reeves, Michael D. Vose
    04081 Abstracts Collection - Theory of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
    Theory of Evolutionary Algorithms, 2004, pp:- [Conf]
  4. Thomas Jansen
    Introduction to the Theory of Complexity and Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    Lectures on Proof Verification and Approximation Algorithms, 1997, pp:5-28 [Conf]
  5. 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]
  6. Thomas Jansen
    A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm. [Citation Graph (0, 0)][DBLP]
    FOGA, 2005, pp:37-57 [Conf]
  7. 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]
  8. Thomas Jansen, Kenneth A. De Jong
    An Analysis Of The Role Of Offspring Population Size In EAs. [Citation Graph (0, 0)][DBLP]
    GECCO, 2002, pp:238-246 [Conf]
  9. Thomas Jansen, Ulf Schellbach
    Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:841-848 [Conf]
  10. Thomas Jansen, R. Paul Wiegand
    Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:310-321 [Conf]
  11. 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]
  12. Erwin Keeve, Thomas Jansen, Bartosz von Rymon-Lipinski, Zbigniew Burgielski, Nils Hanssen, Lutz Ritter, Marc Liévin
    An Open Software Framework for Medical Applications. [Citation Graph (0, 0)][DBLP]
    IS4TH, 2003, pp:302-310 [Conf]
  13. Nils Hanssen, Zbigniew Burgielski, Thomas Jansen, Marc Liévin, Lutz Ritter, Bartosz von Rymon-Lipinski, Erwin Keeve
    NERVES - Level Sets for Interactive 3D Segmentation of Nerve Channels. [Citation Graph (0, 0)][DBLP]
    ISBI, 2004, pp:201-204 [Conf]
  14. Erwin Keeve, Thomas Jansen, Zdzislaw Król, Lutz Ritter, Bartosz von Rymon-Lipinski, Robert Sader, Hans-Florian Zeilhofer, Peter Zerfass
    JULIUS - An Extendable Software Framework for Surgical Planning and Image-Guided Navigation. [Citation Graph (0, 0)][DBLP]
    MICCAI, 2001, pp:1336-1337 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. Thomas Jansen
    On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
    PPSN, 2002, pp:33-43 [Conf]
  19. 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]
  20. Thomas Jansen, R. Paul Wiegand
    Bridging the Gap Between Theory and Practice. [Citation Graph (0, 0)][DBLP]
    PPSN, 2004, pp:61-71 [Conf]
  21. Bartosz von Rymon-Lipinski, Nils Hanssen, Thomas Jansen, Lutz Ritter, Erwin Keeve
    Efficient Point-Based Isosurface Exploration Using the Span-Triangle. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2004, pp:441-448 [Conf]
  22. Thomas Jansen, Bartosz von Rymon-Lipinski, Nils Hanssen, Erwin Keeve
    Fourier Volume Rendering on the GPU Using a Split-Stream-FFT. [Citation Graph (0, 0)][DBLP]
    VMV, 2004, pp:395-403 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. Thomas Jansen, R. Paul Wiegand
    The Cooperative Coevolutionary (1+1) EA. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 2004, v:12, n:4, pp:405-434 [Journal]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. Thomas Jansen
    On the Brittleness of Evolutionary Algorithms. [Citation Graph (0, 0)][DBLP]
    FOGA, 2007, pp:54-69 [Conf]
  35. Richard A. Watson, Thomas Jansen
    A building-block royal road where crossover is provably essential. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:1452-1459 [Conf]
  36. Thomas Jansen, Dennis Weyland
    Analysis of evolutionary algorithms for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:939-946 [Conf]
  37. Thomas Jansen, Madeleine Theile
    Stability in the self-organized evolution of networks. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:931-938 [Conf]
  38. Thomas Jansen, Frank Neumann
    Computational complexity and evolutionary computation. [Citation Graph (0, 0)][DBLP]
    GECCO (Companion), 2007, pp:3225-3250 [Conf]
  39. Thomas Jansen, Dirk Sudholt
    Design and analysis of an asymmetric mutation operator. [Citation Graph (0, 0)][DBLP]
    Congress on Evolutionary Computation, 2005, pp:190-197 [Conf]
  40. Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu
    Fast and Simple Relational Processing of Uncertain Data [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  41. 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]

  42. 06061 Executive Summary -- Theory of Evolutionary Algoritms. [Citation Graph (, )][DBLP]


  43. 06061 Abstracts Collection -- Theory of Evolutionary Algorithms. [Citation Graph (, )][DBLP]


  44. Comparing global and local mutations on bit strings. [Citation Graph (, )][DBLP]


  45. Computational complexity and evolutionary computation. [Citation Graph (, )][DBLP]


  46. Maximal age in randomized search heuristics with aging. [Citation Graph (, )][DBLP]


  47. Computational complexity and evolutionary computation. [Citation Graph (, )][DBLP]


  48. Aging beyond restarts. [Citation Graph (, )][DBLP]


  49. Incremental evolution of local search heuristics. [Citation Graph (, )][DBLP]


  50. Computational complexity and evolutionary computation. [Citation Graph (, )][DBLP]


  51. On the Benefits of Aging and the Importance of Details. [Citation Graph (, )][DBLP]


  52. Comparing Different Aging Operators. [Citation Graph (, )][DBLP]


  53. A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization. [Citation Graph (, )][DBLP]


  54. Fast and Simple Relational Processing of Uncertain Data. [Citation Graph (, )][DBLP]


  55. Optimizing Monotone Functions Can Be Difficult. [Citation Graph (, )][DBLP]


  56. Embedding Multiple Self-Organisation Functionalities in Future Radio Access Networks. [Citation Graph (, )][DBLP]


  57. Load Balancing in Downlink LTE Self-Optimizing Networks. [Citation Graph (, )][DBLP]


  58. Sequential versus parallel cooperative coevolutionary (1+1) EAs. [Citation Graph (, )][DBLP]


  59. Use Cases, Requirements and Assessment Criteria for Future Self-Organising Radio Access Networks. [Citation Graph (, )][DBLP]


  60. Stability in the Self-Organized Evolution of Networks. [Citation Graph (, )][DBLP]


  61. Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. [Citation Graph (, )][DBLP]


  62. Ingo Wegener. [Citation Graph (, )][DBLP]


  63. Analysis of an Asymmetric Mutation Operator. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.454secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002