Approximate Minimum Selection with Unreliable Comparisons
暂无分享,去创建一个
[1] Frank Thomson Leighton,et al. Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults , 1999, SIAM J. Comput..
[2] Tom Edgar. Staircase Series , 2018 .
[3] S. Rao Kosaraju,et al. Comparison-based search in the presence of errors , 1993, STOC.
[4] A. Bagchi. On Sorting in the Presence of Erroneous Information , 1992, Inf. Process. Lett..
[5] Chih-Hung Liu,et al. Optimal Dislocation with Persistent Errors in Subquadratic Time , 2019, Theory of Computing Systems.
[6] Matús Mihalák,et al. Recurring Comparison Faults: Sorting and Finding the Minimum , 2015, FCT.
[7] David P. Woodruff,et al. Tolerant Algorithms , 2011, ESA.
[8] Andrzej PELC,et al. Searching with Known Error Probability , 1989, Theor. Comput. Sci..
[9] Gary Anthes. Inexact design: beyond fault-tolerance , 2013, CACM.
[10] Claire Mathieu,et al. Electronic Colloquium on Computational Complexity, Report No. 144 (2006) How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments , 2006 .
[11] Aravindan Vijayaraghavan,et al. Sorting noisy data with partial information , 2013, ITCS '13.
[12] Fabrizio Grandoni,et al. Optimal resilient sorting and searching in the presence of memory faults , 2006 .
[13] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[14] Martin Aigner. Finding the Maximum and Minimum , 1997, Discret. Appl. Math..
[15] Lingamneni Avinash,et al. Ten Years of Building Broken Chips: The Physics and Engineering of Inexact Computing , 2013, TECS.
[16] S. Matthew Weinberg,et al. Parallel algorithms for select and partition with noisy comparisons , 2016, STOC.
[17] Bala Ravikumar,et al. Coping with Erroneous Information while Sorting , 1991, IEEE Trans. Computers.
[18] Ferdinando Cicalese,et al. Fault-Tolerant Search Algorithms , 2013, Monographs in Theoretical Computer Science. An EATCS Series.
[19] R.C. Baumann,et al. Radiation-induced soft errors in advanced semiconductor technologies , 2005, IEEE Transactions on Device and Materials Reliability.
[20] Andrzej Pelc,et al. Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..
[21] Xi Chen,et al. Competitive analysis of the top-K ranking problem , 2016, SODA.
[22] Joel H. Spencer,et al. Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..