Adam R. Klivans

Adam Klivans

	2012
59		Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular functions are noise stable. SODA 2012: 1586-1592
	2011
58		Parikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda: An FPTAS for #Knapsack and Related Counting Problems. FOCS 2011: 817-826
57		Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular Functions Are Noise Stable CoRR abs/1106.0518: (2011)
56		Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular Functions Are Noise Stable. Electronic Colloquium on Computational Complexity (ECCC) 18: 90 (2011)
	2010
55		Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. COLT 2010: 368-380
54		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
53		Prahladh Harsha, Adam Klivans, Raghu Meka: An invariance principle for polytopes. STOC 2010: 543-552
52		Parikshit Gopalan, Adam Klivans, Raghu Meka: Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs CoRR abs/1008.3187: (2010)
51		Adam R. Klivans, Alexander A. Sherstov: Lower Bounds for Agnostic Learning via Approximate Rank. Computational Complexity 19(4): 581-604 (2010)
50		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)
49		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)
	2009
48		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
47		Adam R. Klivans, Philip M. Long, Rocco A. Servedio: Learning Halfspaces with Malicious Noise. ICALP (1) 2009: 609-621
46		Prahladh Harsha, Adam Klivans, Raghu Meka: Bounding the Sensitivity of Polynomial Threshold Functions CoRR abs/0909.5175: (2009)
45		Prahladh Harsha, Adam R. Klivans, Raghu Meka: An Invariance Principle for Polytopes CoRR abs/0912.4884: (2009)
44		Prahladh Harsha, Adam Klivans, Raghu Meka: An Invariance Principle for Polytopes. Electronic Colloquium on Computational Complexity (ECCC) 16: 144 (2009)
43		Adam R. Klivans, Alexander A. Sherstov: Cryptographic hardness for learning intersections of halfspaces. J. Comput. Syst. Sci. 75(1): 2-12 (2009)
42		Lance Fortnow, Adam R. Klivans: Efficient learning algorithms yield circuit lower bounds. J. Comput. Syst. Sci. 75(1): 27-36 (2009)
41		Adam R. Klivans, Philip M. Long, Rocco A. Servedio: Learning Halfspaces with Malicious Noise. Journal of Machine Learning Research 10: 2715-2740 (2009)
	2008
40		Parikshit Gopalan, Adam Kalai, Adam R. Klivans: A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516
39		Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning Geometric Concepts via Gaussian Surface Area. FOCS 2008: 541-550
38		Parikshit Gopalan, Adam R. Klivans, David Zuckerman: List-decoding reed-muller codes over small fields. STOC 2008: 265-274
37		Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans: Agnostically learning decision trees. STOC 2008: 527-536
36		Adam Klivans: Cryptographic Hardness of Learning. Encyclopedia of Algorithms 2008
35		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		Adam R. Klivans, Rocco A. Servedio: Learning intersections of halfspaces with a margin. J. Comput. Syst. Sci. 74(1): 35-48 (2008)
33		Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. SIAM J. Comput. 37(6): 1777-1805 (2008)
	2007
32		Adam R. Klivans, Alexander A. Sherstov: A Lower Bound for Agnostically Learning Disjunctions. COLT 2007: 409-423
31		Adam R. Klivans, Alexander A. Sherstov: Unconditional lower bounds for learning intersections of halfspaces. Machine Learning 69(2-3): 97-114 (2007)
	2006
30		Adam R. Klivans, Alexander A. Sherstov: Improved Lower Bounds for Learning Intersections of Halfspaces. COLT 2006: 335-349
29		Lance Fortnow, Adam R. Klivans: Efficient Learning Algorithms Yield Circuit Lower Bounds. COLT 2006: 350-363
28		Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness for Learning Intersections of Halfspaces. FOCS 2006: 553-562
27		Lance Fortnow, Adam R. Klivans: Linear Advice for Randomized Logarithmic Space. STACS 2006: 469-476
26		Adam R. Klivans, Alexander A. Sherstov: Cryptographic Hardness Results for Learning Intersections of Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(057): (2006)
25		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		Adam R. Klivans, Amir Shpilka: Learning Restricted Models of Arithmetic Circuits. Theory of Computing 2(1): 185-206 (2006)
	2005
23		Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. FOCS 2005: 11-20
22		Lance Fortnow, Adam R. Klivans: NP with Small Advice. IEEE Conference on Computational Complexity 2005: 228-234
21		Lance Fortnow, Adam R. Klivans: Linear Advice for Randomized Logarithmic Space Electronic Colloquium on Computational Complexity (ECCC)(042): (2005)
	2004
20		Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning of Decision Lists and Parities. COLT 2004: 224-238
19		Adam R. Klivans, Rocco A. Servedio: Learning Intersections of Halfspaces with a Margin. COLT 2004: 348-362
18		Adam R. Klivans, Rocco A. Servedio: Perceptron-Like Performance for Intersections of Halfspaces. COLT 2004: 639-640
17		Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: Learnability and Automatizability. FOCS 2004: 621-630
16		Lance Fortnow, Adam R. Klivans: NP with Small Advice Electronic Colloquium on Computational Complexity (ECCC)(103): (2004)
15		Adam R. Klivans, Rocco A. Servedio: Learning DNF in time 2Õ(n1/3). J. Comput. Syst. Sci. 68(2): 303-318 (2004)
14		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		Adam Klivans, Amir Shpilka: Learning Arithmetic Circuits via Partial Derivatives. COLT 2003: 463-476
12		Adam R. Klivans, Rocco A. Servedio: Toward Attribute Efficient Learning Algorithms CoRR cs.LG/0311042: (2003)
11		Adam R. Klivans, Rocco A. Servedio: Boosting and Hard-Core Set Construction. Machine Learning 51(3): 217-238 (2003)
	2002
10		Adam Klivans, Ryan O'Donnell, Rocco A. Servedio: Learning Intersections and Thresholds of Halfspaces. FOCS 2002: 177-186
9		Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio: Learnability beyond AC0. IEEE Conference on Computational Complexity 2002: 26
8		Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio: Learnability beyond AC0. STOC 2002: 776-784
7		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		Adam Klivans: On the Derandomization of Constant Depth Circuits. RANDOM-APPROX 2001: 249-260
5		Adam Klivans, Daniel A. Spielman: Randomness efficient identity testing of multivariate polynomials. STOC 2001: 216-223
4		Adam Klivans, Rocco A. Servedio: Learning DNF in time 2Õ(n1/3). STOC 2001: 258-265
	1999
3		Adam Klivans, Rocco A. Servedio: Boosting and Hard-Core Sets. FOCS 1999: 624-633
2		Adam Klivans, Dieter van Melkebeek: Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. STOC 1999: 659-667
	1998
1		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	Mahdi Cheraghchi	[56] [57] [59]
4	Ilias Diakonikolas	[54]
5	Vitaly Feldman	[17] [35]
6	Lance Fortnow	[16] [21] [22] [27] [29] [42]
7	Parikshit Gopalan	[37] [38] [40] [50] [52] [58]
8	Prahladh Harsha	[44] [45] [46] [53] [54]
9	Jeffrey C. Jackson	[8] [9]
10	Adam Tauman Kalai (Adam Kalai)	[23] [33] [37] [40]
11	Pravesh Kothari	[56] [57] [59]
12	Homin K. Lee	[49] [55] [56] [57] [59]
13	Philip M. Long	[41] [47] [48]
14	Yishay Mansour	[23] [33]
15	Raghu Meka	[44] [45] [46] [50] [52] [53] [54] [58]
16	Dieter van Melkebeek	[1] [2] [7]
17	Ryan O'Donnell	[10] [14] [39]
18	Toniann Pitassi	[17] [35]
19	Prasad Raghavendra	[54]
20	Rocco A. Servedio	[3] [4] [8] [9] [10] [11] [12] [14] [15] [18] [19] [20] [23] [25] [33] [34] [39] [41] [47] [54]
21	Alexander A. Sherstov	[26] [28] [30] [31] [32] [43] [51]
22	Amir Shpilka	[13] [24]
23	Daniel A. Spielman	[5]
24	Daniel Stefankovic	[58]
25	Li-Yang Tan	[54]
26	Alex K. Tang	[48]
27	Santosh Vempala	[58]
28	Eric Vigoda	[58]
29	Andrew Wan	[49] [55]
30	David Zuckerman	[38]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page