scientific article

DOI10.4230/LIPICS.OPODIS.2017.16zbMath1487.68028MaRDI QIDQ3300815

Arie Fouren, Hagit Attiya

Publication date: 30 July 2020

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

zbMATH Keywords

treesremote memory referencesstep complexitymonotone objectsstacks: queues

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Distributed systems (68M14)

Related Items (1)

A Wait-free Queue with Polylogarithmic Step Complexity

Cites Work

• A time complexity lower bound for adaptive mutual exclusion
• Concurrency of operations on B-trees
• The amortized complexity of non-blocking binary search trees
• Shared-memory mutual exclusion: major research trends since 1986
• Lock-free linked lists using compare-and-swap
• Unnamed Item
• Unnamed Item

This page was built for publication: