The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nader H. Bshouty: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
    Oracles and Queries That Are Sufficient for Exact Learning. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:421-433 [Journal]
  2. Nader H. Bshouty, Ehab Wattad
    On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. [Citation Graph (0, 0)][DBLP]
    ALT, 2006, pp:48-62 [Conf]
  3. Rotem Bennet, Nader H. Bshouty
    Learning Attribute-Efficiently with Corrupt Oracles. [Citation Graph (0, 0)][DBLP]
    ALT, 2005, pp:183-197 [Conf]
  4. Nader H. Bshouty, Lynn Burroughs
    Maximizing Agreements and CoAgnostic Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:83-97 [Conf]
  5. Nader H. Bshouty, Iddo Bentov
    On Exact Learning from Random Walk. [Citation Graph (0, 0)][DBLP]
    ALT, 2006, pp:184-198 [Conf]
  6. Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
    PAC Learning with Nasty Noise. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:206-218 [Conf]
  7. Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh
    Learning Threshold Functions with Small Weights Using Membership Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:318-322 [Conf]
  8. Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi
    On Optimal Learning Algorithms for Multiplicity Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:184-198 [Conf]
  9. Nader H. Bshouty
    Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:64-76 [Conf]
  10. Nader H. Bshouty
    A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:79-82 [Conf]
  11. Nader H. Bshouty
    Simple Learning Algorithms Using Divide and Conquer. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:447-453 [Conf]
  12. Nader H. Bshouty, Lynn Burroughs
    Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:271-286 [Conf]
  13. Nader H. Bshouty, Lynn Burroughs
    On the Proper Learning of Axis Parallel Concepts. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:287-302 [Conf]
  14. Daoud Bshouty, Nader H. Bshouty
    On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:311-317 [Conf]
  15. Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer
    On the Learnability of Zn-DNF Formulas (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:198-205 [Conf]
  16. Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon
    Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:130-139 [Conf]
  17. Nader H. Bshouty, Nadav Eiron
    Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:546-557 [Conf]
  18. 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]
  19. Nader H. Bshouty, Dmitry Gavinsky
    On Boosting with Optimal Poly-Bounded Distributions. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:490-506 [Conf]
  20. Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
    Asking Questions to Minimize Errors. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:41-50 [Conf]
  21. Nader H. Bshouty, Sally A. Goldman, H. David Mathias
    Noise-Tolerant Parallel Learning of Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:345-352 [Conf]
  22. Nader H. Bshouty, Lisa Hellerstein
    Attribute-Efficient Learning in Query and Mistake-Bound Models. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:235-243 [Conf]
  23. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:1-15 [Conf]
  24. Nader H. Bshouty, Jeffrey C. Jackson
    Learning DNF over the Uniform Distribution using a Quantum Example Oracle. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:118-127 [Conf]
  25. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    Exploring Learnability between Exact and PAC. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:244-254 [Conf]
  26. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    Uniform-Distribution Attribute Noise Learnability. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:75-80 [Conf]
  27. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:286-295 [Conf]
  28. Nader H. Bshouty, Hanna Mazzawi
    Exact Learning Composed Classes with a Small Number of Mistakes. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:199-213 [Conf]
  29. Nader H. Bshouty, Avi Owshanko
    Learning Regular Sets with an Incomplete Membership Oracle. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:574-588 [Conf]
  30. Nader H. Bshouty, Christino Tamon, David K. Wilson
    On Learning Decision Trees with Large Output Domains (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:190-197 [Conf]
  31. Nader H. Bshouty, Christino Tamon, David K. Wilson
    On Learning width Two Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:224-227 [Conf]
  32. Nader H. Bshouty, David K. Wilson
    On Learning in the Presence of Unspecified Attribute Values. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:81-87 [Conf]
  33. Nader H. Bshouty
    On the Direct Sum Conjecture in the Straight Line Model. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:85-96 [Conf]
  34. Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
    On Learning Programs and Small Depth Circuits. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:150-161 [Conf]
  35. Nader H. Bshouty, Christino Tamon, David K. Wilson
    Learning Matrix Functions over Rings. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:27-37 [Conf]
  36. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
    On the Applications of Multiplicity Automata in Learning. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:349-358 [Conf]
  37. Laurence Bisht, Nader H. Bshouty, Lawrance Khoury
    Learning with Errors in Answers to Membership Queries. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:611-620 [Conf]
  38. Nader H. Bshouty
    A Lower Bound for Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:64-67 [Conf]
  39. Nader H. Bshouty
    Exact Learning via the Monotone Theory (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:302-311 [Conf]
  40. Nader H. Bshouty, Richard Cleve
    On the Exact Learning of Formulas in Parallel (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:513-522 [Conf]
  41. Nader H. Bshouty, Richard Cleve, Wayne Eberly
    Size-Depth Tradeoffs for Algebraic Formulae [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:334-341 [Conf]
  42. Nader H. Bshouty, Zhixiang Chen, Steven Homer
    On Learning Discretized Geometric Concepts (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:54-63 [Conf]
  43. Nader H. Bshouty, Dmitry Gavinsky
    PAC = PAExact and Other Equivalent Models in Learning. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:167-176 [Conf]
  44. Nader H. Bshouty, Yishay Mansour
    Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:304-311 [Conf]
  45. 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]
  46. Michael Kaminski, Nader H. Bshouty
    Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:138-140 [Conf]
  47. Nader H. Bshouty
    Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:55-65 [Conf]
  48. Nader H. Bshouty, Geoffrey T. Falk
    Compression of Dictionaries via Extensions to Front Coding. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:361-364 [Conf]
  49. Nader H. Bshouty
    Lower Bounds for the Complexity of Functions in a Realistic RAM Model. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1992, pp:12-23 [Conf]
  50. Nader H. Bshouty, Lynn Burroughs
    Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:298-308 [Conf]
  51. Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz
    A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:324-333 [Conf]
  52. Nader H. Bshouty
    On the Extended Direct Sum Conjecture [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:177-185 [Conf]
  53. Nader H. Bshouty
    Towards the Learnability of DNF Formulae. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:131-140 [Conf]
  54. Nader H. Bshouty
    A New Composition Theorem for Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:583-589 [Conf]
  55. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
    Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:151-160 [Conf]
  56. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Arithmetic Read-Once Formulas [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:370-381 [Conf]
  57. Nader H. Bshouty, Christino Tamon
    On the Fourier spectrum of monotone functions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:219-228 [Conf]
  58. Nader H. Bshouty, Christino Tamon, David K. Wilson
    On Learning Decision Trees with Large Output Domains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:1, pp:77-100 [Journal]
  59. Nader H. Bshouty, Christino Tamon, David K. Wilson
    Learning Matrix Functions over Rings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:91-111 [Journal]
  60. Nader H. Bshouty
    Simple Learning Algorithms Using Divide and Conquer. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:2, pp:174-194 [Journal]
  61. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski
    An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:37-61 [Journal]
  62. Nader H. Bshouty, Michael Kaminski
    Polynomial multiplication over finite fields: from quadratic to straight-line complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:3, pp:252-262 [Journal]
  63. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Fast Exponentiation Using the Truncation Operation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:244-255 [Journal]
  64. Nader H. Bshouty, Lynn Burroughs
    On the proper learning of axis parallel concepts [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:019, pp:- [Journal]
  65. Nader H. Bshouty
    Exact Learning Boolean Functions via the Monotone Theory [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:8, pp:- [Journal]
  66. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
    Oracles and Queries That Are Sufficient for Exact Learning [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:15, pp:- [Journal]
  67. Nader H. Bshouty, Christino Tamon
    On the Fourier spectrum of Monotone Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:32, pp:- [Journal]
  68. Nader H. Bshouty
    The Monotone Theory for the PAC-Model [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:59, pp:- [Journal]
  69. Nader H. Bshouty
    A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:60, pp:- [Journal]
  70. Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio
    Learning Multivariate Polynomials from Substitution and Equivalence Queries [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:8, pp:- [Journal]
  71. Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
    On Learning Branching Programs and Small Depth Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:9, pp:- [Journal]
  72. Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz
    A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:59, pp:- [Journal]
  73. Nader H. Bshouty
    A New Composition Theorem for Learning Algorithms [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:13, pp:- [Journal]
  74. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    Attribute Efficient PAC Learning of DNF with Membership Queries under the Uniform Distribution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:76, pp:- [Journal]
  75. Nader H. Bshouty
    The monotone theory for the PAC-model. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:20-35 [Journal]
  76. Nader H. Bshouty
    Exact Learning Boolean Function via the Monotone Theory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:146-153 [Journal]
  77. Nader H. Bshouty, Sally A. Goldman, H. David Mathias
    Noise-Tolerant Parallel Learning of Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:147, n:1, pp:89-110 [Journal]
  78. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    Uniform-distribution attribute noise learnability. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:2, pp:277-290 [Journal]
  79. Nader H. Bshouty
    A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:6, pp:321-326 [Journal]
  80. Nader H. Bshouty
    On the Additive Complexity of 2 x 2 Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:6, pp:329-335 [Journal]
  81. Nader H. Bshouty
    A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:37-39 [Journal]
  82. Nader H. Bshouty
    On Learning Multivariate Polynomials Under the Uniform Distribution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:6, pp:303-309 [Journal]
  83. Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca
    Meeting Times of Random Walks on Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:5, pp:259-265 [Journal]
  84. Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    A Tight Bound for Approximating the Square Root. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:211-213 [Journal]
  85. Nader H. Bshouty, Christino Tamon, David K. Wilson
    On Learning width Two Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:4, pp:217-222 [Journal]
  86. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
    Learning functions represented as multiplicity automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:3, pp:506-530 [Journal]
  87. Nader H. Bshouty
    On the Complexity of Functions for Random Access Machines. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:2, pp:211-223 [Journal]
  88. Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
    Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:5, pp:863-890 [Journal]
  89. Nader H. Bshouty, Christino Tamon
    On the Fourier Spectrum of Monotone Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:4, pp:747-770 [Journal]
  90. Michael Kaminski, Nader H. Bshouty
    Multiplicative complexity of polynomial multiplication over finite fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:150-170 [Journal]
  91. Amir Averbuch, Nader H. Bshouty, Michael Kaminski
    A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:4, pp:577-588 [Journal]
  92. Nader H. Bshouty
    Lower Bounds for the Complexity of Functions in a Realistic RAM Model. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:1-20 [Journal]
  93. Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty
    Addition Requirements for Matrix and Transposed Matrix Products. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:354-364 [Journal]
  94. Nader H. Bshouty
    On the Direct Sum Conjecture in the Straight Line Model. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1998, v:14, n:1, pp:49-62 [Journal]
  95. Daoud Bshouty, Nader H. Bshouty
    On Interpolating Arithmetic Read-Once Formulas with Exponentiation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:1, pp:112-124 [Journal]
  96. Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
    Asking Questions to Minimize Errors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:2, pp:268-286 [Journal]
  97. Nader H. Bshouty, Lisa Hellerstein
    Attribute-Efficient Learning in Query and Mistake-Bound Models. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:56, n:3, pp:310-319 [Journal]
  98. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Boolean Read-Once Formulas over Generalized Bases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:521-542 [Journal]
  99. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    More efficient PAC-learning of DNF with membership queries under the uniform distribution. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:1, pp:205-234 [Journal]
  100. Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
    Exploring learnability between exact and PAC. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:4, pp:471-484 [Journal]
  101. 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]
  102. Nader H. Bshouty, Lynn Burroughs
    On the Proper Learning of Axis-Parallel Concepts. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2003, v:4, n:, pp:157-176 [Journal]
  103. Nader H. Bshouty, Nadav Eiron
    Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2002, v:3, n:, pp:49-57 [Journal]
  104. 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]
  105. Nader H. Bshouty, Dmitry Gavinsky
    On Boosting with Polynomially Bounded Distributions. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2002, v:3, n:, pp:483-506 [Journal]
  106. Nader H. Bshouty
    Exact Learning of Formulas in Parallel. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1997, v:26, n:1, pp:25-41 [Journal]
  107. Nader H. Bshouty, Lynn Burroughs
    Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2005, v:59, n:1-2, pp:99-123 [Journal]
  108. Nader H. Bshouty
    A Lower Bound for Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:759-765 [Journal]
  109. Nader H. Bshouty
    Maximal Rank of m x n x (mn - k) Tensors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:467-471 [Journal]
  110. Nader H. Bshouty
    On the Complexity of Bilinear Forms over Associative Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:815-833 [Journal]
  111. Nader H. Bshouty, Richard Cleve
    Interpolating Arithmetic Read-Once Formulas in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:401-413 [Journal]
  112. Nader H. Bshouty, Richard Cleve, Wayne Eberly
    Size-Depth Tradeoffs for Algebraic Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:682-705 [Journal]
  113. Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
    Exact Learning of Discretized Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:674-699 [Journal]
  114. Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
    Learning Arithmetic Read-Once Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:706-735 [Journal]
  115. Nader H. Bshouty, Jeffrey C. Jackson
    Learning DNF over the Uniform Distribution Using a Quantum Example Oracle. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:1136-1153 [Journal]
  116. Nader H. Bshouty, Michael Kaminski
    Multiplication of Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:452-456 [Journal]
  117. Nader H. Bshouty, Yishay Mansour
    Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1909-1925 [Journal]
  118. Nader H. Bshouty, Gadiel Seroussi
    Generalizations of the Normal Basis Theorem of Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:330-337 [Journal]
  119. Nader H. Bshouty, Lynn Burroughs
    Maximizing agreements and coagnostic learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:24-39 [Journal]
  120. Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
    PAC learning with nasty noise. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:2, pp:255-275 [Journal]
  121. Gadiel Seroussi, Nader H. Bshouty
    Vector sets for exhaustive testing of logic circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:513-522 [Journal]

  122. Reconstructing Weighted Graphs with Minimal Query Complexity. [Citation Graph (, )][DBLP]


  123. Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering. [Citation Graph (, )][DBLP]


  124. Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. [Citation Graph (, )][DBLP]


  125. Optimal Query Complexity for Reconstructing Hypergraphs. [Citation Graph (, )][DBLP]


  126. Optimal Query Complexity for Reconstructing Hypergraphs [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.015secs
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