Efficient adaptive collect using randomization
type: Item
instance of: scholarly article
title: Efficient adaptive collect using randomization
zbMATH Open document ID: 1264.68212
author: Hagit Attiya
author: Fabian Kuhn
author: Mirjam Wattenhofer
author: C. Greg Plaxton
published in: Distributed Computing
publication date: 2013-06-07T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6172098
zbMATH Keywords: adaptive algorithms
zbMATH Keywords: total contention
zbMATH Keywords: randomization
MaRDI profile type: Publication
full work available at URL: s00446-005-0143-6
OpenAlex ID: W2052556176
cites work: Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
cites work: Adaptive and efficient mutual exclusion (extended abstract)
cites work: Algorithms adapting to point contention
cites work: Efficient Adaptive Collect Using Randomization
cites work: Indulgent algorithms (preliminary version)
cites work: Randomized wait-free concurrent objects (extended abstract)
cites work: Time and Space Lower Bounds for Nonblocking Implementations
cites work: Q4436036
cites work: Wait-free algorithms for fast, long-lived renaming
cites work: Q4856179
DOI: 10.1007/S00446-005-0143-6
description: scientific article; zbMATH DE number 6172098