Adam R. Klivans

Adam Klivans

2009
42	EE	Adam R. Klivans, Alexander A. Sherstov: Cryptographic hardness for learning intersections of halfspaces. J. Comput. Syst. Sci. 75(1): 2-12 (2009)
41	EE	Lance Fortnow, Adam R. Klivans: Efficient learning algorithms yield circuit lower bounds. J. Comput. Syst. Sci. 75(1): 27-36 (2009)
2008
40	EE	Parikshit Gopalan, Adam Kalai, Adam R. Klivans: A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516
39	EE	Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning Geometric Concepts via Gaussian Surface Area. FOCS 2008: 541-550
38	EE	Parikshit Gopalan, Adam R. Klivans, David Zuckerman: List-decoding reed-muller codes over small fields. STOC 2008: 265-274
37	EE	Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans: Agnostically learning decision trees. STOC 2008: 527-536
36	EE	Adam Klivans: Cryptographic Hardness of Learning. Encyclopedia of Algorithms 2008
35	EE	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)
34	EE	Adam R. Klivans, Rocco A. Servedio: Learning intersections of halfspaces with a margin. J. Comput. Syst. Sci. 74(1): 35-48 (2008)
33	EE	Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. SIAM J. Comput. 37(6): 1777-1805 (2008)
2007
32	EE	Adam R. Klivans, Alexander A. Sherstov: A Lower Bound for Agnostically Learning Disjunctions. COLT 2007: 409-423
31	EE	Adam R. Klivans, Alexander A. Sherstov: Unconditional lower bounds for learning intersections of halfspaces. Machine Learning 69(2-3): 97-114 (2007)
2006
30	EE	Adam R. Klivans, Alexander A. Sherstov: Improved Lower Bounds for Learning Intersections of Halfspaces. COLT 2006: 335-349
29	EE	Lance Fortnow, Adam R. Klivans: Efficient Learning Algorithms Yield Circuit Lower Bounds. COLT 2006: 350-363
28	EE	Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness for Learning Intersections of Halfspaces. FOCS 2006: 553-562
27	EE	Lance Fortnow, Adam R. Klivans: Linear Advice for Randomized Logarithmic Space. STACS 2006: 469-476
26	EE	Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness Results for Learning Intersections of Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(057): (2006)
25	EE	Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning of Decision Lists and Parities. Journal of Machine Learning Research 7: 587-602 (2006)
24	EE	Adam R. Klivans, Amir Shpilka: Learning Restricted Models of Arithmetic Circuits. Theory of Computing 2(1): 185-206 (2006)
2005
23	EE	Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. FOCS 2005: 11-20
22	EE	Lance Fortnow, Adam R. Klivans: NP with Small Advice. IEEE Conference on Computational Complexity 2005: 228-234
21	EE	Lance Fortnow, Adam R. Klivans: Linear Advice for Randomized Logarithmic Space Electronic Colloquium on Computational Complexity (ECCC)(042): (2005)
2004
20	EE	Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning of Decision Lists and Parities. COLT 2004: 224-238
19	EE	Adam R. Klivans, Rocco A. Servedio: Learning Intersections of Halfspaces with a Margin. COLT 2004: 348-362
18	EE	Adam R. Klivans, Rocco A. Servedio: Perceptron-Like Performance for Intersections of Halfspaces. COLT 2004: 639-640
17	EE	Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: Learnability and Automatizability. FOCS 2004: 621-630
16	EE	Lance Fortnow, Adam R. Klivans: NP with Small Advice Electronic Colloquium on Computational Complexity (ECCC)(103): (2004)
15	EE	Adam R. Klivans, Rocco A. Servedio: Learning DNF in time 2Õ(n1/3). J. Comput. Syst. Sci. 68(2): 303-318 (2004)
14	EE	Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci. 68(4): 808-840 (2004)
2003
13	EE	Adam Klivans, Amir Shpilka: Learning Arithmetic Circuits via Partial Derivatives. COLT 2003: 463-476
12	EE	Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning Algorithms CoRR cs.LG/0311042: (2003)
11	EE	Adam R. Klivans, Rocco A. Servedio: Boosting and Hard-Core Set Construction. Machine Learning 51(3): 217-238 (2003)
2002
10	EE	Adam Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning Intersections and Thresholds of Halfspaces. FOCS 2002: 177-186
9	EE	Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio: Learnability beyond AC0. IEEE Conference on Computational Complexity 2002: 26
8	EE	Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio: Learnability beyond AC0. STOC 2002: 776-784
7	EE	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)
2001
6	EE	Adam Klivans: On the Derandomization of Constant Depth Circuits. RANDOM-APPROX 2001: 249-260
5	EE	Adam Klivans, Daniel A. Spielman: Randomness efficient identity testing of multivariate polynomials. STOC 2001: 216-223
4	EE	Adam Klivans, Rocco A. Servedio: Learning DNF in time 2Õ(n1/3). STOC 2001: 258-265
1999
3	EE	Adam Klivans, Rocco A. Servedio: Boosting and Hard-Core Sets. FOCS 1999: 624-633
2	EE	Adam Klivans, Dieter van Melkebeek: Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. STOC 1999: 659-667
1998
1	EE	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

1	Michael Alekhnovich	[17] [35]
2	Mark Braverman	[17] [35]
3	Vitaly Feldman	[17] [35]
4	Lance Fortnow	[16] [21] [22] [27] [29] [41]
5	Parikshit Gopalan	[37] [38] [40]
6	Jeffrey C. Jackson	[8] [9]
7	Adam Tauman Kalai (Adam Kalai)	[23] [33] [37] [40]
8	Yishay Mansour	[23] [33]
9	Dieter van Melkebeek	[1] [2] [7]
10	Ryan O'Donnell	[10] [14] [39]
11	Toniann Pitassi	[17] [35]
12	Rocco A. Servedio	[3] [4] [8] [9] [10] [11] [12] [14] [15] [18] [19] [20] [23] [25] [33] [34] [39]
13	Alexander A. Sherstov	[26] [28] [30] [31] [32] [42]
14	Amir Shpilka	[13] [24]
15	Daniel A. Spielman	[5]
16	David Zuckerman	[38]

Colors in the list of coauthors