Coping with Erroneous Information while Sorting

The authors study the problem of sorting n distinct elements in ascending sequence according to a total order, using comparison queries which receive 'yes' or 'no' answers, but of which as many as e may be erroneous. In a half-lie version, all 'yes' answers are guaranteed to be correct and the errors are confined to 'no' answers. It is shown that the comparison query complexity of the sorting problem for this case is Omega (n log n+e), and an asymptotically optimal algorithm is demonstrated. In a full-lie version, both 'yes' and 'no' answers can be false. It is shown that the comparison query complexity of the sorting problem for this case is Omega (n log n+en). >

[1]  J. Spencer.  Guess a number - with lying , 1984 .

[2]  S. Ulam,et al.  Adventures of a Mathematician , 2019, Mathematics: People · Problems · Results.

[3]  Andrzej Pelc,et al.  Solution of Ulam's problem on searching with a lie , 1987, J. Comb. Theory, Ser. A.

[4]  Joel H. Spencer,et al.  Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..

[5]  Bala Ravikumar,et al.  Coping with Known Patterns of Lies in a Search Game , 1984, Theor. Comput. Sci..

[6]  Andrew Chi-Chih Yao,et al.  On Fault-Tolerant Networks for Sorting , 1985, SIAM J. Comput..

[7]  Andrew Chi-Chih Yao,et al.  On the Expected Performance of Path Compression Algorithms , 1985, SIAM J. Comput..

[8]  Bala Ravikumar,et al.  On Selecting the Largest Element in Spite of Erroneous Information , 1987, STACS.