Local Monotonicity Reconstruction
暂无分享,去创建一个
[1] Bernard Chazelle,et al. Estimating the distance to a monotone function , 2007, Random Struct. Algorithms.
[2] Terence Tao,et al. Testability and repair of hereditary hypergraph properties , 2008, Random Struct. Algorithms.
[3] Kyomin Jung,et al. Transitive-Closure Spanners , 2008, SIAM J. Comput..
[4] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[5] Kyomin Jung,et al. Transitive-Closure Spanners of the Hypercube and the Hypergrid , 2009, Electron. Colloquium Comput. Complex..
[6] Ronitt Rubinfeld,et al. Fast approximate PCPs for multidimensional bin-packing problems , 2005, Inf. Comput..
[7] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[8] Dana Ron,et al. Approximating the distance to monotonicity in high dimensions , 2010, TALG.
[9] Bernard Chazelle,et al. Information theory in property testing and monotonicity testing in higher dimension , 2006, Inf. Comput..
[10] Noam Nisan,et al. BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[11] Terence Tao,et al. Testability and repair of hereditary hypergraph properties , 2010 .
[12] Ronitt Rubinfeld,et al. Monotonicity testing over general poset domains , 2002, STOC '02.
[13] Dana Ron,et al. Property Testing , 2000 .
[14] Noga Alon,et al. A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[15] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[16] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[17] Yuval Peres,et al. Noise Tolerance of Expanders and Sublinear Expander Reconstruction , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[18] Eldar Fischer. On the strength of comparisons in property testing , 2004, Inf. Comput..
[19] Oded Goldreich,et al. Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.
[20] Bernard Chazelle,et al. Property-Preserving Data Reconstruction , 2004, Algorithmica.
[21] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[22] Michael E. Saks,et al. Parallel monotonicity reconstruction , 2008, SODA '08.
[23] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[24] Eldar Fischer,et al. Testing versus Estimation of Graph Properties , 2007, SIAM J. Comput..
[25] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[26] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[27] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[28] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[29] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[30] Eyal Kushilevitz,et al. Testing Monotonicity over Graph Products , 2004, ICALP.
[31] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[32] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[33] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[34] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[35] Oded Schramm,et al. Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..