Upper and Lower I/O Bounds for Pebbling r-Pyramids

DOI10.1007/978-3-642-19222-7_12zbMath1326.68211OpenAlexW2177249600MaRDI QIDQ3000499

Desh Ranjan, Mohammad Zubair, John E. 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

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) Financial applications of other theories (91G80) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

The red-blue pebble game on trees and DAGs with large input

Cites Work

• An observation on time-storage trade off
• Cache-optimal algorithms for option pricing
• Option pricing: A simplified approach
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper and Lower I/O Bounds for Pebbling r-Pyramids