Johannes Lengler

According to our database, Johannes Lengler authored at least 71 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Large population sizes and crossover help in dynamic environments.

Johannes Lengler, Jonas Meier

Nat. Comput., March, 2024

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler.

Diederick Vermetten, Johannes Lengler, Dimitri Rusin, Thomas Bäck, Carola Doerr

CoRR, 2024

How Population Diversity Influences the Efficiency of Crossover.

Sacha Cerf, Johannes Lengler

CoRR, 2024

Faster Optimization Through Genetic Drift.

Cella Florescu, Marc Kaufmann, Johannes Lengler, Ulysse Schaller

CoRR, 2024

Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes.

Johannes Lengler, Konstantin Sturm

CoRR, 2024

Plus Strategies are Exponentially Slower for Planted Optima of Random Height.

Johannes Lengler, Leon Schiller, Oliver Sieberling

CoRR, 2024

A Tight O(4^k/p_c) Runtime Bound for a (μ+1) GA on Jump_k for Realistic Crossover Probabilities.

Andre Opris, Johannes Lengler, Dirk Sudholt

CoRR, 2024

Hardest Monotone Functions for Evolutionary Algorithms.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Oliver Sieberling

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024

2023

Self-adjusting population sizes for the (1,<i>λ</i>)-EA on monotone functions.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

Theor. Comput. Sci., November, 2023

Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard.

Duri Janett, Johannes Lengler

Theor. Comput. Sci., September, 2023

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II.

Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller

CoRR, 2023

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I.

Júlia Komjáthy, John Lapinskas, Johannes Lengler, Ulysse Schaller

CoRR, 2023

Analysing Equilibrium States for Population Diversity.

Johannes Lengler, Andre Opris, Dirk Sudholt

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima.

Joost Jorritsma, Johannes Lengler, Dirk Sudholt

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions.

Carola Doerr, Duri Andrea Janett, Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

OneMax Is Not the Easiest Function for Fitness Improvements.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023

On Connectivity in Random Graph Models with Limited Dependencies.

Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl

Proceedings of the Approximation, 2023

2022

Runtime Analysis of the (μ + 1)-EA on the Dynamic BinVal Function.

Johannes Lengler, Simone Riedi

SN Comput. Sci., 2022

Greedy routing and the algorithmic small-world phenomenon.

Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla

J. Comput. Syst. Sci., 2022

Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081).

Anne Auger, Carlos M. Fonseca, Tobias Friedrich, Johannes Lengler

Dagstuhl Reports, 2022

Editorial.

Johannes Lengler, Frank Neumann

Algorithmica, 2022

Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions.

Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Population Diversity Leads to Short Running Times of Lexicase Selection.

Thomas Helmuth, Johannes Lengler, William G. La Cava

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

2021

Exponential slowdown for larger populations: The (<i>μ</i> + 1)-EA on monotone functions.

Johannes Lengler, Xun Zou

Theor. Comput. Sci., 2021

The Complex Parameter Landscape of the Compact Genetic Algorithm.

Johannes Lengler, Dirk Sudholt, Carsten Witt

Algorithmica, 2021

Self-Adjusting Mutation Rates with Provably Optimal Success Rules.

Benjamin Doerr, Carola Doerr, Johannes Lengler

Algorithmica, 2021

2020

Drift Analysis.

Johannes Lengler

Proceedings of the Theory of Evolutionary Computation, 2020

A General Dichotomy of Evolutionary Algorithms on Monotone Functions.

Johannes Lengler

IEEE Trans. Evol. Comput., 2020

Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming.

Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler, Anna Melnichenko

Theor. Comput. Sci., 2020

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time.

Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler

Theor. Comput. Sci., 2020

Random Sampling with Removal.

Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák

Discret. Comput. Geom., 2020

Runtime analysis of the (mu+1)-EA on the Dynamic BinVal function.

Johannes Lengler, Simone Riedi

CoRR, 2020

Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs.

Júlia Komjáthy, John Lapinskas, Johannes Lengler

CoRR, 2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Asymptotically optimal amplifiers for the Moran process.

Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister

Theor. Comput. Sci., 2019

The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates.

Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger

Theor. Comput. Sci., 2019

Geometric inhomogeneous random graphs.

Karl Bringmann, Ralph Keusch, Johannes Lengler

Theor. Comput. Sci., 2019

Bootstrap percolation with inhibition.

Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger

Random Struct. Algorithms, 2019

Sorting by Swaps with Noisy Comparisons.

Tomas Gavenciak, Barbara Geissmann, Johannes Lengler

Algorithmica, 2019

The (1 + 1)-EA with mutation rate (1 + ϵ)/<i>n</i> is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019).

Johannes Lengler, Anders Martinsson, Angelika Steger

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions.

Johannes Lengler, Xun Zou

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

The Maximum Label Propagation Algorithm on Sparse Random Graphs.

Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger

Proceedings of the Approximation, 2019

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument.

Johannes Lengler, Anders Martinsson, Angelika Steger

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

Drift Analysis and Evolutionary Algorithms Revisited.

Johannes Lengler, Angelika Steger

Comb. Probab. Comput., 2018

The (1+1) Elitist Black-Box Complexity of LeadingOnes.

Carola Doerr, Johannes Lengler

Algorithmica, 2018

The (1+1)-EA on Noisy Linear Functions with Random Positive Weights.

Johannes Lengler, Ulysse Schaller

Proceedings of the IEEE Symposium Series on Computational Intelligence, 2018

Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics.

Mohsen Ghaffari, Johannes Lengler

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Medium step sizes are harmful for the compact genetic algorithm.

Johannes Lengler, Dirk Sudholt, Carsten Witt

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates.

Hafsteinn Einarsson, Johannes Lengler, Marcelo Matheus Gauy, Florian Meier, Asier Mujika, Angelika Steger, Felix Weissenberger

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity.

Felix Weissenberger, Florian Meier, Johannes Lengler, Hafsteinn Einarsson, Angelika Steger

Int. J. Neural Syst., 2017

A Model of Fast Hebbian Spike Latency Normalization.

Hafsteinn Einarsson, Marcelo M. Gauy, Johannes Lengler, Angelika Steger

Frontiers Comput. Neurosci., 2017

Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?

Carola Doerr, Johannes Lengler

Evol. Comput., 2017

Drift Analysis.

Johannes Lengler

CoRR, 2017

Tight Analysis for the 3-Majority Consensus Dynamics.

Mohsen Ghaffari, Johannes Lengler

CoRR, 2017

Note on the coefficient of variations of neuronal spike trains.

Johannes Lengler, Angelika Steger

Biol. Cybern., 2017

OneMax in Black-Box Models with Several Restrictions.

Carola Doerr, Johannes Lengler

Algorithmica, 2017

Bounding bloat in genetic programming.

Benjamin Doerr, Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Sampling Geometric Inhomogeneous Random Graphs in Linear Time.

Karl Bringmann, Ralph Keusch, Johannes Lengler

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Greedy Routing and the Algorithmic Small-World Phenomenom.

Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla

CoRR, 2016

Average Distance in a General Class of Scale-Free Networks with Underlying Geometry.

Karl Bringmann, Ralph Keusch, Johannes Lengler

CoRR, 2016

Bootstrap Percolation on Geometric Inhomogeneous Random Graphs.

Christoph Koch, Johannes Lengler

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Random Sampling with Removal.

Bernd Gärtner, Johannes Lengler, May Szedlák

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?

Carola Doerr, Johannes Lengler

CoRR, 2015

Normalization Phenomena in Asynchronous Networks.

Amin Karbasi, Johannes Lengler, Angelika Steger

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms.

Carola Doerr, Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Fixed Budget Performance of the (1+1) EA on Linear Functions.

Johannes Lengler, Nicholas Spooner

Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014

A high-capacity model for one shot association learning in the brain.

Hafsteinn Einarsson, Johannes Lengler, Angelika Steger

Frontiers Comput. Neurosci., 2014

Evolutionary Algorithms for Quantum Computers.

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Algorithmica, 2014

2013

Black-box complexities of combinatorial problems.

Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen

Theor. Comput. Sci., 2013

2010

Can quantum search accelerate evolutionary algorithms?

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2007

The Interval Liar Game.

Benjamin Doerr, Johannes Lengler, David Steurer

Electron. Notes Discret. Math., 2007