Effective splaying with restricted rotations (Q3506250): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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.1080/00207160701435219 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059003106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed balance using standard rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rotations in fringe-balanced binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Binary Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Search Trees of Bounded Balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating, Ranking and Unranking Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short notes: Some Properties of the Rotation Lattice of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the deque conjecture for the splay algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right-arm rotation distance between binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for estimating rotation distance between two binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted rotation distance between binary trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding restricted rotation distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct algorithm for restricted rotation distance / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:54, 28 June 2024

scientific article
Language Label Description Also known as
English
Effective splaying with restricted rotations
scientific article

    Statements

    Effective splaying with restricted rotations (English)
    0 references
    0 references
    12 June 2008
    0 references
    0 references
    splay tree
    0 references
    binary tree
    0 references
    restricted rotations
    0 references
    data structures
    0 references
    0 references