| Publication | Date of Publication | Type |
|---|
Lower bounds from fitness levels made easy
Algorithmica | 2024-01-25 | Paper |
| Maps of restrictions for behaviourally correct learning | 2022-12-07 | Paper |
| Towards a map for incremental learning in the limit from positive and negative information | 2022-03-22 | Paper |
Mapping monotonic restrictions in inductive inference
(available as arXiv preprint) | 2022-03-22 | Paper |
Learning languages with decidable hypotheses
(available as arXiv preprint) | 2022-03-22 | Paper |
Normal forms for semantically witness-based learners in inductive inference
(available as arXiv preprint) | 2022-03-22 | Paper |
Learning languages in the limit from positive information with finitely many memory changes
(available as arXiv preprint) | 2022-03-22 | Paper |
| Analysis of a Gray-Box Operator for Vertex Cover | 2022-03-16 | Paper |
Multiplicative up-drift
Algorithmica | 2021-11-05 | Paper |
Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Algorithmica | 2020-10-12 | Paper |
| Improved Fixed-Budget Results via Drift Analysis | 2020-06-12 | Paper |
Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
Theoretical Computer Science | 2020-05-26 | Paper |
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
Theoretical Computer Science | 2020-03-20 | Paper |
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
Theoretical Computer Science | 2020-03-20 | Paper |
First-hitting times under drift
Theoretical Computer Science | 2019-11-13 | Paper |
Unbiasedness of estimation-of-distribution algorithms
Theoretical Computer Science | 2019-07-31 | Paper |
| Limit Learning Equivalence Structures | 2019-02-21 | Paper |
Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Algorithmica | 2019-02-14 | Paper |
Solving problems with unknown solution length at almost no extra cost
Algorithmica | 2019-02-14 | Paper |
Island models meet rumor spreading
Algorithmica | 2019-02-14 | Paper |
| Normal forms in semantic language identification | 2019-01-10 | Paper |
| Intuitive Analyses via Drift Theory | 2018-05-22 | Paper |
Static and self-adjusting mutation strengths for multi-valued decision variables
Algorithmica | 2018-05-18 | Paper |
| Towards an atlas of computational learning theory | 2018-01-24 | Paper |
A solution to Wiehagen's thesis
Theory of Computing Systems | 2017-07-17 | Paper |
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Optimizing expected path lengths with ant colony optimization using fitness proportional update
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Resampling vs recombination: a statistical run time estimation
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
(1+1) EA on Generalized Dynamic OneMax
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
| A solution to Wiehagen's thesis | 2017-03-03 | Paper |
Strongly non-U-shaped language learning results by general techniques
Information and Computation | 2016-11-18 | Paper |
Enlarging learnable classes
Information and Computation | 2016-11-18 | Paper |
A map of update constraints in inductive inference
Theoretical Computer Science | 2016-10-21 | Paper |
Robustness of populations in stochastic environments
Algorithmica | 2016-08-31 | Paper |
Concentration of first hitting times under additive drift
Algorithmica | 2016-08-31 | Paper |
Fast learning of restricted regular expressions and dtds
Theory of Computing Systems | 2016-04-18 | Paper |
On the role of update constraints and text-types in iterative learning
Information and Computation | 2016-03-10 | Paper |
Topological separations in inductive inference
Theoretical Computer Science | 2016-02-26 | Paper |
The Benefit of Recombination in Noisy Evolutionary Search
Algorithms and Computation | 2016-01-11 | Paper |
Computability-theoretic learning complexity
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
On the role of update constraints and text-types in iterative learning
Lecture Notes in Computer Science | 2015-01-14 | Paper |
A map of update constraints in inductive inference
Lecture Notes in Computer Science | 2015-01-14 | Paper |
The unbiased black-box complexity of partition is polynomial
Artificial Intelligence | 2014-10-13 | Paper |
The Max problem revisited: the importance of mutation in genetic programming
Theoretical Computer Science | 2014-07-10 | Paper |
A normal form for argumentation frameworks
Theory and Applications of Formal Argumentation | 2014-03-31 | Paper |
Iterative learning from positive data and counters
Theoretical Computer Science | 2014-01-13 | Paper |
Topological separations in inductive inference
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Memory-limited non-U-shaped learning with solved open problems
Theoretical Computer Science | 2013-03-04 | Paper |
Black-box complexities of combinatorial problems
Theoretical Computer Science | 2013-02-19 | Paper |
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science | 2013-02-19 | Paper |
Learning secrets interactively. Dynamic modeling in inductive inference
Information and Computation | 2013-01-17 | Paper |
Enlarging learnable classes
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science | 2012-10-11 | Paper |
| Measuring learning complexity with criteria epitomizers | 2012-01-23 | Paper |
Iterative Learning from Positive Data and Counters
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
Lecture Notes in Computer Science | 2010-10-01 | Paper |
String extension learning using lattices
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Dynamically Delayed Postdictive Completeness and Consistency in Learning
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Dynamic Modeling in Inductive Inference
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Feasible Iteration of Feasible Learning Functionals
Lecture Notes in Computer Science | 2008-08-19 | Paper |
