Optimal dislocation with persistent errors in subquadratic time
type: Item
instance of: scholarly article
title: Optimal dislocation with persistent errors in subquadratic time
zbMATH Open document ID: 1433.68111
author: Barbara Geissmann
author: Stefano Leucci
author: Chih-Hung Liu
author: Paolo Penna
published in: Theory of Computing Systems
publication date: 2020-04-15T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8526/
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7189482
zbMATH Keywords: sorting
zbMATH Keywords: recurrent comparison errors
zbMATH Keywords: maximum dislocation
MaRDI profile type: Publication
OpenAlex ID: W2993963457
cites work: Sorting and Selection with Imprecise Comparisons
cites work: Quicksort with Unreliable Comparisons: A Probabilistic Analysis
cites work: Q3579395
cites work: The tail of the hypergeometric distribution
cites work: Fault-tolerant search algorithms. Reliable computation with unreliable information
cites work: Ordering by weighted number of wins gives a good ranking for weighted tournaments
cites work: The Solution Space of Sorting with Recurring Comparison Faults
cites work: Computing with Noisy Information
cites work: Sorting by swaps with noisy comparisons
cites work: Sorting with Recurrent Comparison Errors
cites work: Recursive merge sort with erroneous comparisons
cites work: Tolerant Algorithms
cites work: Searching games with errors -- fifty years of coping with liars
cites work: Sorting from Noisier Samples
Wikidata QID: Q126667258
DOI: 10.1007/S00224-019-09957-5
description: scientific article; zbMATH DE number 7189482