3 citations · 3 across the 1 of their papers we have counts for
3 papers
The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates
Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler +4
We study unbiased evolutionary algorithms on linear functions with an unknown number of bits with non-zero weight. Static algorithms achieve an optimal runtime of $O(n…
Connectivity Thresholds for Bounded Size Rules
Hafsteinn Einarsson, Johannes Lengler, Konstantinos Panagiotou +2
In an Achlioptas process, starting with a graph that has n vertices and no edge, in each round edges are drawn uniformly at random, and using some rule exactly one of th…
Bootstrap percolation with inhibition
Hafsteinn Einarsson, Johannes Lengler, Konstantinos Panagiotou +2
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in roun…