Net and prune: a linear time algorithm for euclidean distance problems. Har-Peled, S. & Adam Raichel, B. In Proceedings of Symposium on the Theory of Computing (STOC), pages 605-614, 2013.
Paper bibtex @inproceedings{ dblp2398592,
title = {Net and prune: a linear time algorithm for euclidean distance problems},
author = {Sariel Har-Peled and Benjamin Adam Raichel},
author_short = {Har-Peled, S. and Adam Raichel, B.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2013},
key = {dblp2398592},
id = {dblp2398592},
biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/Har-PeledR13},
url = {http://doi.acm.org/10.1145/2488608.2488684},
conference = {STOC},
pages = {605-614},
text = {STOC 2013:605-614},
booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}
}
Downloads: 0
{"_id":"dXLAAEZSqcLxmuDWA","bibbaseid":"harpeled-adamraichel-netandprunealineartimealgorithmforeuclideandistanceproblems-2013","downloads":0,"creationDate":"2016-02-19T04:14:21.482Z","title":"Net and prune: a linear time algorithm for euclidean distance problems","author_short":["Har-Peled, S.","Adam Raichel, B."],"year":2013,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/stoc/Har-PeledR13","bibdata":{"title":"Net and prune: a linear time algorithm for euclidean distance problems","author":["Sariel Har-Peled","Benjamin Adam Raichel"],"author_short":["Har-Peled, S.","Adam Raichel, B."],"bibtype":"inproceedings","type":"inproceedings","year":"2013","key":"dblp2398592","id":"dblp2398592","biburl":"http://www.dblp.org/rec/bibtex/conf/stoc/Har-PeledR13","url":"http://doi.acm.org/10.1145/2488608.2488684","conference":"STOC","pages":"605-614","text":"STOC 2013:605-614","booktitle":"Proceedings of Symposium on the Theory of Computing (STOC)","bibtex":"@inproceedings{ dblp2398592,\n title = {Net and prune: a linear time algorithm for euclidean distance problems},\n author = {Sariel Har-Peled and Benjamin Adam Raichel},\n author_short = {Har-Peled, S. and Adam Raichel, B.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2013},\n key = {dblp2398592},\n id = {dblp2398592},\n biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/Har-PeledR13},\n url = {http://doi.acm.org/10.1145/2488608.2488684},\n conference = {STOC},\n pages = {605-614},\n text = {STOC 2013:605-614},\n booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}\n}","bibbaseid":"harpeled-adamraichel-netandprunealineartimealgorithmforeuclideandistanceproblems-2013","role":"author","urls":{"Paper":"http://doi.acm.org/10.1145/2488608.2488684"},"downloads":0},"search_terms":["net","prune","linear","time","algorithm","euclidean","distance","problems","har-peled","adam raichel"],"keywords":[],"authorIDs":[],"dataSources":["XTKPSAJhzFE4op4T6"]}