Worst-case Analysis of Set Union Algorithms (Q3769963)

From MaRDI portal
Revision as of 22:26, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jacm/TarjanL84, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Worst-case Analysis of Set Union Algorithms
scientific article

    Statements

    title
    Worst-case Analysis of Set Union Algorithms (English)
    0 references
    author
    Jan van Leeuwen
    0 references
    Robert Endre Tarjan
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    equivalence algorithm
    0 references
    set union
    0 references
    inverse Ackermann function
    0 references
    asymptotic worst-case running time
    0 references
    path compression
    0 references

    Identifiers

    DOI
    10.1145/62.2160
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R99
    0 references
    68R10
    0 references
    zbMATH DE Number
    4028899
    0 references
    Wikidata QID
    Q56454027
    0 references
    OpenAlex ID
    W2044146725
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3769963&oldid=37910693"
    Powered by MediaWiki