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 |
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs
|
---|---|
Chapter number | 12 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, August 2011
|
DOI | 10.1007/978-3-642-22685-4_12 |
Book ISBNs |
978-3-64-222684-7, 978-3-64-222685-4
|
Authors |
Desh Ranjan, John Savage, Mohammad Zubair, Ranjan, Desh, Savage, John, Zubair, Mohammad |
Mendeley readers
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 14% |
Italy | 1 | 14% |
Unknown | 5 | 71% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 43% |
Unspecified | 1 | 14% |
Professor > Associate Professor | 1 | 14% |
Researcher | 1 | 14% |
Student > Postgraduate | 1 | 14% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 71% |
Unspecified | 1 | 14% |
Engineering | 1 | 14% |