Sciweavers

ALGORITHMICA
2008
131views more  ALGORITHMICA 2008»
13 years 11 months ago
Sorting and Searching in Faulty Memories
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
Irene Finocchi, Giuseppe F. Italiano
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 11 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano