Learning read-once formulas with queries D Angluin, L Hellerstein, M Karpinski
Journal of the ACM (JACM) 40 (1), 185-210, 1993
241 1993 Coding techniques for handling failures in large disk arrays L Hellerstein, GA Gibson, RM Karp, RH Katz, DA Patterson
Algorithmica 12 (2), 182-208, 1994
223 1994 Failure correction techniques for large disk arrays GA Gibson, L Hellerstein, RM Karp, DA Patterson
ACM SIGARCH Computer Architecture News 17 (2), 123-132, 1989
174 1989 Coding techniques for handling failures in large disk arrays G Gibson, L Hellerstein, R Karp, R Katz, D Patterson
Proc. of the International Conference on Architectural Support for …, 1989
153 1989 How many queries are needed to learn? L Hellerstein, K Pillaipakkamnatt, V Raghavan, D Wilkins
Journal of the ACM (JACM) 43 (5), 840-862, 1996
148 1996 On compression-based text classification Y Marton, N Wu, L Hellerstein
European Conference on Information Retrieval, 300-314, 2005
117 2005 Equational characterizations of Boolean function classes O Ekin, S Foldes, PL Hammer, L Hellerstein
Discrete Mathematics 211 (1-3), 27-51, 2000
96 2000 Learning in the presence of finitely or infinitely many irrelevant attributes A Blum, L Hellerstein, N Littlestone
Journal of Computer and System Sciences 50 (1), 32-40, 1995
95 1995 Learning arithmetic read-once formulas NH Bshouty, TR Hancock, L Hellerstein
SIAM Journal on Computing 24 (4), 706-735, 1995
69 1995 Attribute-efficient learning in query and mistake-bound models N Bshouty, L Hellerstein
Journal of Computer and System Sciences 56 (3), 310-319, 1998
62 1998 PAC learning with irrelevant attributes A Dhagat, L Hellerstein
Proceedings 35th Annual Symposium on Foundations of Computer Science, 64-74, 1994
59 1994 Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover A Deshpande, L Hellerstein, D Kletenik
Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014
56 2014 Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover A Deshpande, L Hellerstein, D Kletenik
Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014
56 2014 Read-thrice DNF is hard to learn with membership and equivalence queries H Aizenstein, L Hellerstein, L Pitt
Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 523-532, 1992
52 1992 Minimizing Disjunctive Normal Form Formulas and E Allender, L Hellerstein, P McCabe, T Pitassi, M Saks
SIAM Journal on Computing 38 (1), 63-84, 2008
50 2008 Complexity theoretic hardness results for query learning H Aizenstein, T Hegedüs, L Hellerstein, L Pitt
Computational Complexity 7 (1), 19-53, 1998
50 1998 Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates NH Bshouty, TR Hancock, L Hellerstein
Proceedings of the fifth annual workshop on Computational learning theory, 1-15, 1992
46 1992 Learning read-once formulas over fields and extended bases T Hancock, L Hellerstein
Proceedings of the fourth annual workshop on Computational learning theory …, 1991
45 1991 Learning read-once formulas with queries D Angluin, L Hellerstein, M Karpinski
University of California, Berkeley, Computer Science Division, 1989
41 1989 Learning boolean read-once formulas over generalized bases NH Bshouty, TR Hancock, L Hellerstein
Journal of Computer and System Sciences 50 (3), 521-542, 1995
40 1995 