Public data structures: counters as a special case.

DOI10.1016/S0304-3975(01)00312-7MaRDI QIDQ1853535zbMATH OpenFDO

Authors Hagit Brit, Shlomo Moran, Gadi Taubenfeld

Publication date 21 January 2003

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Publication:4942030
• Linearizable counting networks
• Concurrent counting (extended abstract)
• Concurrent counting
• Polylogarithmic concurrent data structures from monotone circuits

Cites work

• scientific article; zbMATH DE number 742955 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A Lower Bound on Wait-Free Counting
• A combinatorial treatment of balancing networks
• An efficient counting network
• Coins, weights and contention in balancing networks
• Concurrency of operations on B-trees
• Concurrent Search and Insertion in AVL Trees
• Concurrent counting
• Concurrent search and insertion in 2-3 trees
• Counting networks
• Counting networks are practically linearizable
• Efficient locking for concurrent operations on B-trees
• Linearizable counting networks
• Sequentially consistent versus linearizable counting networks
• Specifying Concurrent Program Modules
• Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)

Cited in

(3)

• Computing with infinitely many processes
• Sequentially consistent versus linearizable counting networks
• scientific article; zbMATH DE number 1418469 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853535)