| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee |
Submodular functions are noise stable.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee |
Submodular Functions Are Noise Stable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee |
Submodular Functions Are Noise Stable |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda |
An FPTAS for #Knapsack and Related Counting Problems. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Klivans, Raghu Meka |
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function |
| 1 | Prahladh Harsha, Adam Klivans, Raghu Meka |
An invariance principle for polytopes. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
average sensitivity, invariance principles, polytopes, pseudorandom generators, contingency tables, noise sensitivity, limit theorems, agnostic learning |
| 1 | Adam R. Klivans, Homin K. Lee, Andrew Wan |
Mansour's Conjecture is True for Random DNF Formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Alexander A. Sherstov |
Lower Bounds for Agnostic Learning via Approximate Rank. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Homin K. Lee, Andrew Wan |
Mansour's Conjecture is True for Random DNF Formulas. |
COLT |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prahladh Harsha, Adam Klivans, Raghu Meka |
An Invariance Principle for Polytopes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Prahladh Harsha, Adam Klivans, Raghu Meka |
Bounding the Sensitivity of Polynomial Threshold Functions |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Philip M. Long, Rocco A. Servedio |
Learning Halfspaces with Malicious Noise. |
Journal of Machine Learning Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Adam R. Klivans, Raghu Meka |
An Invariance Principle for Polytopes |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Alexander A. Sherstov |
Cryptographic hardness for learning intersections of halfspaces. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Adam R. Klivans |
Efficient learning algorithms yield circuit lower bounds. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Philip M. Long, Rocco A. Servedio |
Learning Halfspaces with Malicious Noise. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans |
Cryptographic Hardness of Learning. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
The complexity of properly learning simple concept classes. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Rocco A. Servedio |
Learning intersections of halfspaces with a margin. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio |
Agnostically Learning Halfspaces. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Kalai, Adam R. Klivans |
A Query Algorithm for Agnostically Learning DNF?. |
COLT |
2008 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio |
Learning Geometric Concepts via Gaussian Surface Area. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans |
Agnostically learning decision trees. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
learning in the presence of noise, decision trees, agnostic learning |
| 1 | Parikshit Gopalan, Adam R. Klivans, David Zuckerman |
List-decoding reed-muller codes over small fields. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
fitting polynomials, self-correctors, reed-muller codes, list-decoding |
| 1 | Adam R. Klivans, Alexander A. Sherstov |
Unconditional lower bounds for learning intersections of halfspaces. |
Machine Learning |
2007 |
DBLP DOI BibTeX RDF |
Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions |
| 1 | Adam R. Klivans, Alexander A. Sherstov |
A Lower Bound for Agnostically Learning Disjunctions. |
COLT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Alexander A. Sherstov |
Cryptographic Hardness Results for Learning Intersections of Halfspaces. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Amir Shpilka |
Learning Restricted Models of Arithmetic Circuits. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Rocco A. Servedio |
Toward Attribute Efficient Learning of Decision Lists and Parities. |
Journal of Machine Learning Research |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lance Fortnow, Adam R. Klivans |
Linear Advice for Randomized Logarithmic Space. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Adam R. Klivans |
Efficient Learning Algorithms Yield Circuit Lower Bounds. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Alexander A. Sherstov |
Improved Lower Bounds for Learning Intersections of Halfspaces. |
COLT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Alexander A. Sherstov |
Cryptographic Hardness for Learning Intersections of Halfspaces. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Adam R. Klivans |
Linear Advice for Randomized Logarithmic Space |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio |
Agnostically Learning Halfspaces. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Adam R. Klivans |
NP with Small Advice. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Adam R. Klivans |
NP with Small Advice |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Rocco A. Servedio |
Learning DNF in time 2Õ(n1/3). |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio |
Learning intersections and thresholds of halfspaces. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Rocco A. Servedio |
Learning Intersections of Halfspaces with a Margin. |
COLT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Rocco A. Servedio |
Perceptron-Like Performance for Intersections of Halfspaces. |
COLT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam R. Klivans, Rocco A. Servedio |
Toward Attribute Efficient Learning of Decision Lists and Parities. |
COLT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi |
Learnability and Automatizability. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Amir Shpilka |
Learning Arithmetic Circuits via Partial Derivatives. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
learning with queries, PAC learning |
| 1 | Adam R. Klivans, Rocco A. Servedio |
Boosting and Hard-Core Set Construction. |
Machine Learning |
2003 |
DBLP DOI BibTeX RDF |
hard core set construction, computational complexity, boosting |
| 1 | Adam R. Klivans, Rocco A. Servedio |
Toward Attribute Efficient Learning Algorithms |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Adam Klivans, Dieter van Melkebeek |
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Ryan O'Donnell, Rocco A. Servedio |
Learning Intersections and Thresholds of Halfspaces. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio |
Learnability beyond AC0. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio |
Learnability beyond AC0. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans |
On the Derandomization of Constant Depth Circuits. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Daniel A. Spielman |
Randomness efficient identity testing of multivariate polynomials. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Rocco A. Servedio |
Learning DNF in time 2Õ(n1/3). |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Rocco A. Servedio |
Boosting and Hard-Core Sets. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Dieter van Melkebeek |
Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Dieter van Melkebeek |
Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")