By Topic

Coping with erroneous information while sorting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lakshmanan, K.B. ; Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada ; Ravikumar, B. ; Ganesan, K.

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 Ω(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 Ω(n log n+en)

Published in:

Computers, IEEE Transactions on  (Volume:40 ,  Issue: 9 )