Communications of the ACM
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
The complexity of colouring problems on dense graphs
Theoretical Computer Science
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Training a 3-node neural network in NP-complete
Advances in neural information processing systems 1
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Can finite samples detect singularities of real-valued functions?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Toward efficient agnostic learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On probably correct classification of concepts
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The hardness of approximation: gap location
Computational Complexity
Probably Almost Discriminative Learning
Machine Learning
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
MAX-CUT has a randomized approximation scheme in dense graphs
Random Structures & Algorithms
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A sublinear bipartiteness tester for bounded degree graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Testing problems with sub-learning sample complexity
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Linearity testing in characteristic two
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistically checkable proofs and the testing of hadamard-like codes
Probabilistically checkable proofs and the testing of hadamard-like codes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Testing and spot-checking of data streams (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the integrality ratio of semidefinite relaxations of MAX CUT
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Testing the diameter of graphs
Random Structures & Algorithms
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Testing membership in parenthesis languages
Random Structures & Algorithms
Property testing of data dimensionality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Hunting for Functionally Analogous Genes
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Proclaiming Dictators and Juntas or Testing Boolean Formulae
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On Testing Convexity and Submodularity
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Property testing in massive graphs
Handbook of massive data sets
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Result checking in global computing systems
ICS '03 Proceedings of the 17th annual international conference on Supercomputing
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
Journal of Algorithms
Three theorems regarding testing graph properties
Random Structures & Algorithms
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Algorithms column: sublinear time algorithms
ACM SIGACT News
Information and Computation
On the strength of comparisons in property testing
Information and Computation
Fast approximate probabilistically checkable proofs
Information and Computation
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Estimating the weight of metric minimum spanning trees in sublinear-time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The difficulty of testing for isomorphism against a graph that is given in advance
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Clustering Large Graphs via the Singular Value Decomposition
Machine Learning
Machine Learning
A New Conceptual Clustering Framework
Machine Learning
A lower bound for testing juntas
Information Processing Letters
Journal of Computer and System Sciences - Special issue on FOCS 2002
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
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the 2nd conference on Computing frontiers
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Linear equations, arithmetic progressions and hypergraph property testing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
Almost Orthogonal Linear Codes are Locally Testable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Correlation clustering with a fixed number of clusters
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Information theory in property testing and monotonicity testing in higher dimension
Information and Computation
Lower bounds for testing Euclidean Minimum Spanning Trees
Information Processing Letters
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Estimating the distance to a monotone function
Random Structures & Algorithms
Quantum Algorithms for Learning and Testing Juntas
Quantum Information Processing
Yet another algorithm for dense max cut: go greedy
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel monotonicity reconstruction
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Inverse conjecture for the gowers norm is false
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing monotonicity over graph products
Random Structures & Algorithms
Space Complexity Vs. Query Complexity
Computational Complexity
Approximate schemas, source-consistency and query answering
Journal of Intelligent Information Systems
Finding a dense-core in Jellyfish graphs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Separating Sublinear Time Computations by Approximate Diameter
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the Query Complexity of Testing Orientations for Being Eulerian
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Testing whether a digraph contains H-free k-induced subgraphs
Theoretical Computer Science
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
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
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
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
On the Randomness Complexity of Property Testing
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
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
Attribute estimation and testing quasi-symmetry
Information Processing Letters
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed discovery of large near-cliques
Proceedings of the 28th ACM symposium on Principles of distributed computing
ACM Transactions on Computation Theory (TOCT)
Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic Aspects of Property Testing in the Dense Graphs Model
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Tolerant Linearity Testing and Locally Testable Codes
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Foundations and Trends® in Theoretical Computer Science
Approximate Structural Consistency
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A large lower bound on the query complexity of a simple boolean function
Information Processing Letters
Periodicity testing with sublinear samples and space
ACM Transactions on Algorithms (TALG)
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Testing convexity properties of tree colorings
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Property testing: a learning theory perspective
COLT'07 Proceedings of the 20th annual conference on Learning theory
Finding a dense-core in Jellyfish graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Approximating the distance to monotonicity in high dimensions
ACM Transactions on Algorithms (TALG)
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Finding maximum degrees in hidden bipartite graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Testing Boolean function isomorphism
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Distribution-free testing algorithms for monomials with a sublinear number of queries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On testing computability by small width OBDDs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Testing outerplanarity of bounded degree graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
SIAM Journal on Computing
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
Local Monotonicity Reconstruction
SIAM Journal on Computing
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
Guest column: testing linear properties: some general theme
ACM SIGACT News
A brief introduction to property testing
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Testing juntas: a brief survey
Property testing
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Property testing of massively parametrized problems – a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Testing by implicit learning: a brief survey
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Testing (subclasses of) halfspaces
Property testing
Local property reconstruction and monotonicity
Property testing
Green's conjecture and testing linear invariant properties
Property testing
A brief introduction to property testing
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Testing juntas: a brief survey
Property testing
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Property testing of massively parametrized problems – a survey
Property testing
Transitive-closure spanners: a survey
Property testing
Testing by implicit learning: a brief survey
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Testing (subclasses of) halfspaces
Property testing
Local property reconstruction and monotonicity
Property testing
Green's conjecture and testing linear invariant properties
Property testing
Correlation testing for affine invariant properties on Fpn in the high error regime
Proceedings of the forty-third annual ACM symposium on Theory of computing
Every property of hyperfinite graphs is testable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the average-case complexity of property testing
Studies in complexity and cryptography
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
Short locally testable codes and proofs
Studies in complexity and cryptography
On the complexity of computational problems regarding distributions
Studies in complexity and cryptography
A brief introduction to property testing
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Another motivation for reducing the randomness complexity of algorithms
Studies in complexity and cryptography
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Quantum property testing for bounded-degree graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On sums of locally testable affine invariant properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the rate of locally testable affine-invariant codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Inflatable graph properties and natural property tests
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Proximity oblivious testing and the role of invariances
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On approximating the number of relevant variables in a function
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On Proximity-Oblivious Testing
SIAM Journal on Computing
An Expansion Tester for Bounded Degree Graphs
SIAM Journal on Computing
ICDT'07 Proceedings of the 11th international conference on Database Theory
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Learning k-modal distributions via testing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding frequent patterns in a string in sublinear time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Testing computability by width-two OBDDs
Theoretical Computer Science
A lower bound for distribution-free monotonicity testing
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Information theory in property testing and monotonicity testing in higher dimension
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Property-Preserving data reconstruction
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
Property testing and the branching program size of boolean functions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Space complexity vs. query complexity
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Distance approximation in bounded-degree and general sparse graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Untestable properties expressible with four first-order quantifiers
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
Testability of minimum balanced multiway cut densities
Discrete Applied Mathematics
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
Testing the (s,t)-disconnectivity of graphs and digraphs
Theoretical Computer Science
Approximating and testing k-histogram distributions in sub-linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Finding overlapping communities in social networks: toward a rigorous approach
Proceedings of the 13th ACM Conference on Electronic Commerce
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
Sketching in Adversarial Environments
SIAM Journal on Computing
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
A dense hierarchy of sublinear time approximation schemes for bin packing
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Principles of network computing
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Checking and spot-checking the correctness of priority queues
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
On the power of conditional samples in distribution testing
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Testing Closeness of Discrete Distributions
Journal of the ACM (JACM)
Testing the lipschitz property over product distributions with applications to data privacy
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Testing subdivision-freeness: property testing meets structural graph theory
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On Approximating the Number of Relevant Variables in a Function
ACM Transactions on Computation Theory (TOCT)
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Testing linear-invariant function isomorphism
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Testing consistency of quartet topologies: A parameterized approach
Information Processing Letters
Locally testable codes and cayley graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.02 |
In this paper, we consider the question of determining whether a function f has property P or is &egr;-far from any function with property P. A property testing algorithm is given a sample of the value of f on instances drawn according to some distribution. In some cases, it is also allowed to query f on instances of its choice. We study this question for different properties and establish some connections to problems in learning theory and approximation.In particular, we focus our attention on testing graph properties. Given access to a graph G in the form of being able to query whether an edge exists or not between a pair of vertices, we devise algorithms to test whether the underlying graph has properties such as being bipartite, k-Colorable, or having a p-Clique (clique of density p with respect to the vertex set). Our graph property testing algorithms are probabilistic and make assertions that are correct with high probability, while making a number of queries that is independent of the size of the graph. Moreover, the property testing algorithms can be used to efficiently (i.e., in time linear in the number of vertices) construct partitions of the graph that correspond to the property being tested, if it holds for the input graph.