Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference15 articles.
1. Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Transactions on Algorithms 12(2), 19 (2016)
2. Alonso, L., Chassaing, P., Gillet, F., Janson, S., Reingold, E.M., Schott, R.: Quicksort with unreliable comparisons: a probabilistic analysis. Comb. Probab. Comput. 13(4-5), 419–449 (2004)
3. Braverman, M., Mossel, E.: Noisy sorting without Resampling. In: Proceedings of the 19th annual symposium on discrete algorithms, pp. 268–276 (2008)
4. Chvátal, V.: The tail of the hypergeometric distribution. Discret. Math. 25 (3), 285–287 (1979)
5. Cicalese, F.: Fault-tolerant search algorithms - reliable computation with unreliable information. Monographs in Theoretical Computer Science. An EATCS Series Springer (2013)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Parallel Sorting with Comparison Errors;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. Optimal Bounds for Noisy Sorting;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Approximate Selection With Persistent Random Comparison Faults;2023
4. External-Memory Sorting with Comparison Errors;Lecture Notes in Computer Science;2023
5. Approximate Minimum Selection with Unreliable Comparisons;Algorithmica;2021-11-01