Automata, Languages and Programming
Springer Science & Business Media
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.
Timeline
Mendeley readers
| Chapter title |
Improved Lower Bounds on the Randomized Complexity of Graph Properties
|
|---|---|
| Chapter number | 24 |
| Book title |
Automata, Languages and Programming
|
| Published by |
Springer, Berlin, Heidelberg, July 2001
|
| DOI | 10.1007/3-540-48224-5_24 |
| Book ISBNs |
978-3-54-042287-7, 978-3-54-048224-6
|
| Authors |
Amit Chakrabarti, Subhash Khot, Chakrabarti, Amit, Khot, Subhash |
Mendeley readers
The data shown below were compiled from readership statistics for 14 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 14 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 5 | 36% |
| Researcher | 3 | 21% |
| Student > Master | 2 | 14% |
| Lecturer | 1 | 7% |
| Professor > Associate Professor | 1 | 7% |
| Other | 0 | 0% |
| Unknown | 2 | 14% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 11 | 79% |
| Physics and Astronomy | 1 | 7% |
| Unknown | 2 | 14% |