The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adam R. Klivans: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lance Fortnow, Adam R. Klivans
    NP with Small Advice. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:228-234 [Conf]
  2. Lance Fortnow, Adam R. Klivans
    Efficient Learning Algorithms Yield Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:350-363 [Conf]
  3. Adam R. Klivans, Rocco A. Servedio
    Learning Intersections of Halfspaces with a Margin. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:348-362 [Conf]
  4. Adam R. Klivans, Rocco A. Servedio
    Perceptron-Like Performance for Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:639-640 [Conf]
  5. Adam R. Klivans, Rocco A. Servedio
    Toward Attribute Efficient Learning of Decision Lists and Parities. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:224-238 [Conf]
  6. Adam R. Klivans, Alexander A. Sherstov
    Improved Lower Bounds for Learning Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:335-349 [Conf]
  7. 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]
  8. Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio
    Agnostically Learning Halfspaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:11-20 [Conf]
  9. Adam R. Klivans, Alexander A. Sherstov
    Cryptographic Hardness for Learning Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:553-562 [Conf]
  10. Lance Fortnow, Adam R. Klivans
    Linear Advice for Randomized Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:469-476 [Conf]
  11. Adam R. Klivans, Rocco A. Servedio
    Toward Attribute Efficient Learning Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  12. Lance Fortnow, Adam R. Klivans
    NP with Small Advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:103, pp:- [Journal]
  13. Lance Fortnow, Adam R. Klivans
    Linear Advice for Randomized Logarithmic Space [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:042, pp:- [Journal]
  14. Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
    Learning intersections and thresholds of halfspaces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:808-840 [Journal]
  15. Adam R. Klivans, Rocco A. Servedio
    Learning DNF in time 2Õ(n1/3). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:303-318 [Journal]
  16. Adam R. Klivans, Rocco A. Servedio
    Toward Attribute Efficient Learning of Decision Lists and Parities. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2006, v:7, n:, pp:587-602 [Journal]
  17. Adam R. Klivans, Rocco A. Servedio
    Boosting and Hard-Core Set Construction. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2003, v:51, n:3, pp:217-238 [Journal]
  18. Adam R. Klivans, Alexander A. Sherstov
    A Lower Bound for Agnostically Learning Disjunctions. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:409-423 [Conf]

  19. Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions. [Citation Graph (, )][DBLP]


  20. A Query Algorithm for Agnostically Learning DNF?. [Citation Graph (, )][DBLP]


  21. Learning Geometric Concepts via Gaussian Surface Area. [Citation Graph (, )][DBLP]


  22. Learning Halfspaces with Malicious Noise. [Citation Graph (, )][DBLP]


  23. List-decoding reed-muller codes over small fields. [Citation Graph (, )][DBLP]


  24. Agnostically learning decision trees. [Citation Graph (, )][DBLP]


  25. An Invariance Principle for Polytopes [Citation Graph (, )][DBLP]


  26. Cryptographic Hardness Results for Learning Intersections of Halfspaces. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.020secs
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