Optimal resilient sorting and searching in the presence of memory faults

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 286-298

  Finocchi, Irene ^a   Grandoni, Fabrizio ^a   Italiano, Giuseppe F ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMAL SYSTEMS;

OPTIMAL DETERMINISTIC SEARCHING ALGORITHM; OPTIMAL RESILIENT SORTING; RANDOMIZED SEARCHING ALGORITHM; RUNNING TIME;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33746371721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_26     Document Type: Conference Paper

References (12)

1. S. Assaf and E. Upfal. Fault-tolerant sorting networks. SIAM J. Discrete. Math., 4(4), 472-480, 1991.
2. Y. Aumann and M. A. Bender. Fault-tolerant data structures. Proc. 37th IEEE Symp. on Foundations of Computer Science, 580-589, 1996.
3. R. S. Borgstrom and S. Rao Kosaraju. Comparison based search in the presence of errors. Proc. 25th ACM Symp. on Theory of Computing, 130-136, 1993.
4. R. Boyer arid S. Moore. MJRTY - A fast majority vote algorithm. University of Texas Tech. Report, 1982,
5. B. S. Chlebus, L. Gasieniec and A. Pelc. Deterministic computations on a PRAM with static processor and memory faults, Fund. Informaticae, 55, 285-306, 2003.
6. U. Feige, P. Raghavan, D. Peleg, and E. Upfal. Computing with noisy information. SIAM Journal on Computing, 23, 1001-1018, 1994.
7. I. Finocchi and G. F. Italiano, Sorting and searching in the presence of memory faults (without redundancy). Proc. 36th ACM Symp. on Theory of Computing, 101-110, 2004,
8. S. Hamdioui, Z. Al-Ars, J. Van de Goor, and M. Rodgers, Dynamic faults in Random-Access-Memories: Concept, faults models and tests. Journal of Electronic Testing: Theory and Applications, 19, 195-205, 2003.
9. M. Henzinger. The past, present and future of Web Search Engines. Invited talk. 31st Int. Coll. Automata, Languages and Programming, 12-16 2004.
10. T. Leighton and Y. Ma. Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults. SIAM Journal on Computing, 29(1):258-273, 1999.
11. A. Pelc. Searching games with errors: Fifty years of coping with liars. Theoretical Computer Science, 270, 71-109, 2002.
12. S. Skorobogatov and R. Anderson. Optical fault induction attacks. Proc. 4th Int. Workshop on Cryptographic Hardware and Embedded Systems, 2-12, 2002.