Per Kristian Lehre

According to our database1, Per Kristian Lehre authored at least 83 papers between 2003 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions.
CoRR, 2019

On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help.
CoRR, 2019

Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise.
CoRR, 2019

Parallel Black-Box Complexity with Tail Bounds.
CoRR, 2019

Level-Based Analysis of the Univariate Marginal Distribution Algorithm.
Algorithmica, 2019

Runtime analysis of evolutionary algorithms: basic introduction: introductory tutorial at GECCO 2019.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Runtime analysis of the univariate marginal distribution algorithm under low selective pressure and prior noise.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

2018
Theoretical Analysis of Stochastic Search Algorithms.
Proceedings of the Handbook of Heuristics., 2018

Escaping Local Optima Using Crossover With Emergent Diversity.
IEEE Trans. Evolutionary Computation, 2018

Level-Based Analysis of Genetic Algorithms and Other Search Processes.
IEEE Trans. Evolutionary Computation, 2018

Level-Based Analysis of the Univariate Marginal Distribution Algorithm.
CoRR, 2018

Level-Based Analysis of the Population-Based Incremental Learning Algorithm.
CoRR, 2018

Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration.
CoRR, 2018


Level-Based Analysis of the Population-Based Incremental Learning Algorithm.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017
Theoretical Analysis of Stochastic Search Algorithms.
CoRR, 2017

Populations Can Be Essential in Tracking Dynamic Optima.
Algorithmica, 2017

Runtime analysis of population-based evolutionary algorithms: introductory tutorial at GECCO 2017.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016
A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
Evolutionary Computation, 2016

Evolution and Computing (Dagstuhl Seminar 16011).
Dagstuhl Reports, 2016

Self-adaptation of Mutation Rates in Non-elitist Populations.
CoRR, 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
CoRR, 2016

Populations can be essential in tracking dynamic optima.
CoRR, 2016

Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information.
Algorithmica, 2016


Self-adaptation of Mutation Rates in Non-elitist Populations.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Runtime Analysis of Population-based Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Limits to Learning in Reinforcement Learning Hyper-heuristics.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

2015
Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization.
CoRR, 2015

Runtime Analysis of Evolutionary Algorithms: Basic Introduction.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Simplified Runtime Analysis of Estimation of Distribution Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Populations can be Essential in Dynamic Optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

Black-box Complexity of Parallel Search with Distributed Populations.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014
Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation.
IEEE Trans. Evolutionary Computation, 2014

Runtime analysis of the (1 + 1) EA on computing unique input output sequences.
Inf. Sci., 2014

A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
CoRR, 2014

Level-based Analysis of Genetic Algorithms and other Search Processes.
CoRR, 2014

Level-Based Analysis of Genetic Algorithms and Other Search Processes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Unbiased Black-Box Complexity of Parallel Search.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Evolution under partial information.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Runtime analysis of selection hyper-heuristics with classical learning mechanisms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013
General Drift Analysis with Tail Bounds.
CoRR, 2013

The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A runtime analysis of simple hyper-heuristics: to mix or not to mix operators.
Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms.
IEEE Trans. Evolutionary Computation, 2012

Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation".
Theor. Comput. Sci., 2012

Black-Box Search by Unbiased Variation.
Algorithmica, 2012

Drift analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Crossover can be constructive when computing unique input-output sequences.
Soft Comput., 2011

Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation
CoRR, 2011

Fitness-levels for non-elitist populations.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Faster black-box algorithms through higher arity operators.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Non-uniform mutation rates for problems with unknown solution lengths.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

2010
Black-Box Search by Unbiased Variation.
Electronic Colloquium on Computational Complexity (ECCC), 2010

On the Effect of Populations in Evolutionary Multi-Objective Optimisation.
Evolutionary Computation, 2010

On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
CoRR, 2010

Faster Black-Box Algorithms Through Higher Arity Operators
CoRR, 2010

Negative Drift in Populations.
Proceedings of the Parallel Problem Solving from Nature, 2010

Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation.
Proceedings of the Parallel Problem Solving from Nature, 2010

Black-box search by unbiased variation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Ant colony optimization and the minimum cut problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
Runtime analysis of search heuristics on software engineering problems.
Frontiers Comput. Sci. China, 2009

Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

On the impact of the mutation-selection balance on the runtime of evolutionary algorithms.
Proceedings of the Foundations of Genetic Algorithms, 2009

Theoretical analysis of rank-based mutation - combining exploration and exploitation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

When is an estimation of distribution algorithm better than an evolutionary algorithm?
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2008
Crossover Can Be Constructive When Computing Unique Input Output Sequences.
Proceedings of the Simulated Evolution and Learning, 7th International Conference, 2008

Theoretical Runtime Analyses of Search Algorithms on the Test Data Generation for the Triangle Classification Problem.
Proceedings of the First International Conference on Software Testing Verification and Validation, 2008

2007
Phenotypic complexity and local variations in neutral degree.
Biosystems, 2007

The genotypic complexity of evolved fault-tolerant and noise-robust circuits.
Biosystems, 2007

Runtime analysis of (1+l) EA on computing unique input output sequences.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006
Accessibility and Runtime Between Convex Neutral Networks.
Proceedings of the Simulated Evolution and Learning, 6th International Conference, 2006

On the effect of populations in evolutionary multi-objective optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

2005
Evolved Digital Circuits and Genome Complexity.
Proceedings of the 2005 NASA / DoD Conference on Evolvable Hardware (EH 2005), 29 June, 2005

Accessibility between neutral networks in indirect genotype-phenotype mappings.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2003
Developmental mappings and phenotypic complexity.
Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, 8, 2003


  Loading...