scientific article; zbMATH DE number 7561436

DOI10.4230/LIPIcs.OPODIS.2018.8MaRDI QIDQ5091079

Jeremy Ko

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

non-blockinglock-freeamortized analysisbalanced binary search trees

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Amortization results for chromatic search trees, with an application to priority queues
• Chromatic binary search trees: A structure for concurrent rebalancing
• Efficient lock-free binary search trees
• The amortized complexity of non-blocking binary search trees
• Pragmatic primitives for non-blocking data structures
• A Template for Implementing Fast Lock-free Trees Using HTM

This page was built for publication: