dblp.uni-trier.dewww.uni-trier.de

Lisa Hellerstein Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
50EEAnne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Transactions on Algorithms 5(2): (2009)
49EELisa Hellerstein, Hans-Ulrich Simon: Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. 75(1): 1 (2009)
2008
48EEAmol Deshpande, Lisa Hellerstein: Flow Algorithms for Parallel Query Optimization. ICDE 2008: 754-763
47EELisa Hellerstein: Certificate Complexity and Exact Learning. Encyclopedia of Algorithms 2008
46EEEric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table. SIAM J. Comput. 38(1): 63-84 (2008)
2007
45EELisa Hellerstein, Rocco A. Servedio: On PAC learning algorithms for rich Boolean function classes. Theor. Comput. Sci. 384(1): 66-76 (2007)
2006
44EEEric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. IEEE Conference on Computational Complexity 2006: 237-251
43EEAnne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu: Flow algorithms for two pipelined filter ordering problems. PODS 2006: 193-202
2005
42EEYuval Marton, Ning Wu, Lisa Hellerstein: On Compression-Based Text Classification. ECIR 2005: 300-314
41EEBernard Rosell, Lisa Hellerstein, Soumya Ray, David Page: Why skewing works: learning difficult Boolean functions with greedy tree learners. ICML 2005: 728-735
40EEEric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks: Minimizing DNF Formulas and AC0 Circuits Given a Truth Table Electronic Colloquium on Computational Complexity (ECCC)(126): (2005)
39EELisa Hellerstein, Vijay Raghavan: Exact learning of DNF formulas using DNF hypotheses. J. Comput. Syst. Sci. 70(4): 435-470 (2005)
2004
38EEBernard Rosell, Lisa Hellerstein: Naïve Bayes with Higher Order Attributes. Canadian Conference on AI 2004: 105-119
2002
37EELisa Hellerstein, Vijay Raghavan: Exact learning of DNF formulas using DNF hypotheses. STOC 2002: 465-473
2001
36EELisa Hellerstein: On generalized constraints and certificates. Discrete Mathematics 226(1-3): 211-232 (2001)
2000
35EEOya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein: Equational characterizations of Boolean function classes. Discrete Mathematics 211: 27-51 (2000)
1999
34EEJoseph M. Hellerstein, Lisa Hellerstein, George Kollios: On the Generation of 2-Dimensional Index Workloads. ICDT 1999: 113-130
1998
33 Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt: Complexity Theoretic Hardness Results for Query Learning. Computational Complexity 7(1): 19-53 (1998)
32 Aaron Feigelson, Lisa Hellerstein: Conjunctions of Unate DNF Formulas: Learning and Structure. Inf. Comput. 140(2): 203-228 (1998)
31 Nader H. Bshouty, Lisa Hellerstein: Attribute-Efficient Learning in Query and Mistake-Bound Models. J. Comput. Syst. Sci. 56(3): 310-319 (1998)
30 Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson: On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. SIAM J. Comput. 27(3): 739-762 (1998)
1997
29EEAaron Feigelson, Lisa Hellerstein: The Forbidden Projections of Unate Functions. Discrete Applied Mathematics 77(3): 221-236 (1997)
1996
28EENader H. Bshouty, Lisa Hellerstein: Attribute-Efficient Learning in Query and Mistake-Bound Models. COLT 1996: 235-243
27EEAaron Feigelson, Lisa Hellerstein: Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. COLT 1996: 255-265
26 Collette R. Coullard, Lisa Hellerstein: Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. Combinatorica 16(2): 189-208 (1996)
25EELisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins: How Many Queries Are Needed to Learn? J. ACM 43(5): 840-862 (1996)
1995
24EELisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins: How many queries are needed to learn? STOC 1995: 190-199
23 Avrim Blum, Lisa Hellerstein, Nick Littlestone: Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. J. Comput. Syst. Sci. 50(1): 32-40 (1995)
22 Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Boolean Read-Once Formulas over Generalized Bases. J. Comput. Syst. Sci. 50(3): 521-542 (1995)
21 Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Arithmetic Read-Once Formulas. SIAM J. Comput. 24(4): 706-735 (1995)
1994
20 Aditi Dhagat, Lisa Hellerstein: PAC Learning with Irrelevant Attributes FOCS 1994: 64-74
19 Lisa Hellerstein, Collette R. Coullard: Learning Binary Matroid Ports. SODA 1994: 328-335
18EEAnne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson: On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). STOC 1994: 676-685
17 Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson: Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica 12(2/3): 182-208 (1994)
16 Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski: An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. Computational Complexity 4: 37-61 (1994)
15 Lisa Hellerstein: Guest Editor's Introduction. Machine Learning 17(2-3): 111-114 (1994)
1993
14EELisa Hellerstein: Functions that are Read-Once on a Subset of their Inputs. Discrete Applied Mathematics 46(3): 235-251 (1993)
13EEDana Angluin, Lisa Hellerstein, Marek Karpinski: Learning Read-Once Formulas with Queries. J. ACM 40(1): 185-210 (1993)
12 Lisa Hellerstein: Book Review: ``Machine Learning: A Theoretical Approach''. Machine Learning 13: 145-149 (1993)
1992
11EENader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. COLT 1992: 1-15
10 Howard Aizenstein, Lisa Hellerstein, Leonard Pitt: Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries FOCS 1992: 523-532
9 Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein: Learning Arithmetic Read-Once Formulas STOC 1992: 370-381
1991
8EEAvrim Blum, Lisa Hellerstein, Nick Littlestone: Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. COLT 1991: 157-166
7EEThomas R. Hancock, Lisa Hellerstein: Learning Read-Once Formulas over Fields and Extended Bases. COLT 1991: 326-336
1990
6 Lisa Hellerstein, Philip N. Klein, Robert Wilber: On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. Inf. Process. Lett. 35(5): 261-267 (1990)
1989
5 Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson: Failure Correction Techniques for Large Disk Arrays. ASPLOS 1989: 123-132
4EELisa Hellerstein, Marek Karpinski: Learning Read-Once Formulas Using Membership Queries. COLT 1989: 146-161
1987
3 Stephen Taylor, Lisa Hellerstein, Shmuel Safra, Ehud Y. Shapiro: Notes on the Complexity of Systolic Programs. J. Parallel Distrib. Comput. 4(3): 250-265 (1987)
1986
2 Lisa Hellerstein, Ehud Y. Shapiro: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. J. Log. Program. 3(2): 157-184 (1986)
1984
1 Lisa Hellerstein, Ehud Y. Shapiro: Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. SLP 1984: 99-115

Coauthor Index

1Howard Aizenstein [10] [33]
2Eric Allender [40] [44] [46]
3Dana Angluin [13]
4Avrim Blum [8] [23]
5Nader H. Bshouty [9] [11] [16] [21] [22] [28] [31]
6Anne Condon [18] [30] [43] [50]
7Collette R. Coullard [19] [26]
8Amol Deshpande [43] [48] [50]
9Aditi Dhagat [20]
10Oya Ekin [35]
11Aaron Feigelson [27] [29] [32]
12Stephan Foldes [35]
13Garth A. Gibson [5] [17]
14Peter L. Hammer [35]
15Thomas R. Hancock [7] [9] [11] [16] [21] [22]
16Tibor Hegedüs [33]
17Joseph M. Hellerstein [34]
18Richard M. Karp [5] [17]
19Marek Karpinski [4] [13] [16]
20Randy H. Katz [5] [17]
21Philip N. Klein [6]
22George Kollios [34]
23Nick Littlestone [8] [23]
24Yuval Marton [42]
25Paul McCabe [40] [44] [46]
26C. David Page Jr. (David Page) [41]
27David A. Patterson [5] [17]
28Krishnan Pillaipakkamnatt [24] [25]
29Toniann Pitassi [40] [44] [46]
30Leonard Pitt [10] [33]
31Samuel Pottle [18] [30]
32Vijay V. Raghavan (Vijay Raghavan) [24] [25] [37] [39]
33Soumya Ray [41]
34Bernard Rosell [38] [41]
35Shmuel Safra [3]
36Michael E. Saks [40] [44] [46]
37Rocco A. Servedio [45]
38Ehud Y. Shapiro [1] [2] [3]
39Hans-Ulrich Simon [49]
40Stephen Taylor [3]
41Avi Wigderson [18] [30]
42Robert Wilber [6]
43Dawn Wilkins [24] [25]
44Ning Wu [42] [43] [50]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)