BibTeX record journals/jacm/Har-PeledR15

download as .bib file

@article{DBLP:journals/jacm/Har-PeledR15,
  author       = {Sariel Har{-}Peled and
                  Benjamin Raichel},
  title        = {Net and Prune: {A} Linear Time Algorithm for Euclidean Distance Problems},
  journal      = {J. {ACM}},
  volume       = {62},
  number       = {6},
  pages        = {44:1--44:35},
  year         = {2015},
  url          = {https://doi.org/10.1145/2831230},
  doi          = {10.1145/2831230},
  timestamp    = {Tue, 06 Nov 2018 12:51:44 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Har-PeledR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.