1: Introduction 2: Parallel Disk Model (PDM) 3: Fundamental I/O Operations and Bounds 4: Exploiting Locality and Load Balancing 5: External Sorting and Related Problems 6: Lower Bounds and I/O 7: Matrix and Grid Computations 8: Batched Problems in Computational Geometry 9: Batched Problems on Graphs 10: External Hashing for Online Dictionary Search 11: Multiway Tree Data Structures 12: Spatial Data Structures and Range Search 13: Dynamic and Kinetic Data Structures 14: String Processing 15: Compressed Data Structures 16: Dynamic Memory Allocation 17: External Memory Programming Environments. Conclusions. Notations and Acronyms. References

Fishpond works with suppliers all over the world to bring you a huge selection of products, really great prices, and delivery included on over 25 million products that we sell. We do our best every day to make Fishpond an awesome place for customers to shop and get what they want — all at the best prices online.

About Fishpond

You can earn a 8% commission by selling Algorithms and Data Structures for External Memory (Foundations and Trends (R) in Theoretical Computer Science) on your website. It's easy to get started - we will give you example code. After you're set-up, your website can earn you money while you work, play or even sleep! You should start right now!

Are you the Author or Publisher of a book? Or the manufacturer of one of the millions of products that we sell. You can improve sales and grow your revenue by submitting additional information on this title. The better the information we have about a product, the more we will sell!

Submit Information

Table of Contents