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 the Complexity of Searching in Trees: Average-Case Minimization
|
---|---|
Chapter number | 45 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2010
|
DOI | 10.1007/978-3-642-14165-2_45 |
Book ISBNs |
978-3-64-214164-5, 978-3-64-214165-2
|
Authors |
Tobias Jacobs, Ferdinando Cicalese, Eduardo Laber, Marco Molinaro, Jacobs, Tobias, Cicalese, Ferdinando, Laber, Eduardo, Molinaro, Marco |
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 % |
---|---|---|
Unknown | 20 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 5 | 25% |
Student > Ph. D. Student | 5 | 25% |
Researcher | 3 | 15% |
Lecturer | 1 | 5% |
Other | 1 | 5% |
Other | 2 | 10% |
Unknown | 3 | 15% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 16 | 80% |
Physics and Astronomy | 1 | 5% |
Unknown | 3 | 15% |