Sciweavers

2 search results - page 1 / 1
» On the Cost of Recomputing: Tight Bounds on Pebbling with Fa...
Sort
View
ICALP
1994
Springer
15 years 3 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
99
Voted
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 11 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr