| Publication | Date of Publication | Type |
|---|
| Extended formulations via decision diagrams | 2024-08-22 | Paper |
| Improved algorithms for online load balancing | 2022-03-24 | Paper |
Improved algorithms for online load balancing
(available as arXiv preprint) | 2022-03-24 | Paper |
| The cohomology of framed moduli spaces and the coordinate ring of torus fixed points of quotient singularities | 2021-09-29 | 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
Neural Computation | 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
Theoretical Computer Science | 2020-01-16 | Paper |
An Online Policy Gradient Algorithm for Markov Decision Processes with Continuous States and Actions
Neural Computation | 2019-06-04 | Paper |
Boosting over non-deterministic ZDDs
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
Online Linear Optimization for Job Scheduling Under Precedence Constraints
Lecture Notes in Computer Science | 2016-11-30 | Paper |
A combinatorial metrical task system problem under the uniform metric
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Bandit online optimization over the permutahedron
Theoretical Computer Science | 2016-10-21 | Paper |
Bandit online optimization over the permutahedron
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Efficient algorithms for combinatorial online prediction
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Combinatorial online prediction via metarounding
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Online prediction under submodular constraints
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Online linear optimization over permutations
Algorithms and Computation | 2011-12-16 | Paper |
Approximate reduction from AUC maximization to 1-norm soft margin optimization
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Theory and Algorithm for Learning with Dissimilarity Functions
Neural Computation | 2009-05-19 | Paper |
Smooth Boosting for Margin-Based Ranking
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Smooth Boosting Using an Information-Based Criterion
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
A simple boosting algorithm using multi-way branching decision trees
Theory of Computing Systems | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080650 (Why is no real title available?) | 2004-08-04 | Paper |
