Robustness versus Performance in Sorting and Tournament Algorithms
暂无分享,去创建一个
[1] Richard Box,et al. A fast, easy sort , 1991 .
[2] S. Ulam,et al. Adventures of a Mathematician , 2019, Mathematics: People · Problems · Results.
[3] Philip M. Long. SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE , 1992 .
[4] A. Bagchi. On Sorting in the Presence of Erroneous Information , 1992, Inf. Process. Lett..
[5] Wilfried Elmenreich,et al. Evolutionary Methods in Self-organizing System Design , 2009, GEM.
[6] Václav Mikoláek. Dependability and Robustness: State of the Art and Challenges , 2009 .
[7] Hermann Kopetz,et al. On the Fault Hypothesis for a Safety-Critical Real-Time System , 2004, ASWSD.
[8] Joachim Giesen,et al. Approximate Sorting , 2006, Fundam. Informaticae.
[9] Jean Arlat,et al. Definition and analysis of hardware- and software-fault-tolerant architectures , 1990, Computer.
[10] R. Graham,et al. Spearman's Footrule as a Measure of Disarray , 1977 .
[11] Peter P. Puschner. Real-Time Performance of Sorting Algorithms , 2004, Real-Time Systems.
[12] Bala Ravikumar,et al. Coping with Erroneous Information while Sorting , 1991, IEEE Trans. Computers.
[13] LaprieJean-Claude,et al. Definition and Analysis of Hardware- and Software-Fault-Tolerant Architectures , 1990 .
[14] Vaclav Mikolasek. Dependability and Robustness: State of the Art and Challenges , 2009, 2009 Software Technologies for Future Dependable Distributed Systems.
[15] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .
[16] Bala Ravikumar,et al. On Selecting the Largest Element in Spite of Erroneous Information , 1987, STACS.
[17] Andrzej Pelc,et al. Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..
[18] A. Avizienis,et al. Fault-tolerance: The survival attribute of digital systems , 1978, Proceedings of the IEEE.