Per Kristian Lehre

Orcid: 0000-0002-9521-1251

Affiliations:
  • University of Birmingham, UK
  • University of Nottingham, UK (former)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function.
Algorithmica, July, 2024

More Precise Runtime Analyses of Non-elitist Evolutionary Algorithms in Uncertain Environments.
Algorithmica, February, 2024

Runtime analysis of a coevolutionary algorithm on impartial combinatorial games.
CoRR, 2024

Overcoming Binary Adversarial Optimisation with Competitive Coevolution.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Ranking Diversity Benefits Coevolutionary Algorithms on an Intransitive Game.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

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

A Self-adaptive Coevolutionary Algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

The SLO Hierarchy of pseudo-Boolean Functions and Runtime of Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Runtime Analysis of Coevolutionary Algorithms on a Class of Symmetric Zero-Sum Games.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Bicriteria Optimisation of Average and Worst-Case Performance Using Coevolutionary Algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2024

2023
Special Issue on Theoretical Foundations of Evolutionary Computation.
Theor. Comput. Sci., March, 2023

Analysis of a Pairwise Dominance Coevolutionary Algorithm with Spatial Topology.
Proceedings of the Genetic Programming Theory and Practice XX [GPTP 2023], 2023

Non-Elitist Evolutionary Multi-Objective Optimisation: Proof-of-Principle Results.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Runtime Analysis with Variable Cost.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Self-adaptation Can Help Evolutionary Algorithms Track Dynamic Optima.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Runtime Analysis of Population-based Evolutionary Algorithms - Part I: Steady State EAs.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Analysis of a Pairwise Dominance Coevolutionary Algorithm And DefendIt.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

How Fitness Aggregation Methods Affect the Performance of Competitive CoEAs on Bilinear Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

Is CC-(1+1) EA More Efficient than (1+1) EA on Separable and Inseparable Problems?
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

2022
Self-adaptation via Multi-objectivisation: An Empirical Study.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Self-adaptation via multi-objectivisation: a theoretical study.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Runtime analysis of population-based evolutionary algorithms.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Fast non-elitist evolutionary algorithms with power-law ranking selection.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2021
Tail bounds on hitting times of randomized search heuristics using variable drift analysis.
Comb. Probab. Comput., 2021

Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes.
Algorithmica, 2021

Preface to the Special Issue on Theory of Genetic and Evolutionary Computation.
Algorithmica, 2021

More precise runtime analyses of non-elitist EAs in uncertain environments.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Escaping Local Optima with Non-Elitist Evolutionary Algorithms.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Parallel Black-Box Complexity With Tail Bounds.
IEEE Trans. Evol. Comput., 2020

Self-Adaptation in Nonelitist Evolutionary Algorithms on Discrete Problems With Unknown Structure.
IEEE Trans. Evol. Comput., 2020

Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown Structure.
CoRR, 2020

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

2019
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions.
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. Evol. Comput., 2018

Level-Based Analysis of Genetic Algorithms and Other Search Processes.
IEEE Trans. Evol. Comput., 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.
Evol. Comput., 2016

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

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
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

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

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. Evol. Comput., 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

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

Runtime analysis of evolutionary algorithms: basic introduction.
Proceedings of the Genetic and Evolutionary Computation Conference, 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. Evol. Comput., 2012

Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation".
Theor. Comput. Sci., 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.
Electron. Colloquium Comput. Complex., 2010

On the Effect of Populations in Evolutionary Multi-Objective Optimisation.
Evol. Comput., 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

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

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
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.
Biosyst., 2007

The genotypic complexity of evolved fault-tolerant and noise-robust circuits.
Biosyst., 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, 2003


  Loading...