Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Analysis of range search for random k-d trees
Home
Publications
Analysis of range search for random k-d trees
Analysis of range search for random k-d trees
Authors:
PC
Philippe Chanzy
Philippe Chanzy
LD
Luc Devroye
Luc Devroye
CZ
Carlos Zamora-Cura
Carlos Zamora-Cura
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 January 2001
journal article
research article
Published by
Springer Nature
in
Acta Informatica
Vol. 37
(4-5)
,
355-383
DOI:
10.1007/s002360000044
Abstract
No abstract available
Keywords
TIME COMPLEXITY
TIME ANALYSIS
PROBABILISTIC METHOD
RANDOM POINT
NEIGHBOR SEARCH
Cited
Cited by 26 articles
Scroll to top