The solution space of sorting with recurring comparison faults
type: Item
instance of: scholarly article
title: The solution space of sorting with recurring comparison faults
zbMATH Open document ID: 1391.68025
author: Peter Damaschke
published in: Theory of Computing Systems
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6912866
zbMATH Keywords: sorting
zbMATH Keywords: faulty input
zbMATH Keywords: feedback arc set
zbMATH Keywords: enumeration
zbMATH Keywords: fixed-parameter tractability
Wikidata QID: Q59610956
MaRDI profile type: Publication
full work available at URL: s00224-017-9807-4
OpenAlex ID: W2752867247
cites work: Kernels for feedback arc set in tournaments
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Q3579395
cites work: Fault-tolerant search algorithms. Reliable computation with unreliable information
cites work: Structural filtering: a paradigm for efficient and exact geometric programs
cites work: On the complexity of partial order properties
cites work: Optimal Resilient Sorting and Searching in the Presence of Memory Faults
cites work: Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
cites work: Recurring Comparison Faults: Sorting and Finding the Minimum
cites work: Q2957449
cites work: Parameterized algorithms for feedback set problems and their duals in tournaments
DOI: 10.1007/S00224-017-9807-4
description: scientific article; zbMATH DE number 6912866