Tolerant Algorithms

@inproceedings{Klein2011TolerantA,
  title={Tolerant Algorithms},
  author={Rolf Klein and Rainer Penninger and Christian Sohler and David P. Woodruff},
  booktitle={ESA},
  year={2011}
}
  • Rolf Klein, Rainer Penninger, +1 author David P. Woodruff
  • Published in ESA 2011
  • Computer Science
  • 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.

    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

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

    • L. K.
    • Noisy Sorting Without Resampling . Proc . 19 th Annual ACMSIAM Symp . on Discrete Algorithms
    • 2008

    Searching games with errors - fifty years of coping with liars

    VIEW 1 EXCERPT

    Robustness and Precision Issues in Geometric Computation