On the cost of recomputing: Tight bounds on pebbling with faults
type: Item
instance of: scholarly article
title: On the cost of recomputing: Tight bounds on pebbling with faults
zbMATH Open document ID: 0952.68011
DOI: 10.1016/S0304-3975(98)00085-1
author: Yonatan Aumann
author: Judit Bar-Ilan
author: Uriel Feige
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1495230
zbMATH Keywords: time complexity
zbMATH Keywords: space complexity
zbMATH Keywords: faulty memory
MaRDI profile type: Publication
cites work: An observation on time-storage trade off
cites work: Q4185781
cites work: On Time Versus Space
cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game
cites work: Q5844986
cites work: Efficient dispersal of information for security, load balancing, and fault tolerance
cites work: Q4206385
cites work: Complete Register Allocation Problems
description: scientific article; zbMATH DE number 1495230