Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190)

From MaRDI portal
Revision as of 05:14, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jal/AlstrupT00, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1455766
Language Label Description Also known as
English
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
scientific article; zbMATH DE number 1455766

    Statements

    Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (English)
    0 references
    0 references
    0 references
    5 June 2000
    0 references
    pointer machine algorithm
    0 references

    Identifiers