Sorting and Selection in Rounds with Adversarial Comparisons

We continue the study of selection and sorting of \(n\) numbers under the adversarial comparator model, where comparisons can be adversarially tampered with if the arguments are sufficiently close. We derive a randomized sorting algorithm that does \(O(n \log^2 n)\) comparisons and gives a correct a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-10
1. Verfasser:	Trevisan, Christopher
Format:	Artikel
Sprache:	eng
Schlagworte:	Accuracy Algorithms Lower bounds Sorting algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!