- On One-Sided Testing Affine Subspaceseccc, TR22, 2022. [doi]
- Non-Adaptive Proper Learning Polynomialseccc, TR22, 2022. [doi]
- On properties that are non-trivial to testeccc, 29:13, 2022. [doi]

- Almost Optimal Testers for Concise Representationseccc, 26:156, 2019. [doi]

- Non-adaptive learning of a hidden hypergraphTCS, 716:15-27, 2018. [doi]
- Exact learning of juntas from membership queriesTCS, 742:82-97, 2018. [doi]

- Guest Editors' forewordTCS, 558:1-4, 2014. [doi]

- A Simple Algorithm for Undirected Hamiltonicityeccc, 20:12, 2013. [doi]

- Toward a deterministic polynomial time algorithm with optimal additive query complexityTCS, 417:23-35, 2012. [doi]
- Linear classifiers are nearly optimal when hidden variables have diverse effectsml, 86(2):209-231, 2012. [doi]
- Testers and their Applicationseccc, 19:11, 2012. [doi]

- Reconstructing weighted graphs with minimal query complexityTCS, 412(19):1782-1790, 2011. [doi]

- Using the doubling dimension to analyze the generalization of learning algorithmsjcss, 75(6):323-335, 2009. [doi]
- On Parity Check (0, 1)-Matrix over Z::p::eccc, 16:67, 2009. [doi]

- Learning with errors in answers to membership queriesjcss, 74(1):2-15, 2008. [doi]
- Guest Editors Introduction: Special issue on Learning Theory (COLT-2007)ml, 72(1-2):1-4, 2008. [doi]

- Learning attribute-efficiently with corrupt oraclesTCS, 387(1):32-50, 2007. [doi]

- Polynomial multiplication over finite fields: from quadratic to straight-line complexitycc, 15(3):252-262, 2006. [doi]
- Maximizing agreements and coagnostic learningTCS, 350(1):24-39, 2006. [doi]

- Exploring learnability between exact and PACjcss, 70(4):471-484, 2005. [doi]
- Maximizing Agreements with One-Sided Error with Applications to Heuristic Learningml, 59(1-2):99-123, 2005. [doi]
- Learning DNF from random walksjcss, 71(3):250-265, 2005. [doi]

- On the Proper Learning of Axis-Parallel Conceptsjmlr, 4:157-176, 2003. [doi]
- Uniform-distribution attribute noise learnabilityiandc, 187(2):277-290, 2003. [doi]
- The monotone theory for the PAC-modeliandc, 186(1):20-35, 2003. [doi]

- On Boosting with Polynomially Bounded Distributionsjmlr, 3:483-506, 2002. [doi]
- Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queriesjmlr, 3:49-57, 2002. [doi]
- On the proper learning of axis parallel conceptseccc, (019), 2002. [doi]
- Bounds for the Minimum Disagreement Problem with Applications to Learning Theorycolt 2002: 271-286 [doi]
- PAC learning with nasty noiseTCS, 288(2):255-275, 2002.
- On Using Extended Statistical Queries to Avoid Membership Queriesjmlr, 2:359-395, 2002. [doi]