| Publication | Date of Publication | Type |
|---|
VC dimension and distribution-free sample-based testing
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7758320 (Why is no real title available?) | 2023-10-31 | Paper |
Optimal separation and strong direct sum for randomized query complexity
(available as arXiv preprint) | 2022-07-27 | Paper |
A polynomial lower bound for testing monotonicity
SIAM Journal on Computing | 2021-06-22 | Paper |
Testing convexity of functions over finite domains
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
Advances in Artificial Intelligence | 2020-08-05 | Paper |
| Distribution testing lower bounds via reductions from communication complexity | 2020-05-26 | Paper |
Distribution testing lower bounds via reductions from communication complexity
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Tolerant junta testing and the connection to submodular optimization and function isomorphism
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
A characterization of constant-sample testable properties
Random Structures & Algorithms | 2019-10-16 | Paper |
Testing submodularity and other properties of valuation functions
(available as arXiv preprint) | 2018-05-03 | Paper |
| Tolerant junta testing and the connection to submodular optimization and function isomorphism | 2018-03-15 | Paper |
A polynomial lower bound for testing monotonicity
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Learning circuits with few negations
(available as arXiv preprint) | 2017-08-31 | Paper |
| The information complexity of Hamming distance | 2017-03-22 | Paper |
scientific article; zbMATH DE number 6538684 (Why is no real title available?)
Theory of Computing | 2016-02-02 | Paper |
Approximating Boolean functions with depth-2 circuits
SIAM Journal on Computing | 2015-11-18 | Paper |
Partially symmetric functions are efficiently isomorphism testable
SIAM Journal on Computing | 2015-06-02 | Paper |
Partially symmetric functions are efficiently isomorphism testable
SIAM Journal on Computing | 2015-06-02 | Paper |
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
scientific article; zbMATH DE number 6351506 (Why is no real title available?)
Theory of Computing | 2014-10-06 | Paper |
On DNF approximators for monotone Boolean functions
Automata, Languages, and Programming | 2014-07-01 | Paper |
Semi-strong colouring of intersecting hypergraphs
Combinatorics, Probability and Computing | 2014-05-02 | Paper |
Nearly tight bounds for testing function isomorphism
SIAM Journal on Computing | 2013-07-24 | Paper |
Property testing lower bounds via communication complexity
Computational Complexity | 2012-12-07 | Paper |
Tight bounds for testing \(k\)-linearity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Testing juntas: a brief survey
Property Testing | 2010-10-12 | Paper |
Polynomial regression under arbitrary product distributions
Machine Learning | 2010-10-07 | Paper |
Testing Boolean function isomorphism
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
| Longest Common Subsequences in Sets of Permutations | 2009-04-09 | Paper |
Improved Bounds for Testing Juntas
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Common Substrings in Random Strings
Combinatorial Pattern Matching | 2007-09-14 | Paper |
