On the cost of recomputing: tight bounds on pebbling with faults

DOI10.1007/3-540-58201-0_57zbMath1418.68100OpenAlexW2123401477MaRDI QIDQ4632415

Yonatan Aumann, Judit Bar-Ilan

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_57

zbMATH Keywords

binary treetight boundcheck pointmemory unitinput node

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• An observation on time-storage trade off
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Asymptotically tight bounds on time-space trade-offs in a pebble game
• Complete Register Allocation Problems
• On Time Versus Space
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the cost of recomputing: tight bounds on pebbling with faults