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

DOI10.1016/S0304-3975(98)00085-1zbMath0952.68011MaRDI QIDQ1575959

Yonatan Aumann, Judit Bar-Ilan

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

time complexityspace complexityfaulty memory

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

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