Browsing Faculty of Graduate Studies Online Theses by Subject "amortized complexity"
Now showing items 1-1 of 1
-
Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees
(2016-05-04)We present a provably linearizable and lock-free relaxed AVL tree called the non- blocking ravl tree. At any time, the height of a non-blocking ravl tree is bounded by logφ(2m) + c, where φ is the golden ratio, m is the ...