Unbiased Black-Box Complexity of Parallel Search

Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt. Unbiased Black-Box Complexity of Parallel Search. In Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipic, Jim Smith, editors, Parallel Problem Solving from Nature - PPSN XIII - 13th International Conference, Ljubljana, Slovenia, September 13-17, 2014. Proceedings. Volume 8672 of Lecture Notes in Computer Science, pages 892-901, Springer, 2014. [doi]

@inproceedings{BadkobehLS14,
  title = {Unbiased Black-Box Complexity of Parallel Search},
  author = {Golnaz Badkobeh and Per Kristian Lehre and Dirk Sudholt},
  year = {2014},
  doi = {10.1007/978-3-319-10762-2_88},
  url = {http://dx.doi.org/10.1007/978-3-319-10762-2_88},
  researchr = {https://researchr.org/publication/BadkobehLS14},
  cites = {0},
  citedby = {0},
  pages = {892-901},
  booktitle = {Parallel Problem Solving from Nature - PPSN XIII - 13th International Conference, Ljubljana, Slovenia, September 13-17, 2014. Proceedings},
  editor = {Thomas Bartz-Beielstein and Jürgen Branke and Bogdan Filipic and Jim Smith},
  volume = {8672},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-10761-5},
}