Edge-connectivity augmentation problems
Journal of Computer and System Sciences
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
Applications of a poset representation to edge connectivity and graph rigidity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Graph Algorithms
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A representation of cuts within 6/5 times the edge connectivity with applications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Property testing and its connection to learning and approximation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Neural networks and efficient associative memory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
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
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Sampling algorithms: lower bounds and applications
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
STOC '01 Proceedings of the thirty-third 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
Testing the diameter of graphs
Random Structures & Algorithms
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Exact and approximate testing/correcting of algebraic functions: a survey
Theoretical aspects 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 Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
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
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
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
On the strength of comparisons in property testing
Information and Computation
Robust pcps of proximity, shorter pcps and applications to coding
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
A lower bound for testing juntas
Information Processing Letters
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
Conformance testing in the presence of multiple faults
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Implementing Huge Sparse Random 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
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
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
A brief introduction to property testing
Property testing
A brief introduction to property testing
Property testing
Towards privacy for social networks: a zero-knowledge based definition of privacy
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On testing expansion in bounded-degree graphs
Studies in complexity and cryptography
A brief introduction to property testing
Studies in complexity and cryptography
Testing Eulerianity and connectivity in directed sparse graphs
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
Theoretical Computer Science
Principles of network computing
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Quantum Testers for Hidden Group Properties
Fundamenta Informaticae - Machines, Computations and Universality, Part II
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
| Hi-index | 0.01 |