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 |
A Fast Random Sampling Algorithm for Sparsifying Matrices
|
---|---|
Chapter number | 26 |
Book title |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
|
Published by |
Springer, Berlin, Heidelberg, January 2006
|
DOI | 10.1007/11830924_26 |
Book ISBNs |
978-3-54-038044-3, 978-3-54-038045-0
|
Authors |
Sanjeev Arora, Elad Hazan, Satyen Kale, Arora, Sanjeev, Hazan, Elad, Kale, Satyen |
Mendeley readers
The data shown below were compiled from readership statistics for 43 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Germany | 1 | 2% |
Switzerland | 1 | 2% |
Israel | 1 | 2% |
Canada | 1 | 2% |
Greece | 1 | 2% |
Unknown | 38 | 88% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 11 | 26% |
Researcher | 11 | 26% |
Student > Bachelor | 5 | 12% |
Professor | 4 | 9% |
Student > Doctoral Student | 3 | 7% |
Other | 7 | 16% |
Unknown | 2 | 5% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 24 | 56% |
Engineering | 6 | 14% |
Mathematics | 4 | 9% |
Physics and Astronomy | 3 | 7% |
Business, Management and Accounting | 3 | 7% |
Other | 0 | 0% |
Unknown | 3 | 7% |