Towards a theory of cache-efficient algorithms

doi:10.1145/602220.602225

Towards a theory of cache-efficient algorithms

Full Text:

PDF

Buy this Article

Authors:	Sandeep Sen	Indian Institute of Technology Delhi, New Delhi, India
	Siddhartha Chatterjee	IBM Research, Yorktown Heights, New York
	Neeraj Dumir	Indian Institute of Technology Delhi, New Delhi, India

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 49 Issue 6, November 2002
Pages 828-858
ACM New York, NY, USA
table of contents doi>10.1145/602220.602225

	2002 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 42 · Downloads (cumulative): 1,381 · Citation Count: 14

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms experimentation general hierarchical memory i/o complexity lower bound models of computation performance analysis and design aids theory verification

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder