You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Obstruction-Free Algorithms Can Be Practically Wait-Free
|
---|---|
Chapter number | 8 |
Book title |
Distributed Computing
|
Published by |
Springer, Berlin, Heidelberg, September 2005
|
DOI | 10.1007/11561927_8 |
Book ISBNs |
978-3-54-029163-3, 978-3-54-032075-3
|
Authors |
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit, Fich, Faith Ellen, Luchangco, Victor, Moir, Mark, Shavit, Nir |
Mendeley readers
The data shown below were compiled from readership statistics for 16 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Canada | 1 | 6% |
Unknown | 15 | 94% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 4 | 25% |
Student > Ph. D. Student | 4 | 25% |
Professor > Associate Professor | 2 | 13% |
Student > Doctoral Student | 2 | 13% |
Researcher | 2 | 13% |
Other | 2 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 15 | 94% |
Engineering | 1 | 6% |