On the difficulty of range searching (Q5057458): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Latest revision as of 03: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
On the difficulty of range searching (English)
0 references
16 December 2022
0 references