The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rocco A. Servedio: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alp Atici, Rocco A. Servedio
    Learning Unions of omega(1)-Dimensional Rectangles. [Citation Graph (0, 0)][DBLP]
    ALT, 2006, pp:32-47 [Conf]
  2. Rocco A. Servedio
    On Learning Embedded Midbit Functions. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:69-82 [Conf]
  3. Jeffrey C. Jackson, Rocco A. Servedio
    On Learning Random DNF Formulas Under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:342-353 [Conf]
  4. Rocco A. Servedio
    Every Linear Threshold Function has a Low-Weight Approximator. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:18-32 [Conf]
  5. 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]
  6. Ryan O'Donnell, Rocco A. Servedio
    Extremal properties of polynomial threshold functions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:3-12 [Conf]
  7. Ryan O'Donnell, Rocco A. Servedio
    Learning Monotone Decision Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:213-225 [Conf]
  8. Rocco A. Servedio, Steven J. Gortler
    Quantum versus Classical Learnability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:138-148 [Conf]
  9. Marta Arias, Roni Khardon, Rocco A. Servedio
    Polynomial Certificates for Propositional Classes. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:537-551 [Conf]
  10. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
    Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:637-651 [Conf]
  11. Jon Feldman, Rocco A. Servedio, Ryan O'Donnell
    PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:20-34 [Conf]
  12. Jeffrey C. Jackson, Rocco A. Servedio
    Learning Random Log-Depth Decision Trees under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:610-624 [Conf]
  13. Roni Khardon, Rocco A. Servedio
    Maximum Margin Algorithms with Boolean Kernels. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:87-101 [Conf]
  14. Adam R. Klivans, Rocco A. Servedio
    Learning Intersections of Halfspaces with a Margin. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:348-362 [Conf]
  15. Adam R. Klivans, Rocco A. Servedio
    Perceptron-Like Performance for Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:639-640 [Conf]
  16. 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]
  17. Homin K. Lee, Rocco A. Servedio, Andrew Wan
    DNF Are Teachable in the Average Case. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:214-228 [Conf]
  18. Philip M. Long, Rocco A. Servedio
    Martingale Boosting. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:79-94 [Conf]
  19. Philip M. Long, Rocco A. Servedio
    Discriminative Learning Can Succeed Where Generative Learning Fails. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:319-334 [Conf]
  20. Rocco A. Servedio
    PAC Analogues of Perceptron and Winnow via Boosting the Margin. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:148-157 [Conf]
  21. Rocco A. Servedio
    Smooth Boosting and Learning with Malicious Noise. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:473-489 [Conf]
  22. Rocco A. Servedio
    On Learning Monotone DNF under Product Distributions. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:558-573 [Conf]
  23. Rocco A. Servedio
    On PAC Learning Using Winnow, Perceptron, and a Perceptron-like Algorithm. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:296-307 [Conf]
  24. Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning DNF from Random Walks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:189-0 [Conf]
  25. 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]
  26. 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]
  27. Adam Klivans, Rocco A. Servedio
    Boosting and Hard-Core Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:624-633 [Conf]
  28. Ryan O'Donnell, Michael E. Saks, Oded Schramm, Rocco A. Servedio
    Every decision tree has an in.uential variable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:31-39 [Conf]
  29. Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
    Learning mixtures of product distributions over discrete domains. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:501-510 [Conf]
  30. Rocco A. Servedio
    Separating Quantum and Classical Learning. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1065-1080 [Conf]
  31. Philip M. Long, Vinay Varadan, Sarah Gilman, Mark Treshock, Rocco A. Servedio
    Unsupervised evidence integration. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:521-528 [Conf]
  32. Roni Khardon, Dan Roth, Rocco A. Servedio
    Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 2001, pp:423-430 [Conf]
  33. Jeffrey C. Jackson, Adam Klivans, Rocco A. Servedio
    Learnability beyond AC0. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:776-784 [Conf]
  34. Adam Kalai, Rocco A. Servedio
    Boosting in the presence of noise. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:195-205 [Conf]
  35. Adam Klivans, Rocco A. Servedio
    Learning DNF in time 2Õ(n1/3). [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:258-265 [Conf]
  36. Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning juntas. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:206-212 [Conf]
  37. Ryan O'Donnell, Rocco A. Servedio
    New degree bounds for polynomial threshold functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:325-334 [Conf]
  38. Ronitt Rubinfeld, Rocco A. Servedio
    Testing monotone high-dimensional distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:147-156 [Conf]
  39. Rocco A. Servedio
    Computational Sample Complexity and Attribute-Efficient Learning. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:701-710 [Conf]
  40. Rocco A. Servedio
    On PAC Learning Algorithms for Rich Boolean Function Classes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:442-451 [Conf]
  41. Adam R. Klivans, Rocco A. Servedio
    Toward Attribute Efficient Learning Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  42. Alp Atici, Rocco A. Servedio
    Improved Bounds on Quantum Learning Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  43. Rocco A. Servedio
    Monotone Boolean formulas can approximate monotone linear threshold functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:181-187 [Journal]
  44. Rocco A. Servedio
    On Learning Monotone DNF under Product Distributions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:6, pp:- [Journal]
  45. Rocco A. Servedio
    On learning monotone DNF under product distributions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:193, n:1, pp:57-74 [Journal]
  46. Marta Arias, Aaron Feigelson, Roni Khardon, Rocco A. Servedio
    Polynomial certificates for propositional classes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:5, pp:816-834 [Journal]
  47. Rocco A. Servedio
    On the limits of efficient teachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:6, pp:267-272 [Journal]
  48. Rocco A. Servedio, Andrew Wan
    Computing sparse permanents faster. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:3, pp:89-92 [Journal]
  49. Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning DNF from random walks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:3, pp:250-265 [Journal]
  50. Adam Tauman Kalai, Rocco A. Servedio
    Boosting in the presence of noise. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:3, pp:266-290 [Journal]
  51. 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]
  52. 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]
  53. Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning functions of k relevant variables. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:421-434 [Journal]
  54. Rocco A. Servedio
    Computational Sample Complexity and Attribute-Efficient Learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:1, pp:161-178 [Journal]
  55. Rocco A. Servedio
    Smooth Boosting and Learning with Malicious Noise. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2003, v:4, n:, pp:633-648 [Journal]
  56. Roni Khardon, Rocco A. Servedio
    Maximum Margin Algorithms with Boolean Kernels. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2005, v:6, n:, pp:1405-1429 [Journal]
  57. 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]
  58. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
    Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2007, v:8, n:, pp:277-290 [Journal]
  59. 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]
  60. Rocco A. Servedio
    PAC Analogues of Perceptron and Winnow Via Boosting the Margin. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2002, v:47, n:2-3, pp:133-151 [Journal]
  61. Jeffrey C. Jackson, Rocco A. Servedio
    Learning Random Log-Depth Decision Trees under Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1107-1128 [Journal]
  62. Rocco A. Servedio
    Perceptron, Winnow, and PAC Learning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1358-1369 [Journal]
  63. Rocco A. Servedio, Steven J. Gortler
    Equivalences and Separations Between Quantum and Classical Learnability. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1067-1092 [Journal]
  64. Rocco A. Servedio
    On learning embedded midbit functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:13-23 [Journal]
  65. Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright
    LP Decoding Corrects a Constant Fraction of Errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:82-89 [Journal]
  66. Marcus Hutter, Rocco A. Servedio, Eiji Takimoto
    Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:1-8 [Conf]
  67. Dana Glasner, Rocco A. Servedio
    Distribution-Free Testing Lower Bounds for Basic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:494-508 [Conf]
  68. Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe
    Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:63-76 [Conf]
  69. Philip M. Long, Rocco A. Servedio
    Attribute-efficient learning of decision lists and linear threshold functions under unconcentrated distributions. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:921-928 [Conf]
  70. Rocco A. Servedio
    Every Linear Threshold Function has a Low-Weight Approximator. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:2, pp:180-209 [Journal]
  71. Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
    PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  72. Alp Atici, Rocco A. Servedio
    Quantum Algorithms for Learning and Testing Juntas [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  73. Philip M. Long, Rocco A. Servedio, Hans-Ulrich Simon
    Discriminative learning can succeed where generative learning fails. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:4, pp:131-135 [Journal]
  74. Roni Khardon, Dan Roth, Rocco A. Servedio
    Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:341-356 [Journal]
  75. Ryan O'Donnell, Rocco A. Servedio
    Learning Monotone Decision Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:827-844 [Journal]
  76. Lisa Hellerstein, Rocco A. Servedio
    On PAC learning algorithms for rich Boolean function classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:66-76 [Journal]

  77. Testing ±1-weight halfspace. [Citation Graph (, )][DBLP]


  78. Learning Random Monotone DNF. [Citation Graph (, )][DBLP]


  79. Learning and Lower Bounds for AC0 with Threshold Gates. [Citation Graph (, )][DBLP]


  80. Improved Approximation of Linear Threshold Functions. [Citation Graph (, )][DBLP]


  81. A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. [Citation Graph (, )][DBLP]


  82. Testing for Concise Representations. [Citation Graph (, )][DBLP]


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


  84. Bounded Independence Fools Halfspaces. [Citation Graph (, )][DBLP]


  85. Efficiently Testing Sparse GF(2) Polynomials. [Citation Graph (, )][DBLP]


  86. Optimal Cryptographic Hardness of Learning Monotone Functions. [Citation Graph (, )][DBLP]


  87. Testing Fourier Dimensionality and Sparsity. [Citation Graph (, )][DBLP]


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


  89. Random classification noise defeats all convex potential boosters. [Citation Graph (, )][DBLP]


  90. Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate. [Citation Graph (, )][DBLP]


  91. One-Pass Boosting. [Citation Graph (, )][DBLP]


  92. Boosting the Area under the ROC Curve. [Citation Graph (, )][DBLP]


  93. Adaptive Martingale Boosting. [Citation Graph (, )][DBLP]


  94. Testing halfspaces. [Citation Graph (, )][DBLP]


  95. The chow parameters problem. [Citation Graph (, )][DBLP]


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


  97. Every decision tree has an influential variable [Citation Graph (, )][DBLP]


  98. Learning Unions of $\omega(1)$-Dimensional Rectangles [Citation Graph (, )][DBLP]


  99. Efficiently Testing Sparse GF(2) Polynomials [Citation Graph (, )][DBLP]


  100. Bounded Independence Fools Halfspaces [Citation Graph (, )][DBLP]


  101. A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions [Citation Graph (, )][DBLP]


  102. Average sensitivity and noise sensitivity of polynomial threshold functions [Citation Graph (, )][DBLP]


  103. Improved Approximation of Linear Threshold Functions [Citation Graph (, )][DBLP]


  104. Testing for Concise Representations. [Citation Graph (, )][DBLP]


  105. Testing Halfspaces. [Citation Graph (, )][DBLP]


  106. Learning Random Monotone DNF. [Citation Graph (, )][DBLP]


Search in 0.151secs, Finished in 0.156secs
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