| Publication | Date of Publication | Type |
|---|
| Multi-agent reinforcement learning for decentralized stable matching | 2023-03-31 | Paper |
| Reasoning with PCP-Nets | 2022-02-07 | Paper |
| The complexity of campaigning | 2018-10-25 | Paper |
| The complexity of probabilistic lobbying | 2018-08-17 | Paper |
| Uniform Random Generation and Dominance Testing for CP-Nets | 2017-10-24 | Paper |
| On the complexity of bribery and manipulation in tournaments with uncertain information | 2015-12-23 | Paper |
| Complexity of finite-horizon Markov decision process problems | 2015-12-17 | Paper |
| Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop | 2015-11-04 | Paper |
| More theory revision with queries (extended abstract) | 2014-09-26 | Paper |
| Learning CP-net Preferences Online from User Queries | 2013-12-17 | Paper |
| Roles and Teams Hedonic Game | 2013-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3112630 | 2012-01-12 | Paper |
| A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes | 2011-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093325 | 2011-10-12 | Paper |
| Ranking policies in discrete Markov decision processes | 2011-02-03 | Paper |
| The Complexity of Probabilistic Lobbying | 2009-11-17 | Paper |
| Finding Best k Policies | 2009-11-17 | Paper |
| Complexity of DNF minimization and isomorphism testing for monotone formulas | 2008-08-22 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| A framework for management of semistructured probabilistic data | 2006-05-02 | Paper |
| Theory revision with queries: Horn, read-once, and parity formulas | 2006-02-07 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Databases for interval probabilities | 2005-01-12 | Paper |
| Tally NP sets and easy census functions. | 2003-01-14 | Paper |
| Theory revision with queries: DNF formulas | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717785 | 2001-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699290 | 2000-11-08 | Paper |
| An algorithm for the class of pure implicational formulas | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258591 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218122 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246719 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217586 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4215779 | 1998-10-28 | Paper |
| L-Printable Sets | 1998-09-21 | Paper |
| Sharply bounded alternation and quasilinear time | 1998-05-26 | Paper |
| Scalability and the isomorphism problem | 1997-02-27 | Paper |
| Relativized isomorphisms of NP-complete sets | 1993-10-18 | Paper |
| Nondeterminism within $P^ * $ | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035683 | 1993-05-18 | Paper |
| Polynomial-time compression | 1993-01-16 | Paper |
