On the difficulty of range searching (Q5057458): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/3-540-60220-8_86 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1541859460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient worst-case data structures for range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: I. The reporting case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: part II. The arithmetic model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for union-split-find related problems on random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:03, 31 July 2024

scientific article; zbMATH DE number 7633566
Language Label Description Also known as
English
On the difficulty of range searching
scientific article; zbMATH DE number 7633566

    Statements