( en | de | ru )

 

Disambiguation of "Hellerstein, Lisa"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack.

, , and . ACM Trans. Algorithms, 12 (3): 42:1-42:28 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Gaëlle Lisack

Oleg Lisagor

Hamel Lisa

Jacob Lisakafu

Tautvydas Lisauskas

 

Other publications of authors with the same name

Algorithms for distributional and adversarial pipelined filter ordering problems., , , and . ACM Trans. Algorithms, 5 (2): 24:1-24:34 (2009)Why skewing works: learning difficult Boolean functions with greedy tree learners., , , and . ICML, volume 119 of ACM International Conference Proceeding Series, page 728-735. ACM, (2005)Revisiting the Approximation Bound for Stochastic Submodular Cover., and . J. Artif. Intell. Res., (2018)Exact learning of DNF formulas using DNF hypotheses., and . STOC, page 465-473. ACM, (2002)Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover, , and . CoRR, (2013)Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games., , and . Operations Research, 67 (3): 731-743 (2019)Complexity Theoretic Hardness Results for Query Learning., , , and . Comput. Complex., 7 (1): 19-53 (1998)Tight Bounds on Proper Equivalence Query Learning of DNF., , , and . COLT, volume 23 of JMLR Proceedings, page 31.1-31.18. JMLR.org, (2012)Quickly Determining Who Won an Election., , and . ITCS, volume 287 of LIPIcs, page 61:1-61:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Polyhedral Approach to Some Max-min Problems., and . CoRR, (2021)