Sorting is a fundamental problem in computer science. In the classical setting, it is well-
known that (1±o (1)) n log2 n comparisons are both necessary and sufficient to sort a list of n …

We consider the problem of sorting $ n $ elements in the case of\emph {persistent}
comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison …

Metric based comparison operations such as finding maximum, nearest and farthest
neighbor are fundamental to studying various clustering techniques such as $ k $-center …

We present comparison-based parallel algorithms for sorting n comparable items subject to
comparison errors. We consider errors to occur according to a well-studied framework …

In this paper, we address clustering problems in scenarios where accurate direct access to
the full dataset is impractical or impossible. Instead, we leverage oracle-based methods …

We provide and study several algorithms for sorting an array of n comparable distinct
elements subject to probabilistic comparison errors. In this model, the comparison of two …

We provide several algorithms for sorting an array of n comparable distinct elements subject
to probabilistic comparison errors in external memory. In this model, which has been …

Much prior work has been done on designing computational geometry algorithms that
handle input degeneracies, data imprecision, and arithmetic round-off errors. We take a new …

Sorting is one of the most basic primitives in many algorithms and data analysis tasks.
Comparison-based sorting algorithms, like quick-sort and merge-sort, are known to be …

We study the problem of designing a dictionary data structure that is resilient to memory
corruptions. Our error model is a variation of the faulty RAM model in which, except for …