The solution space of sorting with recurring comparison faults
From MaRDI portal
Recommendations
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Fault-tolerant search algorithms. Reliable computation with unreliable information
- Kernels for feedback arc set in tournaments
- Noisy sorting without resampling
- On the complexity of partial order properties
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Recurring comparison faults: sorting and finding the minimum
- Structural filtering: a paradigm for efficient and exact geometric programs
- Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
Cited in
(5)- Recurring comparison faults: sorting and finding the minimum
- Sorting and searching in the presence of memory faults (without redundancy)
- scientific article; zbMATH DE number 2089999 (Why is no real title available?)
- Sorting with Recurrent Comparison Errors
- The solution space of sorting with recurring comparison faults
This page was built for publication: The solution space of sorting with recurring comparison faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726101)