Vitaly Feldman

	2012
44		Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. STOC 2012: 729-746
43		Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala: The Complexity of Statistical Algorithms CoRR abs/1201.1214: (2012)
42		Vitaly Feldman: Learning DNF Expressions from Fourier Spectrum CoRR abs/1203.0594: (2012)
41		Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao: Statistical Algorithms and a Lower Bound for Planted Clique. Electronic Colloquium on Computational Complexity (ECCC) 19: 64 (2012)
	2011
40		Vitaly Feldman: Distribution-Independent Evolvability of Linear Threshold Functions CoRR abs/1103.4904: (2011)
39		Vitaly Feldman: Distribution-Independent Evolvability of Linear Threshold Functions. Journal of Machine Learning Research - Proceedings Track 19: 253-272 (2011)
38		Vitaly Feldman, Homin K. Lee, Rocco A. Servedio: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. Journal of Machine Learning Research - Proceedings Track 19: 273-292 (2011)
	2010
37		Vitaly Feldman: Distribution-Specific Agnostic Boosting. ICS 2010: 241-250
36		Vitaly Feldman: A Complete Characterization of Statistical Query Learning with Applications to Evolvability CoRR abs/1002.3183: (2010)
35		Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces is Hard CoRR abs/1012.0729: (2010)
34		Vitaly Feldman: A Complete Characterization of Statistical Query Learning with Applications to Evolvability. Electronic Colloquium on Computational Complexity (ECCC) 17: 18 (2010)
33		Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces is Hard. Electronic Colloquium on Computational Complexity (ECCC) 17: 185 (2010)
32		Vitaly Feldman, Homin K. Lee, Rocco A. Servedio: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. Electronic Colloquium on Computational Complexity (ECCC) 17: 22 (2010)
	2009
31		Vitaly Feldman: Robustness of Evolvability. COLT 2009
30		Vitaly Feldman: A Complete Characterization of Statistical Query Learning with Applications to Evolvability. FOCS 2009: 375-384
29		Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu: Agnostic Learning of Monomials by Halfspaces Is Hard. FOCS 2009: 385-394
28		Miklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson: Sorting and Selection with Imprecise Comparisons. ICALP (1) 2009: 37-48
27		Vitaly Feldman: Distribution-Specific Agnostic Boosting CoRR abs/0909.2927: (2009)
26		Vitaly Feldman: Hardness of approximate two-level logic minimization and PAC learning with membership queries. J. Comput. Syst. Sci. 75(1): 13-26 (2009)
25		Vitaly Feldman: On The Power of Membership Queries in Agnostic Learning. Journal of Machine Learning Research 10: 163-182 (2009)
24		Vitaly Feldman, Leslie G. Valiant: Experience-Induced Neural Circuits That Achieve High Capacity. Neural Computation 21(10): 2715-2754 (2009)
23		Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: On Agnostic Learning of Parities, Monomials, and Halfspaces. SIAM J. Comput. 39(2): 606-645 (2009)
22		Vitaly Feldman, Shrenik Shah: Separating models of learning with faulty teachers. Theor. Comput. Sci. 410(19): 1903-1912 (2009)
	2008
21		Vitaly Feldman: On the Power of Membership Queries in Agnostic Learning. COLT 2008: 147-156
20		Vitaly Feldman, Leslie G. Valiant: The Learning Power of Evolution. COLT 2008: 513-514
19		Vitaly Feldman: Evolvability from learning algorithms. STOC 2008: 619-628
18		Vitaly Feldman: Hardness of Proper Learning. Encyclopedia of Algorithms 2008
17		Vitaly Feldman: Statistical Query Learning. Encyclopedia of Algorithms 2008
16		Vitaly Feldman: On The Power of Membership Queries in Agnostic Learning. Electronic Colloquium on Computational Complexity (ECCC) 15(091): (2008)
15		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)
	2007
14		Vitaly Feldman, Shrenik Shah, Neal Wadhwa: Separating Models of Learning with Faulty Teachers. ALT 2007: 94-106
13		Vitaly Feldman: Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions. Journal of Machine Learning Research 8: 1431-1460 (2007)
	2006
12		Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574
11		Vitaly Feldman: Optimal Hardness Results for Maximizing Agreements with Monomials. IEEE Conference on Computational Complexity 2006: 226-236
10		Vitaly Feldman: Hardness of approximate two-level logic minimization and PAC learning with membership queries. STOC 2006: 363-372
9		Vitaly Feldman: Optimal Hardness Results for Maximizing Agreements with Monomials. Electronic Colloquium on Computational Complexity (ECCC) 13(032): (2006)
8		Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(059): (2006)
7		Vitaly Feldman: On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. Electronic Colloquium on Computational Complexity (ECCC) 13(066): (2006)
	2005
6		Vitaly Feldman: On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. COLT 2005: 576-590
5		Vitaly Feldman: Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries Electronic Colloquium on Computational Complexity (ECCC)(127): (2005)
	2004
4		Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi: Learnability and Automatizability. FOCS 2004: 621-630
	2002
3		Nader H. Bshouty, Vitaly Feldman: On Using Extended Statistical Queries to Avoid Membership Queries. Journal of Machine Learning Research 2: 359-395 (2002)
	2001
2		Nader H. Bshouty, Vitaly Feldman: On Using Extended Statistical Queries to Avoid Membership Queries. COLT/EuroCOLT 2001: 529-545
	2000
1		Ayal Zaks, Vitaly Feldman, Nava Aizikowitz: Sealed calls in Java packages. OOPSLA 2000: 83-92

Coauthor Index

1	Nava Aizikowitz	[1]
2	Miklós Ajtai	[28]
3	Michael Alekhnovich	[4] [15]
4	Mark Braverman	[4] [15]
5	Nader H. Bshouty	[2] [3]
6	Anindya De	[44]
7	Ilias Diakonikolas	[44]
8	Parikshit Gopalan	[8] [12] [23]
9	Elena Grigorescu	[41] [43]
10	Venkatesan Guruswami	[29] [33] [35]
11	Avinatan Hassidim	[28]
12	Subhash Khot	[8] [12] [23]
13	Adam R. Klivans (Adam Klivans)	[4] [15]
14	Homin K. Lee	[32] [38]
15	Jelani Nelson	[28]
16	Toniann Pitassi	[4] [15]
17	Ashok Kumar Ponnuswami	[8] [12] [23]
18	Prasad Raghavendra	[29] [33] [35]
19	Lev Reyzin	[41] [43]
20	Rocco A. Servedio	[32] [38] [44]
21	Shrenik Shah	[14] [22]
22	Leslie G. Valiant	[20] [24]
23	Santosh Vempala	[41] [43]
24	Neal Wadhwa	[14]
25	Yi Wu	[29] [33] [35]
26	Ying Xiao (Xiao Ying)	[41]
27	Ayal Zaks	[1]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page