1. Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: It’s all about regularity. SIAM J. Comput. 39(1), 143–167 (2009)
2. Andrew, A.M.: Another efficient algorithm for convex hulls in two dimensions. Inf. Process. Lett. 9(5), 216–219 (1979)
3. Baleshzar, R., Chakrabarty, D., Pallavoor, R.K.S., Raskhodnikova, S., Seshadhri, C.: Optimal unateness testers for real-valued functions: adaptivity helps. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10–14, 2017, Warsaw, Poland, Schloss Dagstuhl—Leibniz-Zentrum fuer Informatik, LIPIcs, vol. 80, pp 5:1–5:14 (2017)
4. Batu, T., Dasgupta, S., Kumar, R., Rubinfeld, R.: The complexity of approximating the entropy. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 678–687 (2002)
5. Batu, T., Ergün, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., Sami, R.: A sublinear algorithm for weakly approximating edit distance. In: Larmore, L.L., Goemans, M.X. (eds) Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9–11, 2003, San Diego, CA, USA, ACM, pp. 316–324 (2003)