An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W172147963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Binary Search Trees in Database Applications / 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: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear space data structures for two types of range search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quad trees: A data structure for retrieval by composite keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on the Complexity of Orthogonal Range Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Complexity of Some Optimal Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quintary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying look at data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Data Structures for Orthogonal Range Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding range restriction capability to dynamic data structures / rank
 
Normal rank

Latest revision as of 10:45, 20 June 2024

scientific article; zbMATH DE number 4115988
Language Label Description Also known as
English
An application of $m$-ary trees to the design of data structures for geometric searching problems
scientific article; zbMATH DE number 4115988

    Statements

    An application of $m$-ary trees to the design of data structures for geometric searching problems (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    ECDF searching problem
    0 references
    data structures
    0 references
    0 references