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 |
Optimal Quantum Adversary Lower Bounds for Ordered Search
|
---|---|
Chapter number | 71 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2008
|
DOI | 10.1007/978-3-540-70575-8_71 |
Book ISBNs |
978-3-54-070574-1, 978-3-54-070575-8
|
Authors |
Andrew M. Childs, Troy Lee |
Mendeley readers
The data shown below were compiled from readership statistics for 31 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 31 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 8 | 26% |
Student > Master | 6 | 19% |
Researcher | 6 | 19% |
Professor | 3 | 10% |
Professor > Associate Professor | 3 | 10% |
Other | 2 | 6% |
Unknown | 3 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 24 | 77% |
Physics and Astronomy | 3 | 10% |
Mathematics | 1 | 3% |
Unknown | 3 | 10% |