Irene Finocchi, Giuseppe F. Italiano  Home/Search
Context
Related
| gauguin.info.uniroma2.it...stoc04.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: gauguin.info.uniro...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 a correct output on the set of uncorrupted values. In this framework, we consider two fundamental problems: sorting and searching. In particular, we prove that any O(n log n) comparison-based sorting algorithm can tolerate at most O((n log n) ) memory faults. Furthermore, we present one comparison-based sorting... (Update)
Similar documents (at the sentence level):
5.5%: Sorting and Searching in the Presence of Memory Faults.. - Finocchi, Italiano (Correct)
Active bibliography (related documents): More All
0.6: Deterministic Computations on a PRAM with Static Faults - Chlebus, Gasieniec, Pelc (Correct)
0.5: Searching with a Constant Rate of Malicious Lies - Pedrotti (Correct)
0.5: Breaking the Θ(n log² n) Barrier for Sorting.. - Leighton, Ma, Plaxton (1997) (Correct)
BibTeX entry: (Update)
@misc{ finocchi-sorting,
author = "Irene Finocchi and Giuseppe F. Italiano",
title = "Sorting and Searching in the Presence of Memory Faults (without Redundancy)",
url = "citeseer.ist.psu.edu/709328.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
375 LEDA: A platform for combinatorial and geometric computing - Mehlhorn, Naher - 1999
156 reliable secondary storage (context) - Chen, Lee et al. - 1994
32 Coping with errors in binary search procedures (context) - Kleitman, Meyer et al. - 1980
30 Standard Template Library - Plauger, Stepanov et al. - 2000
24 Testing semiconductor memories: Theory and practice (context) - Goor - 1998
19 Searching with known error probability (context) - Pelc - 1989
17 Adventures of a mathematician (context) - Ulam - 1977
17 Searching in the presence of linearly bounded errors (context) - Aslam, Dhagat - 1991
17 PRAM computations resilient to memory faults - Chlebus, Gambin et al. - 1994
16 Fault-tolerant sorting network (context) - Assaf, Upfal - 1990
14 Computing with noisy information (context) - Feige, Raghavan et al. - 1994
13 Fast deterministic simulation of computations on faulty para.. - Chlebus, Gasieniec et al. - 1995
10 Fault-tolerant data structures - Aumann, Bender - 1996
9 On optimal strategies for searching in the presence of error.. (context) - Muthukrishnan - 1996
8 Best sorting algorithms for nearly sorted lists (context) - Cook, Kim - 1980
8 twenty questions (context) - Dhagat, Gacs et al. - 1992
8 Comparison based search in the presence of errors (context) - Borgstrom, Kosaraju - 1993
6 A diary on information theory (context) - Renyi - 1994
5 Tight bounds on the size of fault-tolerant merging and sorti.. (context) - Leighton, Ma - 1999
5 On word-level parallelism in fault-tolerant computing (context) - Indyk - 1996
5 On fault-tolerant networks for sorting (context) - Yao, Yao - 1985
4 barrier for sorting with faults (context) - Leighton, Ma et al. - 1997
4 Coping with erroneous information while sorting (context) - Lakshmanan, Ravikumar et al. - 1991
3 Personal communication (context) - Farach-Colton - 2002
3 Shared-memory simulations on a faulty-memory DMM - Chlebus, Gambin et al. - 1996
3 Searching games with errors: Fifty years of coping with liar.. (context) - Pelc - 2002
2 Dynamic faults in Random-Access-Memories: Concept (context) - Hamdioui, Al-Ars et al. - 2003
2 A fault-tolerant merge sorting algorithm (context) - Ravikumar - 2002
Documents on the same site (http://gauguin.info.uniroma2.it/~finocchi/publications.html): More
Combinatorial Algorithms for Feedback Problems in Directed.. - Demetrescu, Finocchi (Correct)
On Max Cut in Cubic Graphs - Calamoneri, Finocchi, Petreschi.. (Correct)
A Portable Virtual Machine for Program Debugging and Directing - Demetrescu, Finocchi (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC