Cache and I/O efficent functional algorithms

DOI10.1145/2429069.2429077MaRDI QIDQ2931782zbMATH OpenOpenAlexFDO

Authors Guy E. Blelloch, Robert Harber

Publication date 27 November 2014

Published in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2429069.2429077

zbMATH Keywords

cost semanticsI/O efficient algorithms

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1445384
• Towards a theory of cache-efficient algorithms
• scientific article; zbMATH DE number 2011837
• scientific article; zbMATH DE number 176491
• Algorithm Theory - SWAT 2004

Cited in

(5)

• Towards a theory of cache-efficient algorithms
• scientific article; zbMATH DE number 1515868 (Why is no real title available?)
• scientific article; zbMATH DE number 2086622 (Why is no real title available?)
• scientific article; zbMATH DE number 1445384 (Why is no real title available?)
• On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval

This page was built for publication: Cache and I/O efficent functional algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931782)