The following pages link to Johannes Lengler (Q350717):
Displaying 39 items.
- Connectivity thresholds for bounded size rules (Q350719) (← links)
- A combinatorial interpretation of the probabilities of \(p\)-groups in the Cohen-Lenstra measure (Q958711) (← links)
- The Cohen-Lenstra heuristic: methodology and results (Q975100) (← links)
- Geometric inhomogeneous random graphs (Q1713405) (← links)
- Sorting by swaps with noisy comparisons (Q1725654) (← links)
- The \((1+1)\) elitist black-box complexity of LeadingOnes (Q1750359) (← links)
- Asymptotically optimal amplifiers for the Moran process (Q1755587) (← links)
- The global Cohen-Lenstra heuristic (Q1758443) (← links)
- Black-box complexities of combinatorial problems (Q1935820) (← links)
- Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions (Q2034777) (← links)
- Greedy routing and the algorithmic small-world phenomenon (Q2071825) (← links)
- Penalising transmission to hubs in scale-free spatial random graphs (Q2077353) (← links)
- Random sampling with removal (Q2207595) (← links)
- Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function (Q2233519) (← links)
- Self-adjusting mutation rates with provably optimal success rules (Q2240130) (← links)
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming (Q2306017) (← links)
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time (Q2306019) (← links)
- The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates (Q2315023) (← links)
- \textsc{OneMax} in black-box models with several restrictions (Q2362361) (← links)
- Note on the coefficient of variations of neuronal spike trains (Q2403822) (← links)
- Evolutionary algorithms for quantum computers (Q2441596) (← links)
- The complex parameter landscape of the compact genetic algorithm (Q2661997) (← links)
- Fixed Budget Performance of the (1+1) EA on Linear Functions (Q2981882) (← links)
- Random Sampling with Removal. (Q3132874) (← links)
- Drift Analysis and Evolutionary Algorithms Revisited (Q3177365) (← links)
- The Interval Liar Game (Q3439615) (← links)
- Normalization Phenomena in Asynchronous Networks (Q3449516) (← links)
- Bootstrap percolation on geometric inhomogeneous random graphs (Q4598290) (← links)
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time (Q5111706) (← links)
- When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument (Q5195237) (← links)
- Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics (Q5197695) (← links)
- Exponential slowdown for larger populations (Q5215482) (← links)
- Bootstrap percolation with inhibition (Q5216182) (← links)
- Greedy Routing and the Algorithmic Small-World Phenomenon (Q5368989) (← links)
- The Interval Liar Game (Q5459127) (← links)
- The Maximum Label Propagation Algorithm on Sparse Random Graphs (Q5875518) (← links)
- Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions (Q6057833) (← links)
- Two-dimensional drift analysis: optimizing two functions simultaneously can be hard (Q6175522) (← links)
- An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (Q6334691) (← links)
