Johannes Lengler

From MaRDI portal
Revision as of 11:14, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:350717

Available identifiers

zbMath Open lengler.johannesMaRDI QIDQ350717

List of research outcomes





PublicationDate of PublicationType
On connectivity in random graph models with limited dependencies2025-01-14Paper
Polynomial growth in degree-dependent first passage percolation on spatial random graphs2024-12-20Paper
Hardest monotone functions for evolutionary algorithms2024-11-12Paper
Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions2024-10-24Paper
On connectivity in random graph models with limited dependencies2024-09-02Paper
Analysing equilibrium states for population diversity2024-08-02Paper
OneMax is not the easiest function for fitness improvements2024-01-12Paper
Hardest Monotone Functions for Evolutionary Algorithms2023-11-13Paper
Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions2023-10-26Paper
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II2023-09-21Paper
Two-dimensional drift analysis: optimizing two functions simultaneously can be hard2023-08-18Paper
On Connectivity in Random Graph Models with Limited Dependencies2023-05-04Paper
The Maximum Label Propagation Algorithm on Sparse Random Graphs2023-02-03Paper
Penalising transmission to hubs in scale-free spatial random graphs2022-02-25Paper
Greedy routing and the algorithmic small-world phenomenon2022-01-31Paper
Self-adjusting mutation rates with provably optimal success rules2021-11-05Paper
Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function2021-10-18Paper
Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions2021-06-23Paper
The complex parameter landscape of the compact genetic algorithm2021-04-08Paper
Random sampling with removal2020-10-23Paper
Sampling Geometric Inhomogeneous Random Graphs in Linear Time2020-05-27Paper
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming2020-03-20Paper
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time2020-03-20Paper
Bootstrap percolation with inhibition2020-02-14Paper
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm2020-02-12Paper
Exponential slowdown for larger populations2020-02-11Paper
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics2019-09-19Paper
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument2019-09-18Paper
The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates2019-07-31Paper
Sorting by swaps with noisy comparisons2019-02-14Paper
Geometric inhomogeneous random graphs2019-01-25Paper
Asymptotically optimal amplifiers for the Moran process2019-01-10Paper
Drift Analysis and Evolutionary Algorithms Revisited2018-07-24Paper
The \((1+1)\) elitist black-box complexity of LeadingOnes2018-05-18Paper
Random Sampling with Removal.2018-01-30Paper
Bootstrap percolation on geometric inhomogeneous random graphs2017-12-19Paper
Drift Analysis2017-12-04Paper
Existence of Small Separators Depends on Geometry for Geometric Inhomogeneous Random Graphs2017-11-10Paper
Greedy Routing and the Algorithmic Small-World Phenomenon2017-10-11Paper
Note on the coefficient of variations of neuronal spike trains2017-09-12Paper
\textsc{OneMax} in black-box models with several restrictions2017-07-07Paper
Fixed Budget Performance of the (1+1) EA on Linear Functions2017-05-10Paper
Connectivity thresholds for bounded size rules2016-12-09Paper
Normalization Phenomena in Asynchronous Networks2015-11-04Paper
Evolutionary algorithms for quantum computers2014-03-25Paper
Black-box complexities of combinatorial problems2013-02-19Paper
The global Cohen-Lenstra heuristic2012-11-09Paper
The Cohen-Lenstra heuristic: methodology and results2010-06-08Paper
A combinatorial interpretation of the probabilities of \(p\)-groups in the Cohen-Lenstra measure2008-12-08Paper
The Interval Liar Game2008-04-24Paper
The Interval Liar Game2007-05-29Paper
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs IN/APaper
Plus Strategies are Exponentially Slower for Planted Optima of Random HeightN/APaper
Faster Optimization Through Genetic DriftN/APaper

Research outcomes over time

This page was built for person: Johannes Lengler