Box-trees and R-trees with near-optimal query time (Q1849440): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pankaj K. Agarwal / rank
Normal rank
 
Property / author
 
Property / author: Mark T. de Berg / rank
Normal rank
 
Property / author
 
Property / author: Joachim Gudmundsson / rank
Normal rank
 
Property / author
 
Property / author: Mikael Hammar / rank
Normal rank
 
Property / author
 
Property / author: Herman J. Haverkort / rank
Normal rank
 
Property / author
 
Property / author: Pankaj K. Agarwal / rank
 
Normal rank
Property / author
 
Property / author: Mark T. de Berg / rank
 
Normal rank
Property / author
 
Property / author: Joachim Gudmundsson / rank
 
Normal rank
Property / author
 
Property / author: Mikael Hammar / rank
 
Normal rank
Property / author
 
Property / author: Herman J. Haverkort / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-002-2817-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134438395 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:50, 20 March 2024

scientific article
Language Label Description Also known as
English
Box-trees and R-trees with near-optimal query time
scientific article

    Statements

    Box-trees and R-trees with near-optimal query time (English)
    0 references
    1 December 2002
    0 references
    0 references
    box-tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references