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 Cartesian Trees and Range Minimum Queries
|
---|---|
Chapter number | 29 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer Berlin Heidelberg, July 2009
|
DOI | 10.1007/978-3-642-02927-1_29 |
Book ISBNs |
978-3-64-202926-4, 978-3-64-202927-1
|
Authors |
Erik D. Demaine, Gad M. Landau, Oren Weimann, Demaine, Erik D., Landau, Gad M., Weimann, Oren |
Mendeley readers
The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 17 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 6 | 35% |
Student > Master | 4 | 24% |
Researcher | 2 | 12% |
Professor | 1 | 6% |
Lecturer | 1 | 6% |
Other | 1 | 6% |
Unknown | 2 | 12% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 14 | 82% |
Physics and Astronomy | 1 | 6% |
Unknown | 2 | 12% |