Lisa Hellerstein

	2012
56		Lisa Hellerstein, Devorah Kletenik: On the gap between ess(f) and cnf_size(f). ISAIM 2012
	2011
55		Lisa Hellerstein, Özgür Özkan, Linda Sellie: Max-Throughput for (Conservative) k-of-n Testing. ISAAC 2011: 703-713
54		Lisa Hellerstein, Devorah Kletenik: On the gap between ess(f) and cnf_size(f) CoRR abs/1106.4247: (2011)
53		Lisa Hellerstein, Özgür Özkan, Linda Sellie: Max-Throughput for (Conservative) k-of-n Testing CoRR abs/1109.3401: (2011)
52		Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio: Tight Bounds on Proper Equivalence Query Learning of DNF CoRR abs/1111.1124: (2011)
	2009
51		Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu: Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Transactions on Algorithms 5(2): (2009)
50		Lisa Hellerstein, Hans-Ulrich Simon: Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. 75(1): 1 (2009)
49		Lisa Hellerstein, Bernard Rosell, Eric Bach, Soumya Ray, David Page: Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions. Journal of Machine Learning Research 10: 2374-2411 (2009)
	2008
48		Amol Deshpande, Lisa Hellerstein: Flow Algorithms for Parallel Query Optimization. ICDE 2008: 754-763
47		Lisa Hellerstein: Certificate Complexity and Exact Learning. Encyclopedia of Algorithms 2008
46		Eric 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
45		Lisa Hellerstein, Rocco A. Servedio: On PAC learning algorithms for rich Boolean function classes. Theor. Comput. Sci. 384(1): 66-76 (2007)
	2006
44		Eric 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
43		Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu: Flow algorithms for two pipelined filter ordering problems. PODS 2006: 193-202
	2005
42		Yuval Marton, Ning Wu, Lisa Hellerstein: On Compression-Based Text Classification. ECIR 2005: 300-314
41		Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page: Why skewing works: learning difficult Boolean functions with greedy tree learners. ICML 2005: 728-735
40		Eric 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)
39		Lisa Hellerstein, Vijay Raghavan: Exact learning of DNF formulas using DNF hypotheses. J. Comput. Syst. Sci. 70(4): 435-470 (2005)
	2004
38		Bernard Rosell, Lisa Hellerstein: Naïve Bayes with Higher Order Attributes. Canadian Conference on AI 2004: 105-119
	2002
37		Lisa Hellerstein, Vijay Raghavan: Exact learning of DNF formulas using DNF hypotheses. STOC 2002: 465-473
	2001
36		Lisa Hellerstein: On generalized constraints and certificates. Discrete Mathematics 226(1-3): 211-232 (2001)
	2000
35		Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein: Equational characterizations of Boolean function classes. Discrete Mathematics 211: 27-51 (2000)
	1999
34		Joseph 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
29		Aaron Feigelson, Lisa Hellerstein: The Forbidden Projections of Unate Functions. Discrete Applied Mathematics 77(3): 221-236 (1997)
	1996
28		Nader H. Bshouty, Lisa Hellerstein: Attribute-Efficient Learning in Query and Mistake-Bound Models. COLT 1996: 235-243
27		Aaron 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)
25		Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins: How Many Queries Are Needed to Learn? J. ACM 43(5): 840-862 (1996)
	1995
24		Lisa 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
18		Anne 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
14		Lisa Hellerstein: Functions that are Read-Once on a Subset of their Inputs. Discrete Applied Mathematics 46(3): 235-251 (1993)
13		Dana 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
11		Nader 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
8		Avrim Blum, Lisa Hellerstein, Nick Littlestone: Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. COLT 1991: 157-166
7		Thomas 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
4		Lisa 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

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

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page