Worst-case analysis of the set-union problem with extended backtracking (Q1124334): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/tcs/GambosiIT89, #quickstatements; #temporary_batch_1731461124002
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90119-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976070870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partially persistent data structure for the set-union problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set union problem with dynamic weighted backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Merging Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4721668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Search Trees of Bounded Balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms which require nonlinear time to maintain disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Analysis of Algorithms for Set Union with Backtracking / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/GambosiIT89 / rank
 
Normal rank

Latest revision as of 02:42, 13 November 2024

scientific article
Language Label Description Also known as
English
Worst-case analysis of the set-union problem with extended backtracking
scientific article

    Statements

    Worst-case analysis of the set-union problem with extended backtracking (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    set-union problem
    0 references
    backtracking
    0 references
    data structure
    0 references

    Identifiers