| Publication | Date of Publication | Type |
|---|
| Quickly determining who won an election | 2025-11-04 | Paper |
| A local search algorithm for the min-sum submodular cover problem | 2024-09-11 | Paper |
Adaptivity gaps for the stochastic Boolean function evaluation problem
Approximation and Online Algorithms | 2023-07-25 | Paper |
A game theoretic approach to a problem in polymatroid maximization
European Journal of Operational Research | 2022-11-17 | Paper |
Algorithms for the unit-cost stochastic score classification problem
Algorithmica | 2022-10-06 | Paper |
A General Framework for Approximating Min Sum Ordering Problems
INFORMS Journal on Computing | 2022-07-01 | Paper |
The stochastic Boolean function evaluation problem for symmetric Boolean functions
Discrete Applied Mathematics | 2022-01-13 | Paper |
A Tight Bound for Stochastic Submodular Cover
Journal of Artificial Intelligence Research | 2021-08-05 | Paper |
scientific article; zbMATH DE number 7378706 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
A Game Theoretic Approach to a Problem in Polymatroid Maximization
(available as arXiv preprint) | 2021-04-20 | Paper |
Solving zero-sum games using best-response oracles with applications to search games
Operations Research | 2020-10-20 | Paper |
Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Revisiting the approximation bound for stochastic submodular cover
Journal of Artificial Intelligence Research | 2018-11-01 | Paper |
Submodular goal value of Boolean functions
Discrete Applied Mathematics | 2018-02-22 | Paper |
Evaluation of monotone DNF formulas
Algorithmica | 2017-04-12 | Paper |
Scenario submodular cover
Approximation and Online Algorithms | 2017-04-04 | Paper |
Max-throughput for (conservative) \(k\)-of-\(n\) testing
Algorithmica | 2017-03-03 | Paper |
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Coding techniques for handling failures in large disk arrays
Algorithmica | 2016-06-24 | Paper |
Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the gap between \(\mathit{ess}(f)\) and \(\mathit{cnf}_{-}\mathit{size}(f)\)
Discrete Applied Mathematics | 2012-11-22 | Paper |
Exploiting product distributions to identify relevant variables of correlation immune functions
Journal of Machine Learning Research (JMLR) | 2012-04-17 | Paper |
Max-throughput for (conservative) \(k\)-of-\(n\) testing
Algorithms and Computation | 2011-12-16 | Paper |
Exact learning of DNF formulas using DNF hypotheses
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
SIAM Journal on Computing | 2009-03-16 | Paper |
On PAC learning algorithms for rich Boolean function classes
Theoretical Computer Science | 2007-09-28 | Paper |
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences | 2005-06-13 | Paper |
| scientific article; zbMATH DE number 1263194 (Why is no real title available?) | 2002-02-03 | Paper |
| scientific article; zbMATH DE number 1256690 (Why is no real title available?) | 2002-01-20 | Paper |
On generalized constraints and certificates
Discrete Mathematics | 2001-07-26 | Paper |
Equational characterizations of Boolean function classes
Discrete Mathematics | 2000-11-07 | Paper |
Attribute-efficient learning in query and mistake-bound models
Journal of Computer and System Sciences | 2000-09-27 | Paper |
Complexity theoretic hardness results for query learning
Computational Complexity | 1998-10-26 | Paper |
Conjunctions of unate DNF formulas: Learning and structure
Information and Computation | 1998-09-20 | Paper |
On the Power of Finite Automata with both Nondeterministic and Probabilistic States
SIAM Journal on Computing | 1998-05-10 | Paper |
The forbidden projections of unate functions
Discrete Applied Mathematics | 1998-02-24 | Paper |
How many queries are needed to learn?
Journal of the ACM | 1998-01-22 | Paper |
| scientific article; zbMATH DE number 1003264 (Why is no real title available?) | 1997-11-18 | Paper |
Independence and port oracles for matroids, with an application to computational learning theory
Combinatorica | 1996-11-24 | Paper |
Learning Arithmetic Read-Once Formulas
SIAM Journal on Computing | 1996-01-28 | Paper |
Learning Boolean read-once formulas over generalized bases
Journal of Computer and System Sciences | 1995-08-21 | Paper |
Learning in the presence of finitely or infinitely many irrelevant attributes
Journal of Computer and System Sciences | 1995-07-05 | Paper |
An algorithm to learn read-once threshold formulas, and transformations between learning models
Computational Complexity | 1994-06-19 | Paper |
Functions that are read-once on a subset of their inputs
Discrete Applied Mathematics | 1994-01-30 | Paper |
Learning read-once formulas with queries
Journal of the ACM | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 67616 (Why is no real title available?) | 1992-09-27 | Paper |
On the time-space complexity of reachability queries for preprocessed graphs
Information Processing Letters | 1990-01-01 | Paper |
Implementing parallel algorithms in concurrent prolog: The Maxflow experience
The Journal of Logic Programming | 1986-01-01 | Paper |
