Public data structures: counters as a special case.
type: Item
instance of: scholarly article
title: Public data structures: counters as a special case.
zbMATH Open document ID: 1061.68034
DOI: 10.1016/S0304-3975(01)00312-7
author: Hagit Brit
author: Shlomo Moran
author: Gadi Taubenfeld
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1857070
MaRDI profile type: Publication
cites work: Q4763397
cites work: Coins, weights and contention in balancing networks
cites work: Counting networks
cites work: Concurrency of operations on B-trees
cites work: Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
cites work: A combinatorial treatment of balancing networks
cites work: An efficient counting network
cites work: Concurrent search and insertion in 2-3 trees
cites work: Concurrent Search and Insertion in AVL Trees
cites work: Linearizable counting networks
cites work: Q5592246
cites work: Q5585020
cites work: Specifying Concurrent Program Modules
cites work: Efficient locking for concurrent operations on B-trees
cites work: Counting networks are practically linearizable
cites work: Sequentially consistent versus linearizable counting networks
cites work: A Lower Bound on Wait-Free Counting
cites work: Concurrent counting
description: scientific article; zbMATH DE number 1857070