How Hard is Halfspace Range Searching?. Brönnimann, H. & Chazelle, B. In Symposium on Computational Geometry, pages 271-275, 1992. ACM. Link Paper bibtex @inproceedings{ conf/compgeom/BronnimannC92,
added-at = {2015-01-30T00:00:00.000+0100},
author = {Brönnimann, Hervé and Chazelle, Bernard},
biburl = {http://www.bibsonomy.org/bibtex/2f40d22f75957c31c39456c2bf7925bc6/dblp},
booktitle = {Symposium on Computational Geometry},
crossref = {conf/compgeom/1992},
editor = {Avis, David},
ee = {http://doi.acm.org/10.1145/142675.142730},
interhash = {377fea4f7c31792153f8229005cee2de},
intrahash = {f40d22f75957c31c39456c2bf7925bc6},
isbn = {0-89791-517-8},
keywords = {dblp},
pages = {271-275},
publisher = {ACM},
title = {How Hard is Halfspace Range Searching?},
url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#BronnimannC92},
year = {1992}
}
Downloads: 0
{"_id":"G2xGj49C5gceoCeXk","bibbaseid":"brnnimann-chazelle-howhardishalfspacerangesearching-1992","downloads":0,"creationDate":"2015-05-07T12:05:09.317Z","title":"How Hard is Halfspace Range Searching?","author_short":["Brönnimann, H.","Chazelle, B."],"year":1992,"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/bernard?items=1000","bibdata":{"added-at":"2015-01-30T00:00:00.000+0100","author":["Brönnimann, Hervé","Chazelle, Bernard"],"author_short":["Brönnimann, H.","Chazelle, B."],"bibtex":"@inproceedings{ conf/compgeom/BronnimannC92,\n added-at = {2015-01-30T00:00:00.000+0100},\n author = {Brönnimann, Hervé and Chazelle, Bernard},\n biburl = {http://www.bibsonomy.org/bibtex/2f40d22f75957c31c39456c2bf7925bc6/dblp},\n booktitle = {Symposium on Computational Geometry},\n crossref = {conf/compgeom/1992},\n editor = {Avis, David},\n ee = {http://doi.acm.org/10.1145/142675.142730},\n interhash = {377fea4f7c31792153f8229005cee2de},\n intrahash = {f40d22f75957c31c39456c2bf7925bc6},\n isbn = {0-89791-517-8},\n keywords = {dblp},\n pages = {271-275},\n publisher = {ACM},\n title = {How Hard is Halfspace Range Searching?},\n url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#BronnimannC92},\n year = {1992}\n}","bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bibtex/2f40d22f75957c31c39456c2bf7925bc6/dblp","booktitle":"Symposium on Computational Geometry","crossref":"conf/compgeom/1992","editor":["Avis, David"],"editor_short":["Avis, D."],"ee":"http://doi.acm.org/10.1145/142675.142730","id":"conf/compgeom/BronnimannC92","interhash":"377fea4f7c31792153f8229005cee2de","intrahash":"f40d22f75957c31c39456c2bf7925bc6","isbn":"0-89791-517-8","key":"conf/compgeom/BronnimannC92","keywords":"dblp","pages":"271-275","publisher":"ACM","title":"How Hard is Halfspace Range Searching?","type":"inproceedings","url":"http://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#BronnimannC92","year":"1992","bibbaseid":"brnnimann-chazelle-howhardishalfspacerangesearching-1992","role":"author","urls":{"Link":"http://doi.acm.org/10.1145/142675.142730","Paper":"http://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#BronnimannC92"},"keyword":["dblp"],"downloads":0},"search_terms":["hard","halfspace","range","searching","brönnimann","chazelle"],"keywords":["dblp"],"authorIDs":[],"dataSources":["wvAhRjakvxMweG8ZA"]}