Hasso-Plattner-Institut
  
Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications of Dr. Timo Kötzing

The following listing contains all publications of Dr. Timo Kötzing. Further publications of the research group can be found on the current list of publications and the complete list of publications. External individual listings are available on DBLP and Google Scholar.

[2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007]

2017 [ to top ]

  • Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, Martin Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Foundations of Genetic Algorithms (FOGA) 2017
     
  • restarts-aaai2017cameraReady.pdf
    Friedrich, Tobias; Kötzing, Timo; Wagner, Markus A Simple Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. Conference on Artificial Intelligence (AAAI) 2017
     
  • submission.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise. IEEE Transactions on Evolutionary Computation 2017
     
  • Paper.pdf
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew Michael Resampling vs Recombination: a Statistical Run Time Estimation. Foundations of Genetic Algorithms (FOGA) 2017
     

2016 [ to top ]

  • Case, John; Kötzing, Timo Strongly non-U-shaped language learning results by general techniques. Information and Computation 2016: 1-15
     
  • Case, John; Kötzing, Timo Topological Separations in Inductive Inference. Theoretical Computer Science 2016: 33-45
     
  • RobustnessOfPopulationsInStochasticEnvironments.pdf
    Gießen, Christian; Kötzing, Timo Robustness of Populations in Stochastic Environments. Algorithmica 2016: 462-489
     
  • Jain, Sanjay; Kötzing, Timo; Stephan, Frank Enlarging learnable classes. Information and Computation 2016: 194-207
     
  • AntColonyOptimizationBeatsResamplingOnNoisyFunctions.pdf
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew M. Ant Colony Optimization Beats Resampling on Noisy Functions. Genetic and Evolutionary Computation Conference (GECCO) 2016: 3-4
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearchGecco.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary Search. Genetic and Evolutionary Computation Conference (GECCO) 2016: 161-162
     
  • Kötzing, Timo Concentration of First Hitting Times Under Additive Drift. Algorithmica 2016: 490-506
     
  • Kötzing, Timo; Palenta, Raphaela A map of update constraints in inductive inference. Theoretical Computer Science 2016: 4-24
     
  • EmergenceOfDiversityAndItsBenefitsForCrossoverInGeneticAlgorithms.pdf
    Dang, Duc-Cuong; Lehre, Per Kristian; Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew M. Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. Parallel Problem Solving From Nature (PPSN) 2016: 890-900
     
  • RobustnessOfAntColonyOptimizationToNoiseJournal.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to Noise. Evolutionary Computation 2016: 237-254
     
  • EscapingLocalOptimaWithDiversityMechanismsAndCrossover.pdf
    Dang, Duc-Cuong; Friedrich, Tobias; Krejca, Martin S.; Kötzing, Timo; Lehre, Per Kristian; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew Michael Escaping Local Optima with Diversity Mechanisms and Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 645-652
     
  • FastBuildingBlockAssemblyByMajorityVoteCrossover.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Nallaperuma, Samadhi; Neumann, Frank; Schirneck, Martin Fast Building Block Assembly by Majority Vote Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 661-668
     
  • OnTheRobustnessOfEvolvingPopulations.pdf
    Friedrich, Tobias; Kötzing, Timo; Sutton, Andrew M. On the Robustness of Evolving Populations. Parallel Problem Solving From Nature (PPSN) 2016: 771-781
     
  • ProvablyOptimalSelf-AdjustingStepSizesForMulti-ValuedDecisionVariables.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Provably Optimal Self-Adjusting Step Sizes for Multi-Valued Decision Variables. Parallel Problem Solving From Nature (PPSN) 2016: 782-791
     
  • 2016GECCOcannot.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S. EDAs cannot be Balanced and Stable. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1139-1146
     
  • TheRightMutationStrengthForMulti-ValuedDecisionVariables.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The Right Mutation Strength for Multi-Valued Decision Variables. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1115-1122
     
  • OnTheRoleOfUpdateConstraintsAndText-TypesInIterativeLearning.pdf
    Jain, Sanjay; Kötzing, Timo; Ma, Junqi; Stephan, Frank On the Role of Update Constraints and Text-Types in Iterative Learning. Information and Computation 2016: 152-168
     
  • TowardsAnAtlasOfComputationalLearningTheory.pdf
    Kötzing, Timo; Schirneck, Martin Towards an Atlas of Computational Learning Theory. Symposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1-47:13
     
  • Graceful.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Graceful Scaling on Uniform versus Steep-Tailed Noise. Parallel Problem Solving From Nature (PPSN) 2016: 761-770
     

2015 [ to top ]

  • Freydenberger, Dominik D.; Kötzing, Timo Fast Learning of Restricted Regular Expressions and DTDs. Theory of Computing Systems 2015: 1114-1158
     
  • UnbiasedBlack-BoxComplexitiesOfJumpFunctions.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased Black-Box Complexities of Jump Functions. Evolutionary Computation 2015: 641-670
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearch.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150
     
  • SolvingProblemsWithUnknownSolutionLengthAt(Almost)NoExtraCost.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. Genetic and Evolutionary Computation Conference (GECCO) 2015: 831--838
     
  • (1+1)EAOnGeneralizedDynamicOneMax.pdf
    Kötzing, Timo; Lissovoi, Andrei; Witt, Carsten {(1+1)} {EA} on Generalized Dynamic OneMax. Foundations of Genetic Algorithms (FOGA) 2015: 40-51
     
  • RobustnessOfAntColonyOptimizationToNoise.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to Noise. Genetic and Evolutionary Computation Conference (GECCO) 2015: 17--24
     

2014 [ to top ]

  • TheMaxProblemRevisitedTheImportanceOfMutationInGeneticProgramming.pdf
    Kötzing, Timo; Sutton, Andrew M.; Neumann, Frank; O'Reilly, Una-May The Max problem revisited: The importance of mutation in genetic programming. Theoretical Computer Science (TCS) 2014: 94-107
     
  • UnbiasedBlack-BoxComplexitiesOfJumpFunctionsHowToCrossLargePlateaus.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased black-box complexities of jump functions: how to cross large plateaus. Genetic and Evolutionary Computation Conference (GECCO) 2014: 769-776
     
  • OnTheRoleOfUpdateConstraintsAndText-TypesInIterativeLearning.pdf
    Jain, Sanjay; Kötzing, Timo; Ma, Junqi; Stephan, Frank On the Role of Update Constraints and Text-Types in Iterative Learning. International Conference on Algorithmic Learning Theory (ALT) 2014: 55--69
     
  • ConcentrationOfFirstHittingTimesUnderAdditiveDrift.pdf
    Kötzing, Timo Concentration of first hitting times under additive drift. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1391-1398
     
  • AMapOfUpdateConstraintsInInductiveInference.pdf
    Kötzing, Timo; Palenta, Raphaela A Map of Update Constraints in Inductive Inference. International Conference on Algorithmic Learning Theory (ALT) 2014: 40-54
     
  • RobustnessOfPopulationsInStochasticEnvironments1.pdf
    Gießen, Christian; Kötzing, Timo Robustness of populations in stochastic environments. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1383-1390
     
  • TheUnbiasedBlack-BoxComplexityOfPartitionIsPolynomial.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The unbiased black-box complexity of partition is polynomial. Artificial Intelligence 2014: 275-286
     
  • ASolutionToWiehagensThesis.pdf
    Kötzing, Timo A Solution to Wiehagen's Thesis. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 494--505
     
  • Kötzing, Timo Iterative learning from positive data and counters. Theoretical Computer Science (TCS) 2014: 155-169
     

2013 [ to top ]

  • Memory-LimitedNon-U-ShapedLearningWithSolvedOpenProblems.pdf
    Case, John; Kötzing, Timo Memory-limited non-U-shaped learning with solved open problems. Theoretical Computer Science (TCS) 2013: 100-123
     
  • Doerr, Benjamin; Kötzing, Timo; Lengler, Johannes; Winzen, Carola Black-box complexities of combinatorial problems. Theoretical Computer Science 2013: 84-106
     
  • FastLearningOfRestrictedRegularExpressionsAndDtds.pdf
    Freydenberger, Dominik D.; Kötzing, Timo Fast learning of restricted regular expressions and DTDs. International Conference on Database Theory (ICDT) 2013: 45-56
     
  • TopologicalSeparationsInInductiveInference.pdf
    Case, John; Kötzing, Timo Topological Separations in Inductive Inference. International Conference on Algorithmic Learning Theory (ALT) 2013: 128-142
     
  • MenuoptimizerInteractiveOptimizationOfMenuSystems.pdf
    Bailly, Gilles; Oulasvirta, Antti; Kötzing, Timo; Hoppe, Sabrina MenuOptimizer: interactive optimization of menu systems. Symposium on User Interface Software and Technology (UIST) 2013: 331-342
     
  • ANormalFormForArgumentationFrameworks.pdf
    Croitoru, Cosmina; Kötzing, Timo A Normal Form for Argumentation Frameworks. Theorie and Applications of Formal Argumentation (TAFA) 2013: 32-45
     
  • Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine More effective crossover operators for the all-pairs shortest path problem. Theoretical Computer Science (TCS) 2013: 12-26
     
  • OptimizingExpectedPathLengthsWithAntColonyOptimizationUsingFitnessProportionalUpdate.pdf
    Feldmann, Matthias; Kötzing, Timo Optimizing expected path lengths with ant colony optimization using fitness proportional update. Foundations of Genetic Algorithms (FOGA) 2013: 65-74
     
  • AnEffectiveHeuristicForTheSmallestGrammarProblem.pdf
    Benz, Florian; Kötzing, Timo An effective heuristic for the smallest grammar problem. Genetic and Evolutionary Computation Conference (GECCO) 2013: 487-494
     

2012 [ to top ]

  • TheMaxProblemRevisitedTheImportanceOfMutationInGeneticProgramming.pdf
    Kötzing, Timo; Sutton, Andrew M.; Neumann, Frank; O'Reilly, Una-May The max problem revisited: the importance of mutation in genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2012: 1333-1340
     
  • DeliberativeAcceptabilityOfArguments.pdf
    Croitoru, Cosmina; Kötzing, Timo Deliberative Acceptability of Arguments. Starting AI Researcher Symposium (STAIRS) 2012: 71-82
     
  • AcoBeatsEaOnADynamicPseudo-BooleanFunction.pdf
    Kötzing, Timo; Molter, Hendrik {ACO} Beats {EA} on a Dynamic Pseudo-Boolean Function. International Conference on Parallel Problem Solving from Nature (PPSN) 2012: 113-122
     
  • 2012GECCO_Bio.pdf
    Baumbach, Jan; Friedrich, Tobias; Kötzing, Timo; Krohmer, Anton; Müller, Joachim; Pauling, Josch Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2012: 169--176
     
  • LearningSecretsInteractivelyDynamicModelingInInductiveInference.pdf
    Case, John; Kötzing, Timo Learning secrets interactively. Dynamic modeling in inductive inference. Information and Computation 2012: 60-73
     
  • Computability-TheoreticLearningComplexity.pdf
    Case, John; Kötzing, Timo Computability-Theoretic Learning Complexity. Philosophical Transactions of the Royal Society A 2012: 3570-3596
     
  • TheoreticalAnalysisOfTwoACOApproachesForTheTravelingSalesmanProblem.pdf
    Kötzing, Timo; Neumann, Frank; Röglin, Heiko; Witt, Carsten Theoretical analysis of two {ACO} approaches for the traveling salesman problem. Swarm Intelligence 2012: 1-21
     
  • LearningInTheLimitWithLattice-StructuredHypothesisSpaces.pdf
    Heinz, Jeffrey; Kasprzik, Anna; Kötzing, Timo Learning in the limit with lattice-structured hypothesis spaces. Theoretical Computer Science (TCS) 2012: 111--127
     
  • IB1.pdf
    Alcaraz, Nicolas; Friedrich, Tobias; Kötzing, Timo; Krohmer, Anton; Müller, Joachim; Pauling, Josch; Baumbach, Jan Efficient Key Pathway Mining: Combining Networks and OMICS Data. Integrative Biology 2012: 756--764
     
  • AntsEasilySolveStochasticShortestPathProblems.pdf
    Doerr, Benjamin; Hota, Ashish; Kötzing, Timo Ants easily solve stochastic shortest path problems. Genetic and Evolutionary Computation Conference (GECCO) 2012: 17-24
     
  • EnlargingLearnableClasses.pdf
    Jain, Sanjay; Kötzing, Timo; Stephan, Frank Enlarging Learnable Classes. International Conference on Algorithmic Learning Theory (ALT) 2012: 36-50
     

2011 [ to top ]

  • HowCrossoverHelpsInPseudo-BooleanOptimization.pdf
    Kötzing, Timo; Sudholt, Dirk; Theile, Madeleine How crossover helps in pseudo-boolean optimization. Genetic and Evolutionary Computation Conference (GECCO) 2011: 989-996
     
  • IterativeLearningFromPositiveDataAndCounters.pdf
    Kötzing, Timo Iterative Learning from Positive Data and Counters. Algorithmic Learning Theory (ALT) 2011: 40-54
     
  • FasterBlack-BoxAlgorithmsThroughHigherArityOperators.pdf
    Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Lehre, Per Kristian; Wagner, Markus; Winzen, Carola Faster black-box algorithms through higher arity operators. Foundations of Genetic Algorithms (FOGA) 2011: 163-172
     
  • PacLearningAndGeneticProgramming.pdf
    Kötzing, Timo; Neumann, Frank; Spöhel, Reto {PAC} learning and genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2091-2096
     
  • Black-BoxComplexitiesOfCombinatorialProblems.pdf
    Doerr, Benjamin; Lengler, Johannes; Kötzing, Timo; Winzen, Carola Black-box complexities of combinatorial problems. Genetic and Evolutionary Computation Conference (GECCO) 2011: 981-988
     
  • MeasuringLearningComplexityWithCriteriaEpitomizers.pdf
    Case, John; Kötzing, Timo Measuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331
     
  • SimpleMax-MinAntSystemsAndTheOptimizationOfLinearPseudo-BooleanFunctions.pdf
    Kötzing, Timo; Neumann, Frank; Sudholt, Dirk; Wagner, Markus Simple max-min ant systems and the optimization of linear pseudo-boolean functions. Foundations of Genetic Algorithms (FOGA) 2011: 209-218
     
  • TooFastUnbiasedBlack-BoxAlgorithms.pdf
    Doerr, Benjamin; Kötzing, Timo; Winzen, Carola Too fast unbiased black-box algorithms. Genetic and Evolutionary Computation Conference (GECCO) 2011: 2043-2050
     

2010 [ to top ]

  • StringExtensionLearningUsingLattices.pdf
    Kasprzik, Anna; Kötzing, Timo String Extension Learning Using Lattices. International Conference on Language and Automata Theory and Applications (LATA) 2010: 380-391
     
  • StronglyNon-U-ShapedLearningResultsByGeneralTechniques.pdf
    Case, John; Kötzing, Timo Strongly Non-U-Shaped Learning Results by General Techniques. Conference On Learning Theory (COLT) 2010: 181-193
     
  • SolutionsToOpenQuestionsForNonUShapedLearningWithMemoryLimitations.pdf
    Case, John; Kötzing, Timo Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. Algorithmic Learning Theory (ALT) 2010: 285-299
     
  • AntColonyOptimizationAndTheMinimumCutProblem.pdf
    Kötzing, Timo; Lehre, Per Kristian; Neumann, Frank; Oliveto, Pietro Simone Ant colony optimization and the minimum cut problem. Genetic and Evolutionary Computation Conference (GECCO) 2010: 1393-1400
     
  • MoreEffectiveCrossoverOperatorsForTheAll-PairsShortestPathProblem.pdf
    Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine More Effective Crossover Operators for the All-Pairs Shortest Path Problem. International Conference on Parallel Problem Solving from Nature (PPSN) 2010: 184-193
     
  • TheoreticalPropertiesOfTwoACOApproachesForTheTravelingSalesmanProblem.pdf
    Kötzing, Timo; Neumann, Frank; Röglin, Heiko; Witt, Carsten Theoretical Properties of Two {ACO} Approaches for the Traveling Salesman Problem. International Conference on Swarm Intelligence (ANTS) 2010: 324-335
     

2009 [ to top ]

  • DifficultiesInForcingFairnessOfPolynomialTimeInductiveInference.pdf
    Case, John; Kötzing, Timo Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. Algorithmic Learning Theory (ALT) 2009: 263-277
     

2008 [ to top ]

  • DynamicallyDelayedPostdictiveCompletenessAndConsistencyInLearning.pdf
    Case, John; Kötzing, Timo Dynamically Delayed Postdictive Completeness and Consistency in Learning. Algorithmic Learning Theory (ALT) 2008: 389-403
     
  • DynamicModelingInInductiveInference.pdf
    Case, John; Kötzing, Timo Dynamic Modeling in Inductive Inference. International Conference on Algorithmic Learning Theory (ALT) 2008: 404-418
     

2007 [ to top ]

  • FeasibleIterationOfFeasibleLearningFunctionals.pdf
    Case, John; Kötzing, Timo; Paddock, Todd Feasible Iteration of Feasible Learning Functionals. Algorithmic Learning Theory (ALT) 2007: 34-48