Coping with erroneous information while sorting
Authors:
- K.B. LakshmananKLK.B. Lakshmanan
- B. RavikumarBRB. Ravikumar
- K. GanesanKGK. Ganesan
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (9) , 1081-1084
Abstract
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).Keywords
This publication has 6 references indexed in Scilit:
- Solution of Ulam's problem on searching with a lieJournal of Combinatorial Theory, Series A, 1987
- On Fault-Tolerant Networks for SortingSIAM Journal on Computing, 1985
- Coping with known patterns of lies in a search gameTheoretical Computer Science, 1984
- Guess a Number-with LyingMathematics Magazine, 1984
- Coping with errors in binary search proceduresJournal of Computer and System Sciences, 1980
- Adventures of a MathematicianPhysics Today, 1976