Sampling algorithms: lower bounds and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of approximating entropy
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Complexity of Comparing Hidden Markov Models
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Sampling lower bounds via information theory
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algorithms column: sublinear time algorithms
ACM SIGACT News
Sublinear algorithms for testing monotone and unimodal distributions
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Testing monotone high-dimensional distributions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Streaming and sublinear approximation of entropy and information distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Detecting change in data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An empirical study of bandwidth predictability in mobile computing
Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Sublinear estimation of entropy and information distances
ACM Transactions on Algorithms (TALG)
Relaxed Transfer of Different Classes via Spectral Partition
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Measuring independence of datasets
Proceedings of the forty-second ACM symposium on Theory of computing
Testing monotone continuous distributions on high-dimensional real cubes
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
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
A brief introduction to property testing
Property testing
Introduction to testing graph properties
Property testing
Invariance in property testing
Property testing
Sublinear algorithms in the external memory model
Property testing
Property testing
A brief introduction to property testing
Property testing
Introduction to testing graph properties
Property testing
Invariance in property testing
Property testing
Sublinear algorithms in the external memory model
Property testing
Property testing
Proceedings of the forty-third annual ACM symposium on Theory of computing
On testing expansion in bounded-degree graphs
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
Learnability of probabilistic automata via oracles
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Approximating and testing k-histogram distributions in sub-linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Taming big probability distributions
XRDS: Crossroads, The ACM Magazine for Students - Big Data
Testing Symmetric Properties of Distributions
SIAM Journal on Computing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
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)
Moving heaven and earth: distances between distributions
ACM SIGACT News
| Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...