暂无分享,去创建一个
Chih-Hung Liu | Stefano Leucci | Paolo Penna | Barbara Geissmann | S. Leucci | P. Penna | Chih-Hung Liu | Barbara Geissmann
[1] Paolo Penna,et al. Sort well with energy-constrained comparisons , 2016, Physical review. E.
[2] Atri Rudra,et al. Ordering by weighted number of wins gives a good ranking for weighted tournaments , 2006, SODA '06.
[3] Richard M. Karp,et al. Noisy binary search and its applications , 2007, SODA '07.
[4] Harald Niederreiter,et al. Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..
[5] Ferdinando Cicalese. Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information , 2013 .
[6] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[7] K. B. Lakshmanan,et al. Recursive merge sort with erroneous comparisons , 2011, Discret. Appl. Math..
[8] Svante Janson,et al. Quicksort with Unreliable Comparisons: A Probabilistic Analysis , 2004, Comb. Probab. Comput..
[9] Andrzej Pelc,et al. Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..
[10] Barbara Geissmann,et al. Sorting by swaps with noisy comparisons , 2017, GECCO.
[11] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[12] David P. Woodruff,et al. Tolerant Algorithms , 2011, ESA.
[13] Peter Damaschke. The Solution Space of Sorting with Recurring Comparison Faults , 2017, Theory of Computing Systems.
[14] Mark Braverman,et al. Noisy sorting without resampling , 2007, SODA '08.
[15] R. Graham,et al. Spearman's Footrule as a Measure of Disarray , 1977 .