Testing multivariate linear functions: overcoming the generator bottleneck
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Reflections on the Pentium Division Bug
IEEE Transactions on Computers
Witness-based cryptographic program checking and robust function sharing
STOC '96 Proceedings of the twenty-eighth 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
Software reliability via run-time result-checking
Journal of the ACM (JACM)
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
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Testing problems with sub-learning sample complexity
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Self-testing of universal and fault-tolerant sets of quantum gates
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects of computer science
ICALP '01 Proceedings of the 28th 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
The Query Complexity of Program Checking by Constant-Depth Circuits
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Multi-linearity Self-Testing with Relative Error
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Property testing in massive graphs
Handbook of massive data sets
Extractors: optimal up to constant factors
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
Algebraic testing and weight distributions of codes
Theoretical Computer Science
A Nonadaptive NC Checker for Permutation Group Intersection
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Approximate testing with error relative to input size
Journal of Computer and System Sciences
Regular Languages are Testable with a Constant Number of Queries
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fast approximate probabilistically checkable proofs
Information and Computation
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
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
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A lower bound for testing juntas
Information Processing Letters
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
An effective testing method for end-user programmers
WEUSE I Proceedings of the first workshop on End-user software engineering
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
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Robust locally testable codes and products of codes
Random Structures & Algorithms
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
An empirical comparison between direct and indirect test result checking approaches
Proceedings of the 3rd international workshop on Software quality assurance
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Verifying and decoding in constant depth
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
Non-Abelian homomorphism testing, and distributions close to their self-convolutions
Random Structures & Algorithms
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
List-decoding reed-muller codes over small fields
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of 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
Inverse conjecture for the gowers norm is false
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unconditional pseudorandom generators for low degree polynomials
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
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
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
Random Structures & Algorithms
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
3-bit dictator testing: 1 vs. 5/8
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
The Fault Tolerance of NP-Hard Problems
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Cube Attacks on Tweakable Black Box Polynomials
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
On proximity oblivious testing
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
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers
ACM Transactions on Computation Theory (TOCT)
Composition of Semi-LTCs by Two-Wise Tensor Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Hypergraph Dictatorship Test with Perfect Completeness
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
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
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
Application of ε -testers algorithms under sketch calculation model in robot navigation problem
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
Side Channel Cube Attack on PRESENT
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation
WSEAS Transactions on Computers
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Property testing: a learning theory perspective
COLT'07 Proceedings of the 20th annual conference on Learning theory
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Derandomizing graph tests for homomorphism
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)
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Relational properties expressible with one universal quantifier are testable
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
A query efficient non-adaptive long code test with perfect completeness
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The fault tolerance of NP-hard problems
Information and Computation
On the derandomization of the graph test for homomorphism over groups
Theoretical Computer Science
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
SIAM Journal on Computing
Local Monotonicity Reconstruction
SIAM Journal on Computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
A brief introduction to property testing
Property testing
Testing juntas: a brief survey
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
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
Symmetric LDPC codes and local testing
Property testing
Some recent results on local testing of sparse linear codes
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
Testing juntas: a brief survey
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
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
Symmetric LDPC codes and local testing
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Local property reconstruction and monotonicity
Property testing
Green's conjecture and testing linear invariant properties
Property testing
NP-hardness of approximately solving linear equations over reals
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
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
Short locally testable codes and proofs
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
Property testing for cyclic groups and beyond
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A canonical form for testing boolean function properties
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
Hard functions for low-degree polynomials over prime fields
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On-line approximate string matching with bounded errors
Theoretical Computer Science
ESA'11 Proceedings of the 19th European conference on Algorithms
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
On Proximity-Oblivious Testing
SIAM Journal on Computing
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Information Processing Letters
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
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Self-testing of quantum circuits
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
How to securely outsource cryptographic computations
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the query complexity of testing orientations for being Eulerian
ACM Transactions on Algorithms (TALG)
A metabolic approach to protocol resilience
WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
Local decoding and testing for homomorphisms
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
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
Untestable properties expressible with four first-order quantifiers
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Approximate judgement aggregation
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The Cube Attack on Stream Cipher Trivium and Quadraticity Tests
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Cube cryptanalysis of LBlock with noisy leakage
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hard Functions for Low-Degree Polynomials over Prime Fields
ACM Transactions on Computation Theory (TOCT)
Verifying quantitative reliability for programs that execute on unreliable hardware
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Local correctability of expander codes
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A new model for error-tolerant side-channel cube attacks
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Testing consistency of quartet topologies: A parameterized approach
Information Processing Letters
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
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
High dimensional expanders and property testing
Proceedings of the 5th conference on Innovations in theoretical computer science
Approximately classic judgement aggregation
Annals of Mathematics and Artificial Intelligence
Property testing for cyclic groups and beyond
Journal of Combinatorial Optimization
| Hi-index | 0.01 |