| Publication | Date of Publication | Type |
|---|
| Extended formulations via decision diagrams | 2024-08-22 | Paper |
| Learning orthogonal F-Horn formulas | 2023-12-08 | Paper |
| Improved algorithms for online load balancing | 2022-03-24 | Paper |
| Decision diagrams for solving a job scheduling problem under precedence constraints | 2020-12-16 | Paper |
| Theory and Algorithms for Shapelet-Based Multiple-Instance Learning | 2020-11-02 | Paper |
| Succinct representation of linear extensions via MDDs and its application to scheduling under precedence constraints | 2020-02-25 | Paper |
| Boosting over non-deterministic ZDDs | 2020-01-16 | Paper |
| Boosting over non-deterministic ZDDs | 2018-06-15 | Paper |
| Online Linear Optimization for Job Scheduling Under Precedence Constraints | 2016-11-30 | Paper |
| A Combinatorial Metrical Task System Problem Under the Uniform Metric | 2016-11-09 | Paper |
| Bandit online optimization over the permutahedron | 2016-10-21 | Paper |
| Lower Bounds for Linear Decision Trees with Bounded Weights | 2015-02-20 | Paper |
| Bandit Online Optimization over the Permutahedron | 2015-01-14 | Paper |
| Efficient Algorithms for Combinatorial Online Prediction | 2013-11-06 | Paper |
| Combinatorial Online Prediction via Metarounding | 2013-11-06 | Paper |
| Online Prediction under Submodular Constraints | 2012-10-16 | Paper |
| Energy and depth of threshold circuits | 2012-04-03 | Paper |
| Online Linear Optimization over Permutations | 2011-12-16 | Paper |
| Approximate Reduction from AUC Maximization to 1-Norm Soft Margin Optimization | 2011-10-19 | Paper |
| Lower Bounds for Linear Decision Trees via an Energy Complexity Argument | 2011-08-17 | Paper |
| Size-energy tradeoffs for unate circuits computing symmetric Boolean functions | 2011-02-21 | Paper |
| Learnability of exclusive-or expansion based on monotone DNF formulas | 2010-04-27 | Paper |
| Energy Complexity and Depth of Threshold Circuits | 2009-10-20 | Paper |
| Size and Energy of Threshold Circuits Computing Mod Functions | 2009-10-16 | Paper |
| Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity | 2008-11-18 | Paper |
| Smooth Boosting for Margin-Based Ranking | 2008-10-14 | Paper |
| Editors’ Introduction | 2008-08-19 | Paper |
| Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments | 2008-07-10 | Paper |
| Aggregating Strategy for Online Auctions | 2007-09-10 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| 10.1162/1532443041424328 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046696 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044515 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044512 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473253 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470578 | 2004-07-01 | Paper |
| Top-down decision tree learning as information based boosting | 2003-05-14 | Paper |
| Predicting nearly as well as the best pruning of a planar decision graph. | 2003-01-21 | Paper |
| Proper learning algorithm for functions of \(k\) terms under smooth distributions. | 2003-01-14 | Paper |
| Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme | 2001-08-20 | Paper |
| The learnability of exclusive-or expansions based on monotone DNF formulas | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955323 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937854 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703450 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703860 | 1999-12-01 | Paper |
| Learning orthogonal F-Horn formulas | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126930 | 1997-04-03 | Paper |
