Paper Info
Title
Exotic Behaviour of Consensus Numbers
Abstract
Let the consensus number of a given set S\mathcal{S} of shared objects, denoted CN(S)\mathcal{C}\mathcal{N}(\mathcal{S}), be the maximum number n such that there is a wait-free consensus protocol for n distinct processes, which communicate only by accessing objects in S\mathcal{S}.
Year
DOI
Venue
1994
10.1007/BFb0020427
WDAG
Keywords
Field
DocType
consensus numbers,exotic behaviour
Combinatorics,Physics
Conference
ISBN
Citations 
PageRank 
3-540-58449-8
3
0.39
References 
Authors
8
2
Name
Order
Citations
PageRank
Robert Cori123041.46
Shlomo Moran21786409.73