The complexity of promise problems with applications to public-key cryptography
Information and Control
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Testing the diameter of graphs
Random Structures & Algorithms
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Three theorems regarding testing graph properties
Random Structures & Algorithms
Lower Bounds for Testing Bipartiteness in Dense Graphs
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A separation theorem in property testing
Combinatorica
On the Benefits of Adaptivity in Property Testing of Dense Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Introduction to testing graph properties
Studies in complexity and cryptography
Hi-index | 0.00 |
This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). The first comment advocates paying more attention to the dependence of the tester's complexity on the proximity parameter. The second comment advocates paying more attention to the question of testing general graphs (rather than dense or bounded-degree ones). In addition, this article includes a suggestion to view and discuss property testing within the framework of promise problems.