↓ Skip to main content

Algorithms for Memory Hierarchies

Overview of attention for book
Attention for Chapter 5: I/O-Efficient Algorithms for Sparse Graphs
Altmetric Badge

Readers on

mendeley
3 Mendeley
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.
Chapter title
I/O-Efficient Algorithms for Sparse Graphs
Chapter number 5
Book title
Algorithms for Memory Hierarchies
Published by
Springer, Berlin, Heidelberg, January 2003
DOI 10.1007/3-540-36574-5_5
Book ISBNs
978-3-54-000883-5, 978-3-54-036574-7
Authors

Laura Toma, Norbert Zeh

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 67%
Student > Master 1 33%
Readers by discipline Count As %
Computer Science 3 100%