A data structure for dynamic trees (Q1838310): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/jcss/SleatorT83, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 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/0022-0000(83)90006-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018804864 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56018634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming as a Discipline of Mathematical Nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(EV\log^2V)\) algorithm for the maximal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for Storing Ancestor Information in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / 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: Applications of Path Compression on Balanced Trees / 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: Q3707420 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/SleatorT83 / rank
 
Normal rank

Latest revision as of 15:04, 13 November 2024

scientific article
Language Label Description Also known as
English
A data structure for dynamic trees
scientific article

    Statements

    Identifiers