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 |
Best possible bounds on the weighted path length of optimum binary search trees
|
---|---|
Chapter number | 4 |
Book title |
Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20–23, 1975
|
Published by |
Springer, Berlin, Heidelberg, January 1975
|
DOI | 10.1007/3-540-07407-4_4 |
Book ISBNs |
978-3-54-007407-6, 978-3-54-037923-2
|
Authors |
Kurt Mehlhorn |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Unknown | 1 | 100% |