Johannes Lengler

Orcid: 0000-0003-0004-7629

According to our database1, Johannes Lengler authored at least 78 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions.
Algorithmica, October, 2024

Analysing Equilibrium States for Population Diversity.
Algorithmica, July, 2024

Benchmarking Dynamic Binary Value Problems with IOHprofiler - Reproducibility files.
Dataset, April, 2024

Large population sizes and crossover help in dynamic environments.
Nat. Comput., March, 2024

Balanced Bidirectional Breadth-First Search on Scale-Free Networks.
CoRR, 2024

Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models.
CoRR, 2024

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models.
CoRR, 2024

Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes.
CoRR, 2024

A Tight O(4<sup>k</sup>/p<sub>c</sub>) Runtime Bound for a (μ+1) GA on Jump<sub>k</sub> for Realistic Crossover Probabilities.
CoRR, 2024

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Self-adjusting Evolutionary Algorithms are Slow on a Class of Multimodal Landscapes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Faster Optimization Through Genetic Drift.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

How Population Diversity Influences the Efficiency of Crossover.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

A Tight <i>O</i>(4<i><sup>k</sup>/p<sub>c</sub></i>) Runtime Bound for a (μ+1)GA on Jump<i><sub>k</sub></i> for Realistic Crossover Probabilities.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Plus Strategies are Exponentially Slower for Planted Optima of Random Height.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Hardest Monotone Functions for Evolutionary Algorithms.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024

Improved Bounds for Graph Distances in Scale Free Percolation and Related Models.
Proceedings of the Approximation, 2024

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

Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard.
Theor. Comput. Sci., September, 2023

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

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

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

OneMax Is Not the Easiest Function for Fitness Improvements.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023

On Connectivity in Random Graph Models with Limited Dependencies.
Proceedings of the Approximation, 2023

2022
Runtime Analysis of the (μ + 1)-EA on the Dynamic BinVal Function.
SN Comput. Sci., 2022

Greedy routing and the algorithmic small-world phenomenon.
J. Comput. Syst. Sci., 2022

Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081).
Dagstuhl Reports, 2022

Editorial.
Algorithmica, 2022

Self-adjusting Population Sizes for the (1, λ )-EA on Monotone Functions.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Population Diversity Leads to Short Running Times of Lexicase Selection.
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.
Theor. Comput. Sci., 2021

The Complex Parameter Landscape of the Compact Genetic Algorithm.
Algorithmica, 2021

Self-Adjusting Mutation Rates with Provably Optimal Success Rules.
Algorithmica, 2021

2020
Drift Analysis.
Proceedings of the Theory of Evolutionary Computation, 2020

A General Dichotomy of Evolutionary Algorithms on Monotone Functions.
IEEE Trans. Evol. Comput., 2020

Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming.
Theor. Comput. Sci., 2020

The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time.
Theor. Comput. Sci., 2020

Random Sampling with Removal.
Discret. Comput. Geom., 2020

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

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

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Asymptotically optimal amplifiers for the Moran process.
Theor. Comput. Sci., 2019

The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates.
Theor. Comput. Sci., 2019

Geometric inhomogeneous random graphs.
Theor. Comput. Sci., 2019

Bootstrap percolation with inhibition.
Random Struct. Algorithms, 2019

Sorting by Swaps with Noisy Comparisons.
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).
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

The Maximum Label Propagation Algorithm on Sparse Random Graphs.
Proceedings of the Approximation, 2019

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Drift Analysis and Evolutionary Algorithms Revisited.
Comb. Probab. Comput., 2018

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

The (1+1)-EA on Noisy Linear Functions with Random Positive Weights.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2018

Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Medium step sizes are harmful for the compact genetic algorithm.
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.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
Long Synfire Chains Emerge by Spike-Timing Dependent Plasticity Modulated by Population Activity.
Int. J. Neural Syst., 2017

A Model of Fast Hebbian Spike Latency Normalization.
Frontiers Comput. Neurosci., 2017

Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?
Evol. Comput., 2017

Drift Analysis.
CoRR, 2017

Tight Analysis for the 3-Majority Consensus Dynamics.
CoRR, 2017

Note on the coefficient of variations of neuronal spike trains.
Biol. Cybern., 2017

OneMax in Black-Box Models with Several Restrictions.
Algorithmica, 2017

Bounding bloat in genetic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Sampling Geometric Inhomogeneous Random Graphs in Linear Time.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Greedy Routing and the Algorithmic Small-World Phenomenom.
CoRR, 2016

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

Bootstrap Percolation on Geometric Inhomogeneous Random Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Random Sampling with Removal.
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?
CoRR, 2015

Normalization Phenomena in Asynchronous Networks.
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.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Fixed Budget Performance of the (1+1) EA on Linear Functions.
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.
Frontiers Comput. Neurosci., 2014

Evolutionary Algorithms for Quantum Computers.
Algorithmica, 2014

2013
Black-box complexities of combinatorial problems.
Theor. Comput. Sci., 2013

2010
Can quantum search accelerate evolutionary algorithms?
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2007
The Interval Liar Game.
Electron. Notes Discret. Math., 2007


  Loading...