Public data structures: counters as a special case.

DOI10.1016/S0304-3975(01)00312-7zbMath1061.68034MaRDI QIDQ1853535

Shlomo Moran, Hagit Brit, Gadi Taubenfeld

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Computing with infinitely many processes ⋮ Sequentially consistent versus linearizable counting networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent search and insertion in 2-3 trees
• An efficient counting network
• Concurrency of operations on B-trees
• Concurrent counting
• Counting networks are practically linearizable
• Specifying Concurrent Program Modules
• Concurrent Search and Insertion in AVL Trees
• Efficient locking for concurrent operations on B-trees
• Counting networks
• A Lower Bound on Wait-Free Counting
• Linearizable counting networks
• Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
• Coins, weights and contention in balancing networks
• A combinatorial treatment of balancing networks
• Sequentially consistent versus linearizable counting networks

This page was built for publication: Public data structures: counters as a special case.