|
128
|
Generalized FLP impossibility result for t-resilient asynchronous computations
– E Borowsky, E Gafni
- 1993
|
|
95
|
The asynchronous computability theorem for tresilient tasks
– Maurice Herlihy, Nir Shavit
- 1993
|
|
84
|
Wait-free k-set agreement is impossible: The topology of public knowledge
– M E Saks, F Zaharoglou
|
|
80
|
R.: Renaming in an asynchronous environment
– H Attiya, A Bar-Noy, D Dolev, D Peleg, Reischuk
- 1990
|
|
122
|
A Lower Bound for the Time to Assure Interactive Consistency
– Michael J. Fischer, Nancy A. Lynch, Nancy A. Lynch
- 1981
|
|
35
|
Set Consensus Using Arbitrary Objects
– Maurice Herlihy, Sergio Rajsbaum
- 1994
|
|
1300
|
Impossibility of Distributed Consensus with One Faulty Process
– Michael J. Fischer, Nancy A. Lynch, Michael S. Paterson
- 1985
|
|
37
|
A simple constructive computability theorem for wait-free computation
– Maurice Herlihy, Nir Shavit
- 1994
|
|
53
|
Impossibility of distributed commit with one faulty process
– M Fischer, N Lynch, M Paterson
- 1985
|
|
44
|
Agreement is harder than consensus: set consensus in totally asynchronous systems
– S Chaudhuri
- 1990
|
|
660
|
Wait-Free Synchronization
– Maurice Herlihy
- 1993
|
|
381
|
Elements of Algebraic Topology
– J Munkres
- 1984
|
|
616
|
Algebraic Topology
– E H Spanier
- 1966
|
|
85
|
More Choices Allow More Faults: Set Consensus Problems In Totally Asynchronous Systems
– Soma Chaudhuri
- 1992
|
|
450
|
Reaching Agreement in the Presence of Faults
– M. Pease, R. Shostak, L. Lamport
- 1980
|
|
31
|
Algebraic spans
– Maurice Herlihy, Sergio Rajsbaum
- 2000
|
|
24
|
Unifying Synchronous and Asynchronous Message-Passing Models
– Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
- 1998
|
|
32
|
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor
– O Biran, S Moran, S Zaks
- 1988
|
|
17
|
and Fotios Zaharoglou, Wait-free k-set agreement is impossible: The topology of public knowledge
– Michael Saks
|
