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 |
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms
|
---|---|
Chapter number | 21 |
Book title |
SOFSEM 2014: Theory and Practice of Computer Science
|
Published by |
Springer, Cham, January 2014
|
DOI | 10.1007/978-3-319-04298-5_21 |
Book ISBNs |
978-3-31-904297-8, 978-3-31-904298-5
|
Authors |
Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari, Fontaine, Allyx, Métivier, Yves, Robson, John Michael, Zemmari, Akka |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 3 | 75% |
Professor > Associate Professor | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 75% |
Unknown | 1 | 25% |