Strong I/O Lower Bounds for Binomial and FFT Computation Graphs

DOI10.1007/978-3-642-22685-4_12zbMATH Open1353.68294OpenAlexW174771588MaRDI QIDQ3087945

Mohammad Zubair, D. Ranjan, J. E. 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

Could not fetch data.

Related Items (1)

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)