Skip to main content
SpringerLink
Log in

Testing if an Array Is Sorted

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Ben-Moshe S, Kanza Y, Fischer E, Matsliah A, Fischer M, Staelin C (2011) Detecting and exploiting near-sortedness for efficient relational query evaluation. In: ICDT, Uppsala, pp 256–267

    Google Scholar 

  2. Berman P, Raskhodnikova S, Yaroslavtsev G (2014) L p -testing. In: Shmoys DB (ed) STOC, New York. ACM, pp 164–173

    Google Scholar 

  3. Bhattacharyya A, Grigorescu E, Jung K, Raskhodnikova S, Woodruff DP (2012) Transitive-closure spanners. SIAM J Comput 41(6):1380–1425

    Article  MathSciNet  MATH  Google Scholar 

  4. Blais E, Raskhodnikova S, Yaroslavtsev G (2014) Lower bounds for testing properties of functions over hypergrid domains. In: IEEE 29th conference on computational complexity (CCC) 2014, Vancouver, 11–13 June 2014, pp 309–320

    Google Scholar 

  5. Chakrabarty D, Seshadhri C (2013) Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In: STOC, Palo Alto, pp 419–428

    MATH  Google Scholar 

  6. Dodis Y, Goldreich O, Lehman E, Raskhodnikova S, Ron D, Samorodnitsky A (1999) Improved testing algorithms for monotonicity. In: RANDOM, Berkeley, pp 97–108

    MATH  Google Scholar 

  7. Ergün F, Kannan S, Kumar R, Rubinfeld R, Viswanathan M (2000) Spot-checkers. J Comput Syst Sci 60(3):717–751

    Article  MathSciNet  MATH  Google Scholar 

  8. Ergün F, Kumar R, Rubinfeld R (2004) Fast approximate probabilistically checkable proofs. Inf Comput 189(2):135–159

    Article  MathSciNet  MATH  Google Scholar 

  9. Fischer E (2004) On the strength of comparisons in property testing. Inf Comput 189(1):107–116

    Article  MathSciNet  MATH  Google Scholar 

  10. Fischer E, Lehman E, Newman I, Raskhodnikova S, Rubinfeld R, Samorodnitsky A (2002) Monotonicity testing over general poset domains. In: STOC, Montreal, pp 474–483

    MATH  Google Scholar 

  11. Goldreich O, Goldwasser S, Lehman E, Ron D, Samorodnitsky A (2000) Testing monotonicity. Combinatorica 20(3):301–337

    Article  MathSciNet  MATH  Google Scholar 

  12. Raskhodnikova S (2010) Transitive-closure spanners: a survey. In: Goldreich O (ed) Property testing. Lecture notes in computer science, vol 6390. Springer, Berlin, pp 167–196

    Chapter  Google Scholar 

Download references

Acknowledgements

The author was supported in part by NSF CAREER award CCF-0845701 and Boston University’s Hariri Institute for Computing and Center for Reliable Information Systems and Cyber Security.

Author information

Authors and Affiliations

  1. Computer Science and Engineering Department, Pennsylvania State University, University Park, State College, PA, USA

    Sofya Raskhodnikova

Authors
  1. Sofya Raskhodnikova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sofya Raskhodnikova .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Raskhodnikova, S. (2016). Testing if an Array Is Sorted. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_700

Download citation

Publish with us

Policies and ethics

Search

Navigation