Kinetic heap-ordered trees: Tight analysis and improved algorithms (Q1853697)

From MaRDI portal
Revision as of 09:37, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Kinetic heap-ordered trees: Tight analysis and improved algorithms
scientific article

    Statements

    Kinetic heap-ordered trees: Tight analysis and improved algorithms (English)
    0 references
    22 January 2003
    0 references
    0 references
    kinetic data structures
    0 references
    heaps
    0 references
    computational geometry
    0 references
    data structures
    0 references
    0 references