Testing if an Array Is Sorted

[1]  Sofya Raskhodnikova,et al.  Lower Bounds for Testing Properties of Functions over Hypergrid Domains , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[2]  Sofya Raskhodnikova,et al.  Lp-testing , 2014, STOC.

[3]  Seshadhri Comandur,et al.  Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids , 2013, STOC '13.

[4]  Kyomin Jung,et al.  Transitive-Closure Spanners , 2008, SIAM J. Comput..

[5]  E. Fischer,et al.  Detecting and exploiting near-sortedness for efficient relational query evaluation , 2011, ICDT '11.

[6]  Sofya Raskhodnikova.  Transitive-Closure Spanners: A Survey , 2010, Property Testing.

[7]  Ronitt Rubinfeld,et al.  Fast approximate probabilistically checkable proofs , 2004, Inf. Comput..

[8]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[9]  Eldar Fischer.  On the strength of comparisons in property testing , 2004, Inf. Comput..

[10]  Ronitt Rubinfeld,et al.  Spot-Checkers , 2000, J. Comput. Syst. Sci..

[11]  Dana Ron,et al.  Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..

[12]  Oded Goldreich,et al.  Testing Monotonicity , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.