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 |
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups
|
---|---|
Chapter number | 13 |
Book title |
Mathematical Foundations of Computer Science 2012
|
Published in |
Lecture notes in computer science, January 2012
|
DOI | 10.1007/978-3-642-32589-2_13 |
Book ISBNs |
978-3-64-232588-5, 978-3-64-232589-2
|
Authors |
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Editors |
Branislav Rovan, Vladimiro Sassone, Peter Widmayer |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 50% |
Professor > Associate Professor | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 50% |
Computer Science | 1 | 50% |