The Unrestricted Black-Box Complexity of Jump Functions | Citedby Results | Evolutionary Computation | MIT Press

Skip to Main Content

Skip Nav Destination

The Unrestricted Black-Box Complexity of Jump Functions

Evolutionary Computation (2016) 24 (4): 719–744.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

First Steps Toward a Runtime Analysis When Starting With a Good Solution

Denis Antipov
Maxim Buzdalov
Benjamin Doerr

ACM Transactions on Evolutionary Learning and Optimization (2025) 5 (2): 1.

A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions

Denis Antipov
Benjamin Doerr
Vitalii Karavaev

Algorithmica (2022) 84 (6): 1573.

Self-Adjusting Evolutionary Algorithms for Multimodal Optimization

Amirhossein Rajabi
Carsten Witt

Algorithmica (2022) 84 (6): 1694.

Precise Runtime Analysis for Plateau Functions

Denis Antipov
Benjamin Doerr

ACM Transactions on Evolutionary Learning and Optimization (2021) 1 (4): 1.

The Runtime of the Compact Genetic Algorithm on Jump Functions

Benjamin Doerr

Algorithmica (2021) 83 (10): 3059.

Optimal parameter choices via precise black-box analysis

Benjamin Doerr
Carola Doerr
Jing Yang

Theoretical Computer Science (2020) 801: 1.