A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the Robustness of Functional Equations
SIAM Journal on Computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Checking Approximate Computations of Polynomials and Functional Equations
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Testing the diameter of graphs
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
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
A sublinear algorithm for weakly approximating edit distance
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
Approximate testing with error relative to input size
Journal of Computer and System Sciences
Three Theorems Regarding Testing Graph Properties
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the strength of comparisons in property testing
Information and Computation
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Testing Polynomials over General Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing Low-Degree Polynomials over Prime Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Sampling in dynamic data streams and applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Approximating the Minimum Spanning Tree Weight in Sublinear Time
SIAM Journal on Computing
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
SIAM Journal on Computing
Almost Orthogonal Linear Codes are Locally Testable
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
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sublinear Geometric Algorithms
SIAM Journal on 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
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
A variant of the hypergraph removal lemma
Journal of Combinatorial Theory Series A
Limits of dense graph sequences
Journal of Combinatorial Theory Series B
Information theory in property testing and monotonicity testing in higher dimension
Information and Computation
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
Non-Abelian homomorphism testing, and distributions close to their self-convolutions
Random Structures & Algorithms
Testing versus Estimation of Graph Properties
SIAM Journal on Computing
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Testing Expansion in Bounded-Degree Graphs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Approximate Hypergraph Partitioning and Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Sparse Random Linear Codes are Locally Decodable and Testable
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
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
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
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
Testing Triangle-Freeness in General Graphs
SIAM Journal on Discrete Mathematics
Every Monotone Graph Property Is Testable
SIAM Journal on Computing
Short PCPs with Polylog Query Complexity
SIAM Journal on Computing
An Expansion Tester for Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Sublinear Algorithms for Approximating String Compressibility
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
Constant-Time Approximation Algorithms via Local Improvements
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
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
Note: A combinatorial proof of the Removal Lemma for Groups
Journal of Combinatorial Theory Series A
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
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
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
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing
Combinatorial Construction of Locally Testable Codes
SIAM Journal on Computing
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
SIAM Journal on Computing
Fast approximate PCPs for multidimensional bin-packing problems
Information and Computation
Testing the expansion of a graph
Information and Computation
Local Graph Partitions for Approximation and Testing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Testability and repair of hereditary hypergraph properties
Random Structures & Algorithms
Parameter testing in bounded degree graphs of subexponential growth
Random Structures & Algorithms
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Invariance in property testing
Property testing
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
A sublinear time algorithm for pagerank computations
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
The power of local information in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.