Upper and lower I/O bounds for pebbling r-pyramids

DOI10.1007/978-3-642-19222-7_12zbMATH Open1326.68211OpenAlexW2177249600MaRDI QIDQ3000499FDOQ3000499

Authors: Desh Ranjan, Mohammad Zubair, John Savage 

Publication date: 19 May 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-19222-7_12

Recommendations

• Upper and lower I/O bounds for pebbling \(r\)-pyramids
• Strong I/O lower bounds for binomial and FFT computation graphs
• A tight bound for black and white pebbles on the pyramid
• scientific article; zbMATH DE number 3940742
• scientific article; zbMATH DE number 1305462

zbMATH Keywords

lower boundsmemory hierarchyI/O

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57) Financial applications of other theories (91G80)

Cites Work

• Option pricing: A simplified approach
• An observation on time-storage trade off
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cache-optimal algorithms for option pricing
• Title not available (Why is that?)

Cited In (3)

• Upper and lower I/O bounds for pebbling \(r\)-pyramids
• Strong I/O lower bounds for binomial and FFT computation graphs
• The red-blue pebble game on trees and DAGs with large input

This page was built for publication: Upper and lower I/O bounds for pebbling \(r\)-pyramids

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