Barrier Trees For Search Analysis. - Jonathan Hallam; Adam Prügel-Bennett (GECCO, 2003)

Optimal simulated annealing schedules for larger problems. - William Benfold; Jonathan Hallam; Adam Prügel-Bennett (Congress on Evolutionary Computation, 2005)

Barrier-based models of hard problems and crossover. - Jonathan Hallam; Adam Prügel-Bennett (Congress on Evolutionary Computation, 2005)

Large Barrier Trees for Studying Search. - Jonathan Hallam; Adam Prügel-Bennett (IEEE Trans. Evol. Comput., 2005)

Barrier trees for studying search landscapes. - Jonathan Hallam (2006)

Optimal parameters for search using a barrier tree Markov model. - William Benfold; Jonathan Hallam; Adam Prügel-Bennett (Theor. Comput. Sci., 2007)