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 |
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
|
---|---|
Chapter number | 59 |
Book title |
Automata, Languages, and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2013
|
DOI | 10.1007/978-3-642-39206-1_59 |
Book ISBNs |
978-3-64-239205-4, 978-3-64-239206-1
|
Authors |
Nikos Leonardos |
Mendeley readers
The data shown below were compiled from readership statistics for 20 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 5% |
Unknown | 19 | 95% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 30% |
Researcher | 4 | 20% |
Professor > Associate Professor | 3 | 15% |
Student > Master | 3 | 15% |
Professor | 1 | 5% |
Other | 1 | 5% |
Unknown | 2 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 17 | 85% |
Physics and Astronomy | 1 | 5% |
Unknown | 2 | 10% |