Sciweavers

STOC
2004
ACM
129views Algorithms» more  STOC 2004»
15 years 22 days 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