Maxim Buzdalov

106 papers A 15B 10C 9Journal 23Unranked 49
YearRankTypeTitle / Venue / Authors
2025 J jnl
First Steps Toward a Runtime Analysis When Starting With a Good Solution.
ACM Trans. Evol. Learn. Optim.
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2025 — conf
Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution.
GECCO Companion
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2025 A conf
In the Search of Optimal Tree Networks: Hardness and Heuristics.
GECCO
Pavel Martynov, Maxim Buzdalov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
2024 — conf
A Simple Statistical Test Against Origin-Biased Metaheuristics.
EvoApplications@EvoStar
Aidan Walden, Maxim Buzdalov
2024 J jnl
In the Search of Optimal Tree Networks: Hardness and Heuristics.
CoRR
Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
2024 J jnl
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution.
Algorithmica
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2023 — conf
Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches.
GECCO Companion
Maxim Buzdalov
2023 J jnl
Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches.
CoRR
Maxim Buzdalov
2023 A conf
Using Automated Algorithm Configuration for Parameter Control.
FOGA
Deyao Chen, Maxim Buzdalov, Carola Doerr, Nguyen Dang
2023 J jnl
Using Automated Algorithm Configuration for Parameter Control.
CoRR
Deyao Chen, Maxim Buzdalov, Carola Doerr, Nguyen Dang
2022 J jnl
Fast Mutation in Crossover-Based Algorithms.
Algorithmica
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2022 J jnl
Fixed-Target Runtime Analysis.
Algorithmica
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
2022 A conf
On optimal static and dynamic parameter choices for fixed-target optimization.
GECCO
Dmitry Vinokurov, Maxim Buzdalov
2022 B conf
The $(1+(\lambda, \lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus.
CEC
Maxim Buzdalov
2022 — conf
Towards Fixed-Target Black-Box Complexity Analysis.
PPSN (2)
Dmitry Vinokurov, Maxim Buzdalov
2021 B conf
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms.
CEC
Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr
2021 J jnl
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms.
CoRR
Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr
2021 — conf
Labeling-oriented non-dominated sorting is Θ(
GECCO Companion
Sumit Mishra, Ved Prakash, Maxim Buzdalov
2021 J jnl
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution.
CoRR
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2021 A conf
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution.
GECCO
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2021 J jnl
Optimal Static Mutation Strength Distributions for the (1+λ) Evolutionary Algorithm on OneMax.
CoRR
Maxim Buzdalov, Carola Doerr
2021 A conf
Optimal static mutation strength distributions for the (1
GECCO
Maxim Buzdalov, Carola Doerr
2020 J jnl
Fast Mutation in Crossover-based Algorithms.
CoRR
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020 A conf
Fast mutation in crossover-based algorithms.
GECCO
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020 — conf
Filter Sort Is $\varOmega (N^3)$ in the Worst Case.
PPSN (2)
Sumit Mishra, Maxim Buzdalov
2020 J jnl
First Steps Towards a Runtime Analysis When Starting With a Good Solution.
CoRR
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020 — conf
First Steps Towards a Runtime Analysis When Starting with a Good Solution.
PPSN (2)
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2020 J jnl
Fixed-Target Runtime Analysis.
CoRR
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
2020 A conf
Fixed-target runtime analysis.
GECCO
Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov
2020 A conf
If unsure, shuffle: deductive sort is Θ(
GECCO
Sumit Mishra, Maxim Buzdalov
2020 — conf
Optimal Mutation Rates for the (1+λ ) EA on OneMax.
PPSN (2)
Maxim Buzdalov, Carola Doerr
2020 J jnl
Optimal Mutation Rates for the (1+λ) EA on OneMax.
CoRR
Maxim Buzdalov, Carola Doerr
2020 — conf
Optimizing Robotic Cheetah Leg Parameters Using Evolutionary Algorithms.
BIOMA
Maxim Buzdalov, Sergey A. Kolyubin, Artem A. Egorov, Ivan I. Borisov
2020 J jnl
The $(1+(λ, λ))$ Genetic Algorithm for Permutations.
CoRR
Anton O. Bassin, Maxim Buzdalov
2020 — conf
The (1 + (
GECCO Companion
Anton O. Bassin, Maxim Buzdalov
2020 — conf
Time complexity analysis of the dominance degree approach for non-dominated sorting.
GECCO Companion
Sumit Mishra, Maxim Buzdalov, Rakesh Senwar
2019 J jnl
Black-Box Complexity of the Binary Value Function.
CoRR
Nina Bulanova, Maxim Buzdalov
2019 — conf
Black-box complexity of the binary value function.
GECCO (Companion)
Nina Bulanova, Maxim Buzdalov
2019 A conf
Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks.
GECCO
Artem Pavlenko, Maxim Buzdalov, Vladimir Ulyantsev
2019 — conf
Fixed-target runtime analysis of the (1 + 1) EA with resampling.
GECCO (Companion)
Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr
2019 — conf
Generalized incremental orthant search: towards efficient steady-state evolutionary multiobjective algorithms.
GECCO (Companion)
Maxim Buzdalov
2019 — conf
Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper.
GECCO (Companion)
Ivan Ignashov, Arina Buzdalova, Maxim Buzdalov, Carola Doerr
2019 — conf
Limited memory, limited arity unbiased black-box complexity: first insights.
GECCO (Companion)
Nina Bulanova, Maxim Buzdalov
2019 C conf
Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting.
EMO
Maxim Buzdalov
2019 C conf
Permutation Encoding for Automatic Reconstruction of Connections in Closed-Loop Control System using Evolutionary Algorithm.
ETFA
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
2019 J jnl
The 1/5-th Rule with Rollbacks: On Self-Adjustment of the Population Size in the (1+(λ, λ)) GA.
CoRR
Anton O. Bassin, Maxim Buzdalov
2019 — conf
The 1/5-th rule with rollbacks: on self-adjustment of the population size in the (1 + (
GECCO (Companion)
Anton O. Bassin, Maxim Buzdalov
2019 — conf
Towards better estimation of statistical significance when comparing evolutionary algorithms.
GECCO (Companion)
Maxim Buzdalov
2018 C conf
Automatic Plant-Controller Input/Output Matching using Evolutionary Algorithms.
ETFA
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
2018 J jnl
Better Fixed-Arity Unbiased Black-Box Algorithms.
CoRR
Nina Bulanova, Maxim Buzdalov
2018 — conf
Better fixed-arity unbiased black-box algorithms.
GECCO (Companion)
Nina Bulanova, Maxim Buzdalov
2018 — conf
From fitness landscape analysis to designing evolutionary algorithms: the case study in automatic generation of function block applications.
GECCO (Companion)
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
2018 A conf
Generalized offline orthant search: one code for many problems in multiobjective optimization.
GECCO
Maxim Buzdalov
2018 J jnl
On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms.
CoRR
Ilya Yakupov, Maxim Buzdalov
2018 — conf
On asynchronous non-dominated sorting for steady-state multiobjective evolutionary algorithms.
GECCO (Companion)
Ilya Yakupov, Maxim Buzdalov
2018 — conf
Towards Large-Scale Multiobjective Optimisation with a Hybrid Algorithm for Non-dominated Sorting.
PPSN (1)
Margarita Markina, Maxim Buzdalov
2017 C conf
Automatic generation of function block applications using evolutionary algorithms: Initial explorations.
INDIN
Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin
2017 — conf
Evaluation of heavy-tailed mutation operator on maximum flow test generation problem.
GECCO (Companion)
Vladimir Mironovich, Maxim Buzdalov
2017 J jnl
Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort.
CoRR
Margarita Markina, Maxim Buzdalov
2017 — conf
Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort.
GECCO (Companion)
Margarita Markina, Maxim Buzdalov
2017 A conf
Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization.
GECCO
Ilya Yakupov, Maxim Buzdalov
2017 — conf
On binary unbiased operators returning multiple offspring.
GECCO (Companion)
Nina Bulanova, Maxim Buzdalov
2017 J jnl
Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas.
CoRR
Maxim Buzdalov, Benjamin Doerr
2017 A conf
Runtime analysis of the (1 + (
GECCO
Maxim Buzdalov, Benjamin Doerr
2017 — conf
The unrestricted black-box complexity of jump functions.
GECCO (Companion)
Maxim Buzdalov, Benjamin Doerr, Mikhail Kever
2016 A conf
A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search.
GECCO
Andrey Vasin, Maxim Buzdalov
2016 — conf
An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities.
GECCO (Companion)
Maxim Buzdalov
2016 — conf
Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting.
GECCO (Companion)
Niyaz Nigmatullin, Maxim Buzdalov, Andrey Stankevich
2016 — conf
Fitness-Dependent Hybridization of Clonal Selection Algorithm and Random Local Search.
GECCO (Companion)
Nina Bulanova, Arina Buzdalova, Maxim Buzdalov
2016 — conf
GECCO'16 Workshop on Algorithms and Data Structures for Evolutionary Computation Chairs' Welcome.
GECCO (Companion)
Maxim Buzdalov
2016 — conf
Preserving diversity in auxiliary objectives provably speeds up crossing plateaus.
SSCI
Tatyana Polevaya, Maxim Buzdalov
2016 — conf
Runtime analysis of different Approaches to select conflicting auxiliary objectives in the generalized OneMax problem.
SSCI
Arina Buzdalova, Irina Petrova, Maxim Buzdalov
2016 J jnl
The Unrestricted Black-Box Complexity of Jump Functions.
Evol. Comput.
Maxim Buzdalov, Benjamin Doerr, Mikhail Kever
2015 C conf
An Asynchronous Implementation of the Limited Memory CMA-ES.
ICMLA
Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto
2015 J jnl
An Asynchronous Implementation of the Limited Memory CMA-ES.
CoRR
Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto
2015 B conf
Analysis of Q-learning with random exploration for selection of auxiliary objectives in random local search.
CEC
Maxim Buzdalov, Arina Buzdalova
2015 B conf
Can OneMax help optimizing LeadingOnes using the EA+RL method?
CEC
Maxim Buzdalov, Arina Buzdalova
2015 A conf
Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting.
GECCO
Maxim Buzdalov, Ilya Yakupov, Andrey Stankevich
2015 — conf
Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm.
GECCO (Companion)
Vladimir Mironovich, Maxim Buzdalov
2015 B conf
Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited.
CEC
Maxim Buzdalov, Anatoly Shalyto
2015 B conf
Incremental non-dominated sorting with O(N) insertion for the two-dimensional case.
CEC
Ilya Yakupov, Maxim Buzdalov
2015 B conf
Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem.
EvoCOP
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
2015 B conf
Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ.
EvoCOP
Maxim Buzdalov, Mikhail Kever, Benjamin Doerr
2015 — conf
Various Degrees of Steadiness in NSGA-II and Their Influence on the Quality of Results.
GECCO (Companion)
Maxim Buzdalov, Vladimir Parfenov
2014 C conf
A New Algorithm for Adaptive Online Selection of Auxiliary Objectives.
ICMLA
Arina Buzdalova, Maxim Buzdalov
2014 A conf
A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting.
PPSN
Maxim Buzdalov, Anatoly Shalyto
2014 C conf
A Switch-and-Restart Algorithm with Exponential Restart Strategy for Objective Selection and its Runtime Analysis.
ICMLA
Maxim Buzdalov
2014 — conf
Formal Verification of 800 Genetically Constructed Automata Programs: A Case Study.
Haifa Verification Conference
Mikhail Lukin, Maxim Buzdalov, Anatoly Shalyto
2014 C conf
Improved Selection of Auxiliary Objectives Using Reinforcement Learning in Non-stationary Environment.
ICMLA
Irina Petrova, Arina Buzdalova, Maxim Buzdalov
2014 — conf
NSGA-II implementation details may influence quality of solutions for the job-shop scheduling problem.
GECCO (Companion)
Maxim Buzdalov, Irina Petrova, Arina Buzdalova
2014 — conf
Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL.
GECCO (Companion)
Maxim Buzdalov, Arina Buzdalova
2014 C conf
Protein Conformation Motion Modeling Using Sep-CMA-ES.
ICMLA
Maxim Buzdalov, Sergey Knyazev, Yuri Porozov
2014 — conf
Selecting evolutionary operators using reinforcement learning: initial explorations.
GECCO (Companion)
Arina Buzdalova, Vladislav Kononov, Maxim Buzdalov
2014 — conf
Worst-Case Execution Time Test Generation for Solutions of the Knapsack Problem Using a Genetic Algorithm.
BIC-TA
Maxim Buzdalov, Anatoly Shalyto
2013 — conf
A First Step towards the Runtime Analysis of Evolutionary Algorithm Adjusted with Reinforcement Learning.
ICMLA (1)
Maxim Buzdalov, Arina Buzdalova, Anatoly Shalyto
2013 B conf
Adaptive selection of helper-objectives for test case generation.
IEEE Congress on Evolutionary Computation
Maxim Buzdalov, Arina Buzdalova
2013 B conf
Generation of Tests for Programming Challenge Tasks Using Helper-Objectives.
SSBSE
Arina Buzdalova, Maxim Buzdalov, Vladimir Parfenov
2013 — conf
Generation of tests for programming challenge tasks using multi-objective optimization.
GECCO (Companion)
Maxim Buzdalov, Arina Buzdalova, Irina Petrova
2013 — conf
Improved Helper-Objective Optimization Strategy for Job-Shop Scheduling Problem.
ICMLA (2)
Irina Petrova, Arina Buzdalova, Maxim Buzdalov
2013 — conf
Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms Using Genetic Algorithms.
ICMLA (2)
Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto
2012 — conf
Adaptive Selection of Helper-Objectives with Reinforcement Learning.
ICMLA (2)
Arina Buzdalova, Maxim Buzdalov
2012 — conf
Evolving EFSMs solving a path-planning problem by genetic programming.
GECCO (Companion)
Maxim Buzdalov, Andrey Sokolov
2012 — conf
Generation of Tests for Programming Challenge Tasks on Graph Theory Using Evolution Strategy.
ICMLA (2)
Maxim Buzdalov
2012 — conf
Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning.
ICMLA (1)
Arina Buzdalova, Maxim Buzdalov
2011 — conf
Choosing Best Fitness Function with Reinforcement Learning.
ICMLA (2)
Arina Afanasyeva, Maxim Buzdalov
2011 — conf
Generation of tests for programming challenge tasks using evolution algorithms.
GECCO (Companion)
Maxim Buzdalov