Something for (Almost) Nothing: New Advances in Sublinear-Time Algorithms

[1]  Dana Ron.  Property Testing: A Learning Theory Perspective , 2008, Found. Trends Mach. Learn..

[2]  Leonard Pitt,et al.  Sublinear time approximate clustering , 2001, SODA '01.

[3]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[4]  Rocco A. Servedio,et al.  Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[5]  Krzysztof Onak,et al.  A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size , 2011, SODA.

[6]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[7]  Ronitt Rubinfeld,et al.  Local Reconstructors and Tolerant Testers for Connectivity and Diameter , 2012, APPROX-RANDOM.

[8]  Nimrod Megiddo,et al.  An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem , 1986, J. Algorithms.

[9]  M. Kochen,et al.  Contacts and influence , 1978 .

[10]  Omer Reingold,et al.  New techniques and tighter bounds for local computation algorithms , 2014, J. Comput. Syst. Sci..

[11]  Artur Czumaj,et al.  Sublinear-Time Algorithms , 2006, Bull. EATCS.

[12]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[13]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[14]  Rocco A. Servedio,et al.  New Algorithms and Lower Bounds for Monotonicity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[15]  Yishay Mansour,et al.  Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.

[16]  Rocco A. Servedio,et al.  Testing Halfspaces , 2007, SIAM J. Comput..

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

[18]  Yishay Mansour,et al.  A Local Computation Approximation Scheme to Maximum Matching , 2013, APPROX-RANDOM.

[19]  Dana Ron,et al.  Distributed Maximum Matching in Bounded Degree Graphs , 2015, ICDCN.

[20]  Ronitt Rubinfeld,et al.  Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..

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

[22]  Avinatan Hassidim,et al.  Local Computation Mechanism Design , 2013, ACM Trans. Economics and Comput..

[23]  Joe Neeman,et al.  Testing surface area with arbitrary accuracy , 2013, STOC.

[24]  Seshadhri Comandur,et al.  A o(n) monotonicity tester for boolean functions over the hypercube , 2013, STOC '13.

[25]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[26]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[27]  Noga Alon,et al.  Testing of clustering , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[28]  Ryan O'Donnell,et al.  Testing Surface Area , 2014, SODA.

[29]  Noga Alon,et al.  On Active and Passive Testing , 2013, Combinatorics, Probability and Computing.

[30]  Artur Czumaj,et al.  Abstract Combinatorial Programs and Efficient Property Testers , 2005, SIAM J. Comput..

[31]  Dana Ron,et al.  On Sample-Based Testers , 2016, TOCT.

[32]  Dana Ron,et al.  Testing Problems with Sublearning Sample Complexity , 2000, J. Comput. Syst. Sci..

[33]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[34]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[35]  Roger Wattenhofer,et al.  Local Computation , 2010, J. ACM.

[36]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[37]  Ronitt Rubinfeld.  Taming big probability distributions , 2012, XRDS.

[38]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[39]  Dana Ron,et al.  Best of Two Local Models: Local Centralized and Local Distributed Algorithms , 2014, ArXiv.

[40]  Eric Blais.  Testing juntas nearly optimally , 2009, STOC '09.

[41]  Dana Ron,et al.  On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..

[42]  Ronitt Rubinfeld,et al.  Algorithms column: sublinear time algorithms , 2003, SIGA.

[43]  Sourav Chakraborty,et al.  Efficient Sample Extractors for Juntas with Applications , 2011, ICALP.

[44]  Eric Blais.  Improved Bounds for Testing Juntas , 2008, APPROX-RANDOM.

[45]  Dana Ron,et al.  Property Testing , 2000 .

[46]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[47]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..

[48]  Massachusetts Instmite.  Local Computation Algorithms for Graphs of Non-Constant Degrees , 2014 .

[49]  Yuichi Yoshida,et al.  An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.

[50]  Sofya Raskhodnikova,et al.  Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy , 2013, SIAM J. Comput..

[51]  Maria-Florina Balcan,et al.  Active Property Testing , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.