| Publication | Date of Publication | Type |
|---|
| Simple PAC learning of simple decision lists | 2023-12-08 | Paper |
| The complexity of searching implicit graphs | 2022-09-27 | Paper |
| Global optimality in \(k\)-means clustering | 2020-09-08 | Paper |
| Closed-Set-Based Discovery of Representative Association Rules | 2020-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625699 | 2019-02-25 | Paper |
| The complexity of searching succinctly represented graphs | 2019-01-10 | Paper |
| Optimal distance networks of low degree for parallel computers | 2018-09-14 | Paper |
| Entailment among Probabilistic Implications | 2018-04-23 | Paper |
| Learning definite Horn formulas from closure queries | 2017-02-06 | Paper |
| Quantitative Redundancy in Partial Implications | 2015-06-16 | Paper |
| Construction and learnability of canonical Horn formulas | 2012-05-08 | Paper |
| Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices | 2011-05-27 | Paper |
| Closed-set-based Discovery of Bases of Association Rules | 2010-12-03 | Paper |
| Mining frequent closed rooted trees | 2010-10-07 | Paper |
| Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules | 2010-07-27 | Paper |
| Canonical Horn Representations and Query Learning | 2009-12-01 | Paper |
| Mining Frequent Closed Unordered Trees Through Natural Representations | 2009-03-06 | Paper |
| Characterizing Implications of Injective Partial Orders | 2009-03-06 | Paper |
| Query Learning and Certificates in Lattices | 2008-10-14 | Paper |
| Editors’ Introduction | 2008-09-04 | Paper |
| Provably fast training algorithms for support vector machines | 2008-06-06 | Paper |
| A general dimension for query learning | 2007-08-23 | Paper |
| Graph Transformations | 2007-06-21 | Paper |
| Formal Concept Analysis | 2005-12-02 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736021 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473548 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430281 | 2003-10-20 | Paper |
| The consistency dimension and distribution-dependent learning from queries. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148815 | 2002-09-22 | Paper |
| A new abstract combinatorial dimension for exact learning via queries | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942035 | 2001-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520312 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945214 | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955302 | 2000-05-25 | Paper |
| The structure of logarithmic advice complexity classes | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348124 | 1997-09-22 | Paper |
| Computational power of neural networks: a characterization in terms of Kolmogorov complexity | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336266 | 1997-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336267 | 1997-06-12 | Paper |
| A First-Order Isomorphism Theorem | 1997-05-26 | Paper |
| Adaptive logspace reducibility and parallel time | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321931 | 1995-02-06 | Paper |
| The query complexity of learning DFA | 1994-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281518 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694758 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4039803 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035689 | 1993-05-18 | Paper |
| Deciding bisimilarity is P-complete | 1993-02-04 | Paper |
| Logarithmic advice classes | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3996675 | 1992-09-17 | Paper |
| Strong and robustly strong polynomial-time reducibilities to sparse sets | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976035 | 1992-06-26 | Paper |
| Self-reducibility | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206394 | 1989-01-01 | Paper |
| Nonuniform complexity classes specified by lower and upper bounds | 1989-01-01 | Paper |
| Immunity and simplicity in relativizations of probabilistic complexity classes | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812229 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3765251 | 1987-01-01 | Paper |
| On characterizations of the class PSPACE/poly | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740234 | 1986-01-01 | Paper |
| The polynomial-time hierarchy and sparse oracles | 1986-01-01 | Paper |
| Sets with small generalized Kolmogorov complexity | 1986-01-01 | Paper |
| On \(\Delta ^ P_ 2\)-immunity | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753480 | 1986-01-01 | Paper |
| Uniform characterizations of non-uniform complexity measures | 1985-01-01 | Paper |
| Bi-immune sets for complexity classes | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692867 | 1985-01-01 | Paper |
| Simplicity, Relativizations and Nondeterminism | 1985-01-01 | Paper |
| On bounded query machines | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217603 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217605 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745282 | 1984-01-01 | Paper |
| A note on a theorem by Ladner | 1982-01-01 | Paper |
