Skip to main content
Springer Nature Link
Log in

A Fault-Tolerant Merge Sorting Algorithm

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2387))

Included in the following conference series:

Abstract

Sorting based on pairwise key comparisons is one of the most widely studied problems. We consider the problem of comparison based sorting in which some of the outcomes of comparisons can be faulty. We show how to modify merge-sorting to (nearly optimally) sort in the presence of faults. More specifically, we show that there is a variation of merge-sort that can sort n records with O(n log n) comparisons when upto e = ⊝(log n/log log n) comparisons are faulty.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. Bagchi. On sorting in the presence of erroneous information. Information Processing Letters, 43(4):213–215, 28 September 1992.

    Google Scholar 

  2. R.S. Borgstrom and S.R. Kosaraju, Comparison-based search in the presence of errors, Proc. of ACM Symposium on Theory of Computing (1993), pp. 130–136.

    Google Scholar 

  3. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, 2nd Edition, MIT Press 2001.

    Google Scholar 

  4. U. Feige, P. Raghavan, D. Peleg and E. Upfal, Computing with noisy information, Proc. IEEE Symposium on Theoretical Computer Science (1994), pp. 1001–1008.

    Google Scholar 

  5. D. Knuth, Art of Computer Programming, Volume 3. Sorting and Searching, 2nd Edition, Addison-Wesley, 1998.

    Google Scholar 

  6. K.B. Lakshmanan, B. Ravikumar and K. Ganesan, Coping with errors while sorting. IEEE Transactions on Computers 40(9), (1991), pp. 1081–1084.

    Article  Google Scholar 

  7. P.M. Long, Sorting and searching with a faulty comparison oracle. UCSC-CRL-92-15 (available electronically as ucsc-crl-92-15.ps.Z)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sonoma State University, Rohnert Park, CA, 94128

    B. Ravikumar

Authors
  1. B. Ravikumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ravikumar, B. (2002). A Fault-Tolerant Merge Sorting Algorithm. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics