Quicksort with Unreliable Comparisons: A Probabilistic Analysis

DOI10.1017/S0963548304006297zbMath1097.68545arXivmath/0312437OpenAlexW2951005622MaRDI QIDQ4670351

René Schott, Florent Gillet, Laurent Alonso, Philippe Chassaing, Svante Janson, Edward M. Reingold

Publication date: 18 April 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0312437

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (7)

Optimal Dislocation with Persistent Errors in Subquadratic Time ⋮ Energy efficient sorting, selection and searching ⋮ Recursive merge sort with erroneous comparisons ⋮ Optimal dislocation with persistent errors in subquadratic time ⋮ Unnamed Item ⋮ Longest increasing subsequence under persistent comparison errors ⋮ Sorting with Recurrent Comparison Errors

This page was built for publication: Quicksort with Unreliable Comparisons: A Probabilistic Analysis