Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
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
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
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Data streams: algorithms and applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
SIAM Journal on Discrete Mathematics
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Testing Random Variables for Independence and Identity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Three Theorems Regarding Testing Graph Properties
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
On testable properties in bounded degree graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
On-Line Approximate String Matching with Bounded Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Separating Sublinear Time Computations by Approximate Diameter
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
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 expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Property testing
Property testing
On-line approximate string matching with bounded errors
Theoretical Computer Science
| Hi-index | 0.00 |