@InProceedings{laarhoven:LIPIcs.SoCG.2018.57,
  author =	{Laarhoven, Thijs},
  title =	{{Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors}},
  booktitle =	{34th International Symposium on Computational Geometry (SoCG 2018)},
  pages =	{57:1--57:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-066-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{99},
  editor =	{Speckmann, Bettina and T\'{o}th, Csaba D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.57},
  URN =		{urn:nbn:de:0030-drops-87700},
  doi =		{10.4230/LIPIcs.SoCG.2018.57},
  annote =	{Keywords: approximate nearest neighbor problem, near neighbor graphs, locality-sensitive hashing, locality-sensitive filters, similarity search}
}