# Tolerant Algorithms

@inproceedings{Klein2011TolerantA, title={Tolerant Algorithms}, author={Rolf Klein and Rainer Penninger and Christian Sohler and David P. Woodruff}, booktitle={ESA}, year={2011} }

Assume we are interested in solving a computational task, e.g., sorting n numbers, and we only have access to an unreliable primitive operation, for example, comparison between two numbers. Suppose that each primitive operation fails with probability at most p and that repeating it is not helpful, as it will result in the same outcome. Can we still approximately solve our task with probability 1-f(p) for a function f that goes to 0 as p goes to 0? While previous work studied sorting in this… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## Longest Increasing Subsequence under Persistent Comparison Errors

VIEW 2 EXCERPTS

CITES BACKGROUND

## Optimal Dislocation with Persistent Errors in Subquadratic Time

VIEW 2 EXCERPTS

CITES BACKGROUND

## Optimal Sorting with Persistent Comparison Errors

VIEW 2 EXCERPTS

CITES BACKGROUND

## Longest Increasing Subsequence under Persistent Comparison Errors

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES

## Noisy sorting without resampling

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Linear Programming in Linear Time When the Dimension Is Fixed

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Resilient dictionaries

VIEW 1 EXCERPT

## Clarkson . Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small

## Noisy binary search and its applications

VIEW 2 EXCERPTS