Fractional cascading. I: A data structuring technique (Q1099957): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of an efficient priority queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional cascading. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and storing similar lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear line segment intersection, layered segment trees, and dynamization / rank
 
Normal rank

Revision as of 16:30, 18 June 2024

scientific article
Language Label Description Also known as
English
Fractional cascading. I: A data structuring technique
scientific article

    Statements

    Fractional cascading. I: A data structuring technique (English)
    0 references
    0 references
    1986
    0 references
    B-tree
    0 references
    iterative search
    0 references
    multiple look-up
    0 references
    dynamization of data structures
    0 references
    computational geometry
    0 references
    range queries
    0 references
    binary searches
    0 references
    fractional cascading
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references