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 |
Combining Binary Search Trees
|
---|---|
Chapter number | 33 |
Book title |
Automata, Languages, and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2013
|
DOI | 10.1007/978-3-642-39206-1_33 |
Book ISBNs |
978-3-64-239205-4, 978-3-64-239206-1
|
Authors |
Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan |
Mendeley readers
The data shown below were compiled from readership statistics for 30 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 3% |
Germany | 1 | 3% |
Unknown | 28 | 93% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 10 | 33% |
Student > Master | 4 | 13% |
Professor > Associate Professor | 3 | 10% |
Researcher | 2 | 7% |
Student > Doctoral Student | 1 | 3% |
Other | 5 | 17% |
Unknown | 5 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 21 | 70% |
Psychology | 1 | 3% |
Physics and Astronomy | 1 | 3% |
Unknown | 7 | 23% |