Box-trees and R-trees with near-optimal query time (Q1849440)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1837069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Box-trees and R-trees with near-optimal query time |
scientific article; zbMATH DE number 1837069 |
Statements
Box-trees and R-trees with near-optimal query time (English)
0 references
1 December 2002
0 references
box-tree
0 references
0 references
0 references
0.86161673
0 references
0.86141646
0 references
0.8596612
0 references
0.85260737
0 references
0.85260737
0 references
0.8525666
0 references
