Lisa Hellerstein
Lisa Hellerstein
Professor of Computer Science, NYU Tandon School of Engineering
Verified email at nyu.edu
Title
Cited by
Cited by
Year
Learning read-once formulas with queries
D Angluin, L Hellerstein, M Karpinski
Journal of the ACM (JACM) 40 (1), 185-210, 1993
2351993
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
2181994
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
1681989
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
1521989
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
1411996
On compression-based text classification
Y Marton, N Wu, L Hellerstein
European Conference on Information Retrieval, 300-314, 2005
1052005
Equational characterizations of Boolean function classes
O Ekin, S Foldes, PL Hammer, L Hellerstein
Discrete Mathematics 211 (1-3), 27-51, 2000
932000
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
881995
Learning arithmetic read-once formulas
NH Bshouty, TR Hancock, L Hellerstein
SIAM Journal on Computing 24 (4), 706-735, 1995
681995
Attribute-efficient learning in query and mistake-bound models
N Bshouty, L Hellerstein
Journal of Computer and System Sciences 56 (3), 310-319, 1998
611998
PAC learning with irrelevant attributes
A Dhagat, L Hellerstein
Proceedings 35th Annual Symposium on Foundations of Computer Science, 64-74, 1994
531994
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
511992
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
502014
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
502014
Complexity theoretic hardness results for query learning
H Aizenstein, T Hegedüs, L Hellerstein, L Pitt
Computational Complexity 7 (1), 19-53, 1998
481998
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
451992
Learning read-once formulas over fields and extended bases
T Hancock, L Hellerstein
Proceedings of the fourth annual workshop on Computational learning theory …, 1991
431991
Minimizing Disjunctive Normal Form Formulas and Circuits Given a Truth Table
E Allender, L Hellerstein, P McCabe, T Pitassi, M Saks
SIAM Journal on Computing 38 (1), 63-84, 2008
422008
Learning read-once formulas with queries
D Angluin, L Hellerstein, M Karpinski
University of California, Berkeley, Computer Science Division, 1989
401989
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
371995
The system can't perform the operation now. Try again later.
Articles 1–20