Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{laarhoven:LIPIcs:2018:8770, author = {Thijs Laarhoven}, title = {{GraphBased TimeSpace TradeOffs for Approximate Near Neighbors}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {57:157:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8770}, URN = {urn:nbn:de:0030drops87700}, doi = {10.4230/LIPIcs.SoCG.2018.57}, annote = {Keywords: approximate nearest neighbor problem, near neighbor graphs, localitysensitive hashing, localitysensitive filters, similarity search} }
Keywords:  approximate nearest neighbor problem, near neighbor graphs, localitysensitive hashing, localitysensitive filters, similarity search  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue Date:  2018  
Date of publication:  24.05.2018 