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 |
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
|
---|---|
Chapter number | 71 |
Book title |
LATIN 2006: Theoretical Informatics
|
Published by |
Springer, Berlin, Heidelberg, March 2006
|
DOI | 10.1007/11682462_71 |
Book ISBNs |
978-3-54-032755-4, 978-3-54-032756-1
|
Authors |
Daniel Sawitzki, Sawitzki, Daniel |
Mendeley readers
The data shown below were compiled from readership statistics for 22 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 22 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 7 | 32% |
Student > Master | 4 | 18% |
Researcher | 3 | 14% |
Professor | 2 | 9% |
Lecturer | 2 | 9% |
Other | 2 | 9% |
Unknown | 2 | 9% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 17 | 77% |
Mathematics | 1 | 5% |
Agricultural and Biological Sciences | 1 | 5% |
Physics and Astronomy | 1 | 5% |
Unknown | 2 | 9% |