The following pages link to Lisa Hellerstein (Q513284):
Displaying 49 items.
- (Q297234) (redirect page) (← links)
- Coding techniques for handling failures in large disk arrays (Q297238) (← links)
- Max-throughput for (conservative) \(k\)-of-\(n\) testing (Q513287) (← links)
- Evaluation of monotone DNF formulas (Q521804) (← links)
- On the time-space complexity of reachability queries for preprocessed graphs (Q916395) (← links)
- Complexity theoretic hardness results for query learning (Q1266164) (← links)
- Attribute-efficient learning in query and mistake-bound models (Q1271616) (← links)
- Functions that are read-once on a subset of their inputs (Q1308741) (← links)
- An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
- The forbidden projections of unate functions (Q1364471) (← links)
- Conjunctions of unate DNF formulas: Learning and structure (Q1383160) (← links)
- Submodular goal value of Boolean functions (Q1701106) (← links)
- On the gap between \(\mathit{ess}(f)\) and \(\mathit{cnf}_{-}\mathit{size}(f)\) (Q1759859) (← links)
- On generalized constraints and certificates (Q1841905) (← links)
- Learning in the presence of finitely or infinitely many irrelevant attributes (Q1892203) (← links)
- Learning Boolean read-once formulas over generalized bases (Q1894458) (← links)
- Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
- Equational characterizations of Boolean function classes (Q1969777) (← links)
- The stochastic Boolean function evaluation problem for symmetric Boolean functions (Q2065798) (← links)
- Algorithms for the unit-cost stochastic score classification problem (Q2088594) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) (Q2817662) (← links)
- (Q2880978) (← links)
- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline (Q2947023) (← links)
- Scenario Submodular Cover (Q2971162) (← links)
- Max-Throughput for (Conservative) k-of-n Testing (Q3104671) (← links)
- (Q3128892) (← links)
- Parallel pipelined filter ordering with precedence constraints (Q3189084) (← links)
- Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table (Q3614150) (← links)
- (Q4013534) (← links)
- Learning read-once formulas with queries (Q4033838) (← links)
- (Q4230377) (← links)
- (Q4234065) (← links)
- How many queries are needed to learn? (Q4371689) (← links)
- On the Power of Finite Automata with both Nondeterministic and Probabilistic States (Q4388897) (← links)
- Implementing parallel algorithms in concurrent prolog: The Maxflow experience (Q4720774) (← links)
- Learning Arithmetic Read-Once Formulas (Q4852621) (← links)
- Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack (Q4962618) (← links)
- Algorithms for distributional and adversarial pipelined filter ordering problems (Q4962790) (← links)
- Revisiting the Approximation Bound for Stochastic Submodular Cover (Q4963220) (← links)
- (Q5009596) (← links)
- A Tight Bound for Stochastic Submodular Cover (Q5009701) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover (Q5384069) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5901048) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- A local search algorithm for the min-sum submodular cover problem (Q6602419) (← links)
