The amortized complexity of non-blocking binary search trees

DOI10.1145/2611462.2611486zbMath1321.68307OpenAlexW2072721374MaRDI QIDQ2943634

Joanna Helga, Faith Ellen, Eric Ruppert, Panagiota Fatourou

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2611462.2611486

zbMATH Keywords

binary search treeasynchronousnon-blockingconcurrentlock-freeamortized analysiscompare-and-swap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (5)

Unnamed Item ⋮ A Wait-free Queue with Polylogarithmic Step Complexity ⋮ The amortized analysis of a non-blocking chromatic tree ⋮ TSLQueue: An Efficient Lock-Free Design for Priority Queues ⋮ Unnamed Item

This page was built for publication: The amortized complexity of non-blocking binary search trees