The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vitaly Feldman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vitaly Feldman
    Optimal Hardness Results for Maximizing Agreements with Monomials. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:226-236 [Conf]
  2. Nader H. Bshouty, Vitaly Feldman
    On Using Extended Statistical Queries to Avoid Membership Queries. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:529-545 [Conf]
  3. Vitaly Feldman
    On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:576-590 [Conf]
  4. Michael Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi
    Learnability and Automatizability. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:621-630 [Conf]
  5. Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami
    New Results for Learning Noisy Parities and Halfspaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:563-574 [Conf]
  6. Ayal Zaks, Vitaly Feldman, Nava Aizikowitz
    Sealed calls in Java packages. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2000, pp:83-92 [Conf]
  7. Vitaly Feldman
    Hardness of approximate two-level logic minimization and PAC learning with membership queries. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:363-372 [Conf]
  8. Vitaly Feldman
    Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:127, pp:- [Journal]
  9. Nader H. Bshouty, Vitaly Feldman
    On Using Extended Statistical Queries to Avoid Membership Queries. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2002, v:2, n:, pp:359-395 [Journal]
  10. Vitaly Feldman, Shrenik Shah, Neal Wadhwa
    Separating Models of Learning with Faulty Teachers. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:94-106 [Conf]

  11. The Learning Power of Evolution. [Citation Graph (, )][DBLP]


  12. On the Power of Membership Queries in Agnostic Learning. [Citation Graph (, )][DBLP]


  13. A Complete Characterization of Statistical Query Learning with Applications to Evolvability. [Citation Graph (, )][DBLP]


  14. Agnostic Learning of Monomials by Halfspaces Is Hard. [Citation Graph (, )][DBLP]


  15. Sorting and Selection with Imprecise Comparisons. [Citation Graph (, )][DBLP]


  16. Evolvability from learning algorithms. [Citation Graph (, )][DBLP]


  17. Distribution-Specific Agnostic Boosting. [Citation Graph (, )][DBLP]


  18. Distribution-Specific Agnostic Boosting [Citation Graph (, )][DBLP]


  19. A Complete Characterization of Statistical Query Learning with Applications to Evolvability [Citation Graph (, )][DBLP]


  20. On The Power of Membership Queries in Agnostic Learning. [Citation Graph (, )][DBLP]


  21. New Results for Learning Noisy Parities and Halfspaces. [Citation Graph (, )][DBLP]


  22. Optimal Hardness Results for Maximizing Agreements with Monomials. [Citation Graph (, )][DBLP]


  23. On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002