What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Algebra
His scientific interests lie mostly in Evolutionary algorithm, Algorithm, Combinatorics, Mathematical optimization and Function.
The concepts of his Evolutionary algorithm study are interwoven with issues in Discrete mathematics, Heuristics, Mutation rate, Evolutionary computation and Upper and lower bounds.
His study in the field of Time complexity also crosses realms of Test functions for optimization.
His Binary logarithm study in the realm of Combinatorics interacts with subjects such as Value.
His study focuses on the intersection of Mathematical optimization and fields such as Shortest path problem with connections in the field of Human-based evolutionary computation and Interactive evolutionary computation.
His Function research includes themes of Linear function, Spanning tree and Constant.
His most cited work include:
- Theory of Randomized Search Heuristics: Foundations and Recent Developments (256 citations)
- Why rumors spread so quickly in social networks (248 citations)
- Multiplicative Drift Analysis (194 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Combinatorics, Evolutionary algorithm, Discrete mathematics, Algorithm and Upper and lower bounds.
He interconnects Rounding and Constant in the investigation of issues within Combinatorics.
His Evolutionary algorithm research incorporates themes from Function, Genetic algorithm, Evolutionary computation and Heuristics.
His Function research integrates issues from Black box, Simple, Mutation rate, Applied mathematics and Benchmark.
His Discrete mathematics research is multidisciplinary, relying on both Linear programming, Expected value and Random walk.
His work on Asymptotically optimal algorithm and Randomized algorithm as part of general Algorithm study is frequently linked to Test functions for optimization, therefore connecting diverse disciplines of science.
He most often published in these fields:
- Combinatorics (46.47%)
- Evolutionary algorithm (33.58%)
- Discrete mathematics (25.06%)
What were the highlights of his more recent work (between 2018-2021)?
- Evolutionary algorithm (33.58%)
- Genetic algorithm (11.19%)
- Function (16.79%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Evolutionary algorithm, Genetic algorithm, Function, Upper and lower bounds and Combinatorics.
His Evolutionary algorithm study necessitates a more in-depth grasp of Mathematical optimization.
His studies in Genetic algorithm integrate themes in fields like Algorithm, Distribution, Mutation and Exponential function.
His Function study incorporates themes from Evolutionary computation, Simple and Polynomial.
Benjamin Doerr combines subjects such as Symmetry, Logarithm and Applied mathematics with his study of Upper and lower bounds.
His study in the fields of Binary logarithm under the domain of Combinatorics overlaps with other disciplines such as Lambda.
Between 2018 and 2021, his most popular works were:
- Analyzing randomized search heuristics via stochastic domination (46 citations)
- A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost (33 citations)
- Theory of evolutionary computation : recent developments in discrete optimization (27 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Algebra
- Combinatorics
His primary areas of investigation include Evolutionary algorithm, Function, Genetic algorithm, Mathematical optimization and Benchmark.
His work carried out in the field of Evolutionary algorithm brings together such families of science as Discrete mathematics, Multiplicative function, Probabilistic logic, Mutation rate and Constant.
His Genetic algorithm research incorporates elements of EDAS, Estimation of distribution algorithm, Algorithm, Applied mathematics and Upper and lower bounds.
His work deals with themes such as Black box and Unary operation, which intersect with Algorithm.
Benjamin Doerr conducts interdisciplinary study in the fields of Test functions for optimization and Combinatorics through his research.
His studies deal with areas such as Matching and Order as well as Combinatorics.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
