The solution space of sorting with recurring comparison faults
From MaRDI portal
Publication:726101
DOI10.1007/s00224-017-9807-4zbMath1391.68025OpenAlexW2752867247WikidataQ59610956 ScholiaQ59610956MaRDI QIDQ726101
Publication date: 3 August 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-017-9807-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Kernels for feedback arc set in tournaments
- Parameterized algorithms for feedback set problems and their duals in tournaments
- On the complexity of partial order properties
- Structural filtering: a paradigm for efficient and exact geometric programs
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
- Recurring Comparison Faults: Sorting and Finding the Minimum
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- Algorithmic Aspects of Vertex Elimination on Graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: The solution space of sorting with recurring comparison faults