Finding Hamilton cycles in random graphs with few queries

Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira. Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms, 49(4):635-668, 2016. [doi]

@article{FerberKSV16,
  title = {Finding Hamilton cycles in random graphs with few queries},
  author = {Asaf Ferber and Michael Krivelevich and Benny Sudakov and Pedro Vieira},
  year = {2016},
  doi = {10.1002/rsa.20679},
  url = {http://dx.doi.org/10.1002/rsa.20679},
  researchr = {https://researchr.org/publication/FerberKSV16},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {49},
  number = {4},
  pages = {635-668},
}