BibTeX record conf/focs/AndoniCP08

download as .bib file

@inproceedings{DBLP:conf/focs/AndoniCP08,
  author    = {Alexandr Andoni and
               Dorian Croitoru and
               Mihai Patrascu},
  title     = {Hardness of Nearest Neighbor under L-infinity},
  booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  pages     = {424--433},
  year      = {2008},
  crossref  = {DBLP:conf/focs/2008},
  url       = {https://doi.org/10.1109/FOCS.2008.89},
  doi       = {10.1109/FOCS.2008.89},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/AndoniCP08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2008,
  title     = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {https://ieeexplore.ieee.org/xpl/conhome/4690923/proceeding},
  isbn      = {978-0-7695-3436-7},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics