Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
 

Summary: The Priority R-Tree: A Practically Efficient
and Worst-Case Optimal R-Tree
Lars Arge
Department of Computer Science
Duke University, Box 90129
Durham, NC 27708-0129
USA
large@cs.duke.edu
Mark de Berg
Department of Computer Science
TU Eindhoven, P.O.Box 513
5600 MB Eindhoven
The Netherlands
m.t.d.berg@tue.nl
Herman J. Haverkort
Institute of Information
and Computing Sciences
Utrecht University, PO Box 80 089
3508 TB Utrecht, The Netherlands
herman@cs.uu.nl

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet
Danner, Andrew - Computer Science Department, Swarthmore College

 

Collections: Computer Technologies and Information Sciences