Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Adam R. Klivans
Adam Klivans
2010 – today
- 2013
[i16]- [i15]Adam Klivans, Raghu Meka: Moment-Matching Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 20: 8 (2013)
- 2012
- [j16]Prahladh Harsha, Adam Klivans, Raghu Meka: An invariance principle for polytopes. J. ACM 59(6): 29 (2012)
- [j15]Parikshit Gopalan, Adam R. Klivans, Raghu Meka: Learning Functions of Halfspaces using Prefix Covers. Journal of Machine Learning Research - Proceedings Track 23: 15.1-15.10 (2012)
- [c32]Eshan Chattopadhyay, Adam Klivans, Pravesh Kothari: An Explicit VC-Theorem for Low-Degree Polynomials. APPROX-RANDOM 2012: 495-504
- [c31]Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular functions are noise stable. SODA 2012: 1586-1592
- [i14]Eshan Chattopadhyay, Adam Klivans, Pravesh Kothari: An Explicit VC-Theorem for Low-Degree Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 19: 127 (2012)
- 2011
- [c30]Parikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda: An FPTAS for #Knapsack and Related Counting Problems. FOCS 2011: 817-826
- [i13]Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular Functions Are Noise Stable. CoRR abs/1106.0518 (2011)
- [i12]Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular Functions Are Noise Stable. Electronic Colloquium on Computational Complexity (ECCC) 18: 90 (2011)
- 2010
- [j14]Adam R. Klivans, Alexander A. Sherstov: Lower Bounds for Agnostic Learning via Approximate Rank. Computational Complexity 19(4): 581-604 (2010)
- [c29]Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. COLT 2010: 368-380
- [c28]Ilias Diakonikolas, Prahladh Harsha, Adam Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan: Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC 2010: 533-542
- [c27]Prahladh Harsha, Adam Klivans, Raghu Meka: An invariance principle for polytopes. STOC 2010: 543-552
- [i11]Parikshit Gopalan, Adam Klivans, Raghu Meka: Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. CoRR abs/1008.3187 (2010)
- [i10]Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. Electronic Colloquium on Computational Complexity (ECCC) 17: 23 (2010)
- [i9]Parikshit Gopalan, Adam Klivans, Raghu Meka: Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 17: 133 (2010)
2000 – 2009
- 2009
- [j13]Adam R. Klivans, Alexander A. Sherstov: Cryptographic hardness for learning intersections of halfspaces. J. Comput. Syst. Sci. 75(1): 2-12 (2009)
- [j12]Lance Fortnow, Adam R. Klivans: Efficient learning algorithms yield circuit lower bounds. J. Comput. Syst. Sci. 75(1): 27-36 (2009)
- [j11]Adam R. Klivans, Philip M. Long, Rocco A. Servedio: Learning Halfspaces with Malicious Noise. Journal of Machine Learning Research 10: 2715-2740 (2009)
- [c26]Adam R. Klivans, Philip M. Long, Alex K. Tang: Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions. APPROX-RANDOM 2009: 588-600
- [c25]Adam R. Klivans, Philip M. Long, Rocco A. Servedio: Learning Halfspaces with Malicious Noise. ICALP (1) 2009: 609-621
- [i8]Prahladh Harsha, Adam Klivans, Raghu Meka: Bounding the Sensitivity of Polynomial Threshold Functions. CoRR abs/0909.5175 (2009)
- [i7]Prahladh Harsha, Adam R. Klivans, Raghu Meka: An Invariance Principle for Polytopes. CoRR abs/0912.4884 (2009)
- [i6]Prahladh Harsha, Adam Klivans, Raghu Meka: An Invariance Principle for Polytopes. Electronic Colloquium on Computational Complexity (ECCC) 16: 144 (2009)
- 2008
- [j10]Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: The complexity of properly learning simple concept classes. J. Comput. Syst. Sci. 74(1): 16-34 (2008)
- [j9]Adam R. Klivans, Rocco A. Servedio: Learning intersections of halfspaces with a margin. J. Comput. Syst. Sci. 74(1): 35-48 (2008)
- [j8]Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. SIAM J. Comput. 37(6): 1777-1805 (2008)
- [c24]Parikshit Gopalan, Adam Kalai, Adam R. Klivans: A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516
- [c23]Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning Geometric Concepts via Gaussian Surface Area. FOCS 2008: 541-550
- [c22]Parikshit Gopalan, Adam R. Klivans, David Zuckerman: List-decoding reed-muller codes over small fields. STOC 2008: 265-274
- [c21]Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans: Agnostically learning decision trees. STOC 2008: 527-536
- [r1]
- 2007
- [j7]Adam R. Klivans, Alexander A. Sherstov: Unconditional lower bounds for learning intersections of halfspaces. Machine Learning 69(2-3): 97-114 (2007)
- [c20]Adam R. Klivans, Alexander A. Sherstov: A Lower Bound for Agnostically Learning Disjunctions. COLT 2007: 409-423
- 2006
- [j6]Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning of Decision Lists and Parities. Journal of Machine Learning Research 7: 587-602 (2006)
- [j5]Adam R. Klivans, Amir Shpilka: Learning Restricted Models of Arithmetic Circuits. Theory of Computing 2(1): 185-206 (2006)
- [c19]Adam R. Klivans, Alexander A. Sherstov: Improved Lower Bounds for Learning Intersections of Halfspaces. COLT 2006: 335-349
- [c18]Lance Fortnow, Adam R. Klivans: Efficient Learning Algorithms Yield Circuit Lower Bounds. COLT 2006: 350-363
- [c17]Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness for Learning Intersections of Halfspaces. FOCS 2006: 553-562
- [c16]
- [i5]Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness Results for Learning Intersections of Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(057) (2006)
- 2005
- [c15]Lance Fortnow, Adam R. Klivans: NP with Small Advice. IEEE Conference on Computational Complexity 2005: 228-234
- [c14]Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. FOCS 2005: 11-20
- [i4]Lance Fortnow, Adam R. Klivans: Linear Advice for Randomized Logarithmic Space. Electronic Colloquium on Computational Complexity (ECCC)(042) (2005)
- 2004
- [j4]Adam R. Klivans, Rocco A. Servedio: Learning DNF in time 2Õ(n1/3). J. Comput. Syst. Sci. 68(2): 303-318 (2004)
- [j3]Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci. 68(4): 808-840 (2004)
- [c13]Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning of Decision Lists and Parities. COLT 2004: 224-238
- [c12]Adam R. Klivans, Rocco A. Servedio: Learning Intersections of Halfspaces with a Margin. COLT 2004: 348-362
- [c11]Adam R. Klivans, Rocco A. Servedio: Perceptron-Like Performance for Intersections of Halfspaces. COLT 2004: 639-640
- [c10]Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: Learnability and Automatizability. FOCS 2004: 621-630
- [i3]Lance Fortnow, Adam R. Klivans: NP with Small Advice. Electronic Colloquium on Computational Complexity (ECCC)(103) (2004)
- 2003
- [j2]Adam R. Klivans, Rocco A. Servedio: Boosting and Hard-Core Set Construction. Machine Learning 51(3): 217-238 (2003)
- [c9]Adam Klivans, Amir Shpilka: Learning Arithmetic Circuits via Partial Derivatives. COLT 2003: 463-476
- [i2]Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning Algorithms. CoRR cs.LG/0311042 (2003)
- 2002
- [j1]Adam Klivans, Dieter van Melkebeek: Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. SIAM J. Comput. 31(5): 1501-1526 (2002)
- [c8]Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio: Learnability beyond AC0. IEEE Conference on Computational Complexity 2002: 26
- [c7]Adam Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning Intersections and Thresholds of Halfspaces. FOCS 2002: 177-186
- [c6]
- 2001
- [c5]
- [c4]Adam Klivans, Daniel A. Spielman: Randomness efficient identity testing of multivariate polynomials. STOC 2001: 216-223
- [c3]
1990 – 1999
- 1999
- [c2]
- [c1]Adam Klivans, Dieter van Melkebeek: Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. STOC 1999: 659-667
- 1998
- [i1]Adam Klivans, Dieter van Melkebeek: Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. Electronic Colloquium on Computational Complexity (ECCC) 5(75) (1998)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-18 21:26 CEST by the dblp team