Strong I/O lower bounds for binomial and FFT computation graphs

DOI10.1007/978-3-642-22685-4_12MaRDI QIDQ3087945zbMATH OpenOpenAlexFDO

Authors Desh Ranjan, Mohammad Zubair, John Savage

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)

Recommendations

• Upper and lower I/O bounds for pebbling \(r\)-pyramids
• Upper and lower I/O bounds for pebbling \(r\)-pyramids
• scientific article; zbMATH DE number 4020488
• scientific article; zbMATH DE number 176491
• Algorithms for parallel memory, I: Two-level memories

Cited in

(3)

• Upper and lower I/O bounds for pebbling \(r\)-pyramids
• scientific article; zbMATH DE number 1696521 (Why is no real title available?)
• Upper and lower I/O bounds for pebbling \(r\)-pyramids

This page was built for publication: Strong I/O lower bounds for binomial and FFT computation graphs

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