On the cost of recomputing: tight bounds on pebbling with faults (Q4632415)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the cost of recomputing: tight bounds on pebbling with faults |
scientific article; zbMATH DE number 7048663
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the cost of recomputing: tight bounds on pebbling with faults |
scientific article; zbMATH DE number 7048663 |
Statements
On the cost of recomputing: tight bounds on pebbling with faults (English)
0 references
29 April 2019
0 references
binary tree
0 references
input node
0 references
check point
0 references
tight bound
0 references
memory unit
0 references
