Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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 )