The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio
    Learnability beyond AC0. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:26- [Conf]
  2. Adam Klivans, Amir Shpilka
    Learning Arithmetic Circuits via Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:463-476 [Conf]
  3. Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
    Learning Intersections and Thresholds of Halfspaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:177-186 [Conf]
  4. Adam Klivans, Rocco A. Servedio
    Boosting and Hard-Core Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:624-633 [Conf]
  5. Adam Klivans
    On the Derandomization of Constant Depth Circuits. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:249-260 [Conf]
  6. Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio
    Learnability beyond AC0. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:776-784 [Conf]
  7. Adam Klivans, Dieter van Melkebeek
    Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:659-667 [Conf]
  8. Adam Klivans, Daniel A. Spielman
    Randomness efficient identity testing of multivariate polynomials. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:216-223 [Conf]
  9. Adam Klivans, Rocco A. Servedio
    Learning DNF in time 2Õ(n1/3). [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:258-265 [Conf]
  10. Adam Klivans, Dieter van Melkebeek
    Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1501-1526 [Journal]

  11. An invariance principle for polytopes. [Citation Graph (, )][DBLP]


  12. Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. [Citation Graph (, )][DBLP]


  13. Bounding the Sensitivity of Polynomial Threshold Functions [Citation Graph (, )][DBLP]


  14. Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs [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