%0 Conference Paper %1 conf/dagstuhl/ArgeBHY04 %A Arge, Lars %A de Berg, Mark %A Haverkort, Herman J. %A Yi, Ke %B Cache-Oblivious and Cache-Aware Algorithms %D 2004 %E Arge, Lars %E Bender, Michael A. %E Demaine, Erik D. %E Leiserson, Charles E. %E Mehlhorn, Kurt %I IBFI, Schloss Dagstuhl, Germany %K dblp %T The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. %U http://dblp.uni-trier.de/db/conf/dagstuhl/P4301.html#ArgeBHY04 %V 04301

@inproceedings{conf/dagstuhl/ArgeBHY04, added-at = {2019-05-21T00:00:00.000+0200}, author = {Arge, Lars and de Berg, Mark and Haverkort, Herman J. and Yi, Ke}, biburl = {https://www.bibsonomy.org/bibtex/2ef85cb42a95c023f8e0f1e20fa0ba4d0/dblp}, booktitle = {Cache-Oblivious and Cache-Aware Algorithms}, crossref = {conf/dagstuhl/2004P4301}, editor = {Arge, Lars and Bender, Michael A. and Demaine, Erik D. and Leiserson, Charles E. and Mehlhorn, Kurt}, ee = {http://drops.dagstuhl.de/opus/volltexte/2005/155}, interhash = {e229ef3addaea2e90e868ca2f0e2ccbb}, intrahash = {ef85cb42a95c023f8e0f1e20fa0ba4d0}, keywords = {dblp}, publisher = {IBFI, Schloss Dagstuhl, Germany}, series = {Dagstuhl Seminar Proceedings}, timestamp = {2024-04-09T10:22:54.000+0200}, title = {The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.}, url = {http://dblp.uni-trier.de/db/conf/dagstuhl/P4301.html#ArgeBHY04}, volume = 04301, year = 2004 }