| 2009 |
|---|
| 22 | EE | Vitaly Feldman:
Hardness of approximate two-level logic minimization and PAC learning with membership queries.
J. Comput. Syst. Sci. 75(1): 13-26 (2009) |
| 21 | EE | Vitaly Feldman,
Shrenik Shah:
Separating models of learning with faulty teachers.
Theor. Comput. Sci. 410(19): 1903-1912 (2009) |
| 2008 |
|---|
| 20 | EE | Vitaly Feldman:
On the Power of Membership Queries in Agnostic Learning.
COLT 2008: 147-156 |
| 19 | EE | Vitaly Feldman,
Leslie G. Valiant:
The Learning Power of Evolution.
COLT 2008: 513-514 |
| 18 | EE | Vitaly Feldman:
Evolvability from learning algorithms.
STOC 2008: 619-628 |
| 17 | EE | Vitaly Feldman:
Hardness of Proper Learning.
Encyclopedia of Algorithms 2008 |
| 16 | EE | Vitaly Feldman:
Statistical Query Learning.
Encyclopedia of Algorithms 2008 |
| 15 | EE | Vitaly Feldman:
On The Power of Membership Queries in Agnostic Learning.
Electronic Colloquium on Computational Complexity (ECCC) 15(091): (2008) |
| 14 | 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) |
| 2007 |
|---|
| 13 | EE | Vitaly Feldman,
Shrenik Shah,
Neal Wadhwa:
Separating Models of Learning with Faulty Teachers.
ALT 2007: 94-106 |
| 2006 |
|---|
| 12 | EE | Vitaly Feldman,
Parikshit Gopalan,
Subhash Khot,
Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces.
FOCS 2006: 563-574 |
| 11 | EE | Vitaly Feldman:
Optimal Hardness Results for Maximizing Agreements with Monomials.
IEEE Conference on Computational Complexity 2006: 226-236 |
| 10 | EE | Vitaly Feldman:
Hardness of approximate two-level logic minimization and PAC learning with membership queries.
STOC 2006: 363-372 |
| 9 | EE | Vitaly Feldman:
Optimal Hardness Results for Maximizing Agreements with Monomials.
Electronic Colloquium on Computational Complexity (ECCC) 13(032): (2006) |
| 8 | EE | 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 | EE | 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 | EE | Vitaly Feldman:
On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions.
COLT 2005: 576-590 |
| 5 | EE | 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 | EE | Michael Alekhnovich,
Mark Braverman,
Vitaly Feldman,
Adam R. Klivans,
Toniann Pitassi:
Learnability and Automatizability.
FOCS 2004: 621-630 |
| 2002 |
|---|
| 3 | EE | 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 | EE | Nader H. Bshouty,
Vitaly Feldman:
On Using Extended Statistical Queries to Avoid Membership Queries.
COLT/EuroCOLT 2001: 529-545 |
| 2000 |
|---|
| 1 | EE | Ayal Zaks,
Vitaly Feldman,
Nava Aizikowitz:
Sealed calls in Java packages.
OOPSLA 2000: 83-92 |
