The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Lisa Hellerstein" ( http://dblp.L3S.de/Authors/Lisa_Hellerstein )

URL (Homepage):  http://cis.poly.edu/hstein/  Author page on DBLP  Author page in RDF  Community of Lisa Hellerstein in ASPL-2

Publication years (Num. hits)
1984-1994 (20) 1995-2000 (15) 2001-2009 (16) 2011-2016 (19) 2017-2019 (12)
Publication types (Num. hits)
article(47) incollection(2) inproceedings(33)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 21 occurrences of 16 keywords

Results
Found 83 publication records. Showing 82 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Lisa Hellerstein, Thomas Lidbetter, Daniel P. Miranker Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games. Search on Bibsonomy Operations Research The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik Revisiting the Approximation Bound for Stochastic Submodular Cover. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik The Stochastic Score Classification Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Eric Bach, Jérémie Dusart, Lisa Hellerstein, Devorah Kletenik Submodular goal value of Boolean functions. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nicholas Sean Escanilla, Lisa Hellerstein, Ross Kleiman, Zhaobin Kuang, James Shull, David Page Recursive Feature Elimination by Sensitivity Testing. Search on Bibsonomy ICMLA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik The Stochastic Score Classification Problem. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein Stochastic Evaluation of Symmetric Boolean Functions. Search on Bibsonomy ISAIM The full citation details ... 2018 DBLP  BibTeX  RDF
1Lisa Hellerstein, Lev Reyzin, György Turán Foreword. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Özgür Özkan, Linda Sellie Max-Throughput for (Conservative) k-of-n Testing. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt Evaluation of Monotone DNF Formulas. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Thomas Lidbetter An Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Eric Bach, Jérémie Dusart, Lisa Hellerstein, Devorah Kletenik Submodular Goal Value of Boolean Functions. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Lisa Hellerstein Certificate Complexity and Exact Learning. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Amol Deshpande, Lisa Hellerstein, Devorah Kletenik Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin 0001 Scenario Submodular Cover. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin 0001 Scenario Submodular Cover. Search on Bibsonomy WAOA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Eric Bach, Lisa Hellerstein, Devorah Kletenik On the Goal Value of a Boolean Function. Search on Bibsonomy ISAIM The full citation details ... 2016 DBLP  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik, Patrick Lin 0001 Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik, Patrick Lin 0001 Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline. Search on Bibsonomy CIAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Amol Deshpande, Lisa Hellerstein, Devorah Kletenik Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt Evaluation of DNF Formulas. Search on Bibsonomy ISAIM The full citation details ... 2014 DBLP  BibTeX  RDF
1Amol Deshpande, Lisa Hellerstein, Devorah Kletenik Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt Evaluation of DNF Formulas. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik On the gap between ess(f) and cnf_size(f). Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio Tight Bounds on Proper Equivalence Query Learning of DNF. Search on Bibsonomy COLT The full citation details ... 2012 DBLP  BibTeX  RDF
1Amol Deshpande, Lisa Hellerstein Parallel pipelined filter ordering with precedence constraints. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik On the gap between ess(f) and cnf_size(f). Search on Bibsonomy ISAIM The full citation details ... 2012 DBLP  BibTeX  RDF
1Lisa Hellerstein, Özgür Özkan, Linda Sellie Max-Throughput for (Conservative) k-of-n Testing Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio Tight Bounds on Proper Equivalence Query Learning of DNF Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Lisa Hellerstein, Devorah Kletenik On the gap between ess(f) and cnf_size(f) Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Lisa Hellerstein, Özgür Özkan, Linda Sellie Max-Throughput for (Conservative) k-of-n Testing. Search on Bibsonomy ISAAC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Bernard Rosell, Eric Bach, Soumya Ray, David Page Exploiting Product Distributions to Identify Relevant Variables of Correlation Immune Functions. Search on Bibsonomy J. Mach. Learn. Res. The full citation details ... 2009 DBLP  BibTeX  RDF
1Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu Algorithms for distributional and adversarial pipelined filter ordering problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Pipelined filter ordering, flow algorithms, selection ordering, query optimization
1Lisa Hellerstein, Hans Ulrich Simon Special Issue: Learning Theory 2006. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein Certificate Complexity and Exact Learning. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Amol Deshpande, Lisa Hellerstein Flow Algorithms for Parallel Query Optimization. Search on Bibsonomy ICDE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Rocco A. Servedio On PAC learning algorithms for rich Boolean function classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu Flow algorithms for two pipelined filter ordering problems. Search on Bibsonomy PODS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF flow algorithms, pipelined filter ordering, selection ordering, query optimization
1Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Vijay Raghavan 0002 Exact learning of DNF formulas using DNF hypotheses. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks Minimizing DNF Formulas and AC0 Circuits Given a Truth Table Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Yuval Marton, Ning Wu, Lisa Hellerstein On Compression-Based Text Classification. Search on Bibsonomy ECIR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page Why skewing works: learning difficult Boolean functions with greedy tree learners. Search on Bibsonomy ICML The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Bernard Rosell, Lisa Hellerstein Naïve Bayes with Higher Order Attributes. Search on Bibsonomy Canadian Conference on AI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Vijay Raghavan 0002 Exact learning of DNF formulas using DNF hypotheses. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF representations of boolean functions, algorithms, certificates, complexity theory, computational learning theory, disjunctive normal form, DNF
1Lisa Hellerstein On generalized constraints and certificates. Search on Bibsonomy Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Oya Ekin, Stephan Foldes, Peter L. Hammer, Lisa Hellerstein Equational characterizations of Boolean function classes. Search on Bibsonomy Discrete Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Joseph M. Hellerstein, Lisa Hellerstein, George Kollios On the Generation of 2-Dimensional Index Workloads. Search on Bibsonomy ICDT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt Complexity Theoretic Hardness Results for Query Learning. Search on Bibsonomy Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Nader H. Bshouty, Lisa Hellerstein Attribute-Efficient Learning in Query and Mistake-Bound Models. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Aaron Feigelson, Lisa Hellerstein Conjunctions of Unate DNF Formulas: Learning and Structure. Search on Bibsonomy Inf. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson On the Power of Finite Automata with Both Nondeterministic and Probabilistic States. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Aaron Feigelson, Lisa Hellerstein The Forbidden Projections of Unate Functions. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Collette R. Coullard, Lisa Hellerstein Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. Search on Bibsonomy Combinatorica The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins How Many Queries Are Needed to Learn? Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF exact identification, polynomial-query learning, polynomial-time learning, proper learning, certificates, membership queries, equivalence queries, polynomial-time hierarchy
1Nader H. Bshouty, Lisa Hellerstein Attribute-Efficient Learning in Query and Mistake-Bound Models. Search on Bibsonomy COLT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Aaron Feigelson, Lisa Hellerstein Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results. Search on Bibsonomy COLT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein Learning Boolean Read-Once Formulas over Generalized Bases. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Avrim Blum, Lisa Hellerstein, Nick Littlestone Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein Learning Arithmetic Read-Once Formulas. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan 0002, Dawn Wilkins How many queries are needed to learn? Search on Bibsonomy STOC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. Search on Bibsonomy Computational Complexity The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson Coding Techniques for Handling Failures in Large Disk Arrays. Search on Bibsonomy Algorithmica The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein Guest Editor's Introduction. Search on Bibsonomy Machine Learning The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Collette R. Coullard Learning Binary Matroid Ports. Search on Bibsonomy SODA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Aditi Dhagat, Lisa Hellerstein PAC Learning with Irrelevant Attributes Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF polynomial-time Occam algorithm, irrelevant attributes, Occam algorithm, decision lists, greedy set cover, polynomial-time, PAC learning
1Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). Search on Bibsonomy STOC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein Book Review: "Machine Learning: A Theoretical Approach". Search on Bibsonomy Machine Learning The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Dana Angluin, Lisa Hellerstein, Marek Karpinski Learning Read-Once Formulas with Queries. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF ?-formulas, exact identification, polynomial-time learning, read-once formulas, interpolation, membership queries, equivalence queries
1Lisa Hellerstein Functions that are Read-Once on a Subset of their Inputs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Howard Aizenstein, Lisa Hellerstein, Leonard Pitt Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF disjunctive normal, nonlearnability, polynomial-time membership, read-thrice DNF formulas, membership, boolean formulas, equivalence queries, exact learning
1Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. Search on Bibsonomy COLT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein Learning Arithmetic Read-Once Formulas Search on Bibsonomy STOC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Avrim Blum, Lisa Hellerstein, Nick Littlestone Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. Search on Bibsonomy COLT The full citation details ... 1991 DBLP  BibTeX  RDF
1Thomas R. Hancock, Lisa Hellerstein Learning Read-Once Formulas over Fields and Extended Bases. Search on Bibsonomy COLT The full citation details ... 1991 DBLP  BibTeX  RDF
1Lisa Hellerstein, Philip N. Klein, Robert Wilber On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Marek Karpinski Learning Read-Once Formulas Using Membership Queries. Search on Bibsonomy COLT The full citation details ... 1989 DBLP  BibTeX  RDF
1Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson Failure Correction Techniques for Large Disk Arrays. Search on Bibsonomy ASPLOS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Stephen Taylor, Lisa Hellerstein, Shmuel Safra, Ehud Shapiro Notes on the Complexity of Systolic Programs. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Ehud Shapiro Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. Search on Bibsonomy J. Log. Program. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Lisa Hellerstein, Ehud Shapiro Implementing Parallel Algorithms in Concurrent Prolog: The MAXFLOW Experience. Search on Bibsonomy SLP The full citation details ... 1984 DBLP  BibTeX  RDF
Displaying result #1 - #82 of 82 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license