BibTeX record conf/dagstuhl/ArgeBHY04

download as .bib file

@inproceedings{DBLP:conf/dagstuhl/ArgeBHY04,
  author       = {Lars Arge and
                  Mark de Berg and
                  Herman J. Haverkort and
                  Ke Yi},
  editor       = {Lars Arge and
                  Michael A. Bender and
                  Erik D. Demaine and
                  Charles E. Leiserson and
                  Kurt Mehlhorn},
  title        = {The Priority R-Tree: {A} Practically Efficient and Worst-Case-Optimal
                  R-Tree},
  booktitle    = {Cache-Oblivious and Cache-Aware Algorithms, 18.07. - 23.07.2004},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {04301},
  publisher    = {IBFI, Schloss Dagstuhl, Germany},
  year         = {2004},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2005/155},
  timestamp    = {Thu, 10 Jun 2021 13:02:05 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/ArgeBHY04.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.