BibTeX record conf/stoc/Rubinstein18

download as .bib file

@inproceedings{DBLP:conf/stoc/Rubinstein18,
  author    = {Aviad Rubinstein},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Hardness of approximate nearest neighbor search},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {1260--1268},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188916},
  doi       = {10.1145/3188745.3188916},
  timestamp = {Wed, 21 Nov 2018 12:44:02 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/Rubinstein18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics