Adam Klivans
Adam Klivans
Professor of Computer Science, University of Texas at Austin
Verified email at cs.utexas.edu
TitleCited byYear
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
AR Klivans, D Van Melkebeek
SIAM Journal on Computing 31 (5), 1501-1526, 2002
2482002
Agnostically learning halfspaces
AT Kalai, AR Klivans, Y Mansour, RA Servedio
SIAM Journal on Computing 37 (6), 1777-1805, 2008
2082008
Learning DNF in time 2O (n1/3)
AR Klivans, RA Servedio
Journal of Computer and System Sciences 68 (2), 303-318, 2004
1932004
Randomness efficient identity testing of multivariate polynomials
AR Klivans, D Spielman
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
1812001
Learning intersections and thresholds of halfspaces
AR Klivans, R O'Donnell, RA Servedio
Journal of Computer and System Sciences 68 (4), 808-840, 2004
1622004
Cryptographic hardness for learning intersections of halfspaces
AR Klivans, AA Sherstov
Journal of Computer and System Sciences 75 (1), 2-12, 2009
1212009
Learning geometric concepts via Gaussian surface area
AR Klivans, R O'Donnell, RA Servedio
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 541-550, 2008
692008
List-decoding Reed-Muller codes over small fields
P Gopalan, AR Klivans, D Zuckerman
Proceedings of the fortieth annual ACM symposium on Theory of computing, 265-274, 2008
672008
Learnability beyond AC0
JC Jackson, AR Klivans, RA Servedio
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
652002
Boosting and hard-core sets
AR Klivans, RA Servedio
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
591999
An FPTAS for# knapsack and related counting problems
P Gopalan, A Klivans, R Meka, D Štefankovic, S Vempala, E Vigoda
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 817-826, 2011
572011
Learning halfspaces with malicious noise
AR Klivans, PM Long, RA Servedio
Journal of Machine Learning Research 10 (Dec), 2715-2740, 2009
562009
Reliably learning the relu in polynomial time
S Goel, V Kanade, A Klivans, J Thaler
arXiv preprint arXiv:1611.10258, 2016
522016
Learning restricted models of arithmetic circuits
A Klivans, A Shpilka
Theory of computing 2 (1), 185-206, 2006
51*2006
Toward attribute efficient learning of decision lists and parities
AR Klivans, RA Servedio
Journal of Machine Learning Research 7 (Apr), 587-602, 2006
502006
Agnostically learning decision trees
P Gopalan, AT Kalai, AR Klivans
Proceedings of the fortieth annual ACM symposium on Theory of computing, 527-536, 2008
492008
Learnability and automatizability
M Alekhnovich, M Braverman, V Feldman, AR Klivans, T Pitassi
45th Annual IEEE Symposium on Foundations of Computer Science, 621-630, 2004
472004
Submodular functions are noise stable
M Cheraghchi, A Klivans, P Kothari, HK Lee
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
462012
Efficient algorithms for outlier-robust regression
A Klivans, PK Kothari, R Meka
arXiv preprint arXiv:1803.03241, 2018
432018
Lower bounds for agnostic learning via approximate rank
AR Klivans, AA Sherstov
Computational Complexity 19 (4), 581-604, 2010
42*2010
The system can't perform the operation now. Try again later.
Articles 1–20