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 |
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
|
---|---|
Chapter number | 48 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, November 2002
|
DOI | 10.1007/3-540-36136-7_48 |
Book ISBNs |
978-3-54-000142-3, 978-3-54-036136-7
|
Authors |
Vivek Shikaripura, Ajay D. Kshemkalyani |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Unspecified | 1 | 33% |
Professor | 1 | 33% |
Professor > Associate Professor | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Unspecified | 1 | 33% |
Computer Science | 1 | 33% |
Unknown | 1 | 33% |