%0 Conference Paper %1 conf/esa/DickersonDG00 %A Dickerson, Matthew %A Duncan, Christian A. %A Goodrich, Michael T. %B ESA %D 2000 %E Paterson, Mike %I Springer %K dblp %P 179-190 %T K-D Trees Are Better when Cut on the Longest Side. %U http://dblp.uni-trier.de/db/conf/esa/esa2000.html#DickersonDG00 %V 1879 %@ 3-540-41004-X

@inproceedings{conf/esa/DickersonDG00, added-at = {2017-05-24T00:00:00.000+0200}, author = {Dickerson, Matthew and Duncan, Christian A. and Goodrich, Michael T.}, biburl = {https://www.bibsonomy.org/bibtex/2b8a67bfe6329353cf4a04a4e188be50f/dblp}, booktitle = {ESA}, crossref = {conf/esa/2000}, editor = {Paterson, Mike}, ee = {https://doi.org/10.1007/3-540-45253-2_17}, interhash = {794eee37f6b1c9ba1acbe508814a4862}, intrahash = {b8a67bfe6329353cf4a04a4e188be50f}, isbn = {3-540-41004-X}, keywords = {dblp}, pages = {179-190}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:37:51.000+0200}, title = {K-D Trees Are Better when Cut on the Longest Side.}, url = {http://dblp.uni-trier.de/db/conf/esa/esa2000.html#DickersonDG00}, volume = 1879, year = 2000 }