| Publication | Date of Publication | Type |
|---|
| A local search algorithm for the min-sum submodular cover problem | 2024-09-11 | Paper |
| Adaptivity gaps for the stochastic Boolean function evaluation problem | 2023-07-25 | Paper |
| A game theoretic approach to a problem in polymatroid maximization | 2022-11-17 | Paper |
| Algorithms for the unit-cost stochastic score classification problem | 2022-10-06 | Paper |
| A General Framework for Approximating Min Sum Ordering Problems | 2022-07-01 | Paper |
| The stochastic Boolean function evaluation problem for symmetric Boolean functions | 2022-01-13 | Paper |
| A Tight Bound for Stochastic Submodular Cover | 2021-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009596 | 2021-08-04 | Paper |
| A Game Theoretic Approach to a Problem in Polymatroid Maximization | 2021-04-20 | Paper |
| Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games | 2020-10-20 | Paper |
| Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover | 2019-06-20 | Paper |
| Algorithms for distributional and adversarial pipelined filter ordering problems | 2018-11-05 | Paper |
| Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack | 2018-11-05 | Paper |
| Revisiting the Approximation Bound for Stochastic Submodular Cover | 2018-11-01 | Paper |
| Submodular goal value of Boolean functions | 2018-02-22 | Paper |
| Evaluation of monotone DNF formulas | 2017-04-12 | Paper |
| Scenario Submodular Cover | 2017-04-04 | Paper |
| Max-throughput for (conservative) \(k\)-of-\(n\) testing | 2017-03-03 | Paper |
| On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) | 2016-09-01 | Paper |
| Coding techniques for handling failures in large disk arrays | 2016-06-24 | Paper |
| Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline | 2015-09-21 | Paper |
| Parallel pipelined filter ordering with precedence constraints | 2014-09-09 | Paper |
| On the gap between \(\mathit{ess}(f)\) and \(\mathit{cnf}_{-}\mathit{size}(f)\) | 2012-11-22 | Paper |
| Exploiting product distributions to identify relevant variables of correlation immune functions | 2012-04-17 | Paper |
| Max-Throughput for (Conservative) k-of-n Testing | 2011-12-16 | Paper |
| Exact learning of DNF formulas using DNF hypotheses | 2010-08-05 | Paper |
| Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table | 2009-03-16 | Paper |
| On PAC learning algorithms for rich Boolean function classes | 2007-09-28 | Paper |
| Exact learning of DNF formulas using DNF hypotheses | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234065 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230377 | 2002-01-20 | Paper |
| On generalized constraints and certificates | 2001-07-26 | Paper |
| Equational characterizations of Boolean function classes | 2000-11-07 | Paper |
| Attribute-efficient learning in query and mistake-bound models | 2000-09-27 | Paper |
| Complexity theoretic hardness results for query learning | 1998-10-26 | Paper |
| Conjunctions of unate DNF formulas: Learning and structure | 1998-09-20 | Paper |
| On the Power of Finite Automata with both Nondeterministic and Probabilistic States | 1998-05-10 | Paper |
| The forbidden projections of unate functions | 1998-02-24 | Paper |
| How many queries are needed to learn? | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128892 | 1997-11-18 | Paper |
| Independence and port oracles for matroids, with an application to computational learning theory | 1996-11-24 | Paper |
| Learning Arithmetic Read-Once Formulas | 1996-01-28 | Paper |
| Learning Boolean read-once formulas over generalized bases | 1995-08-21 | Paper |
| Learning in the presence of finitely or infinitely many irrelevant attributes | 1995-07-05 | Paper |
| An algorithm to learn read-once threshold formulas, and transformations between learning models | 1994-06-19 | Paper |
| Functions that are read-once on a subset of their inputs | 1994-01-30 | Paper |
| Learning read-once formulas with queries | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013534 | 1992-09-27 | Paper |
| On the time-space complexity of reachability queries for preprocessed graphs | 1990-01-01 | Paper |
| Implementing parallel algorithms in concurrent prolog: The Maxflow experience | 1986-01-01 | Paper |
