| Publication | Date of Publication | Type |
|---|
Simple PAC learning of simple decision lists
Lecture Notes in Computer Science | 2023-12-08 | Paper |
The complexity of searching implicit graphs
Artificial Intelligence | 2022-09-27 | Paper |
Global optimality in \(k\)-means clustering
Information Sciences | 2020-09-08 | Paper |
Closed-Set-Based Discovery of Representative Association Rules
International Journal of Foundations of Computer Science | 2020-02-21 | Paper |
Relative entailment among probabilistic implications
(available as arXiv preprint) | 2019-02-25 | Paper |
The complexity of searching succinctly represented graphs
Automata, Languages and Programming | 2019-01-10 | Paper |
Optimal distance networks of low degree for parallel computers
IEEE Transactions on Computers | 2018-09-14 | Paper |
Entailment among probabilistic implications
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Learning definite Horn formulas from closure queries
Theoretical Computer Science | 2017-02-06 | Paper |
Quantitative Redundancy in Partial Implications
Formal Concept Analysis | 2015-06-16 | Paper |
Construction and learnability of canonical Horn formulas
Machine Learning | 2012-05-08 | Paper |
Border algorithms for computing Hasse diagrams of arbitrary lattices.
Formal Concept Analysis | 2011-05-27 | Paper |
| Closed-set-based Discovery of Bases of Association Rules | 2010-12-03 | Paper |
Mining frequent closed rooted trees
Machine Learning | 2010-10-07 | Paper |
Redundancy, deduction schemes, and minimum-size bases for association rules
Logical Methods in Computer Science | 2010-07-27 | Paper |
Canonical Horn representations and query learning
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Mining Frequent Closed Unordered Trees Through Natural Representations
Conceptual Structures: Knowledge Architectures for Smart Applications | 2009-03-06 | Paper |
Characterizing Implications of Injective Partial Orders
Conceptual Structures: Knowledge Architectures for Smart Applications | 2009-03-06 | Paper |
Query Learning and Certificates in Lattices
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Editors’ Introduction
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Provably fast training algorithms for support vector machines
Theory of Computing Systems | 2008-06-06 | Paper |
A general dimension for query learning
Journal of Computer and System Sciences | 2007-08-23 | Paper |
Graph Transformations
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Formal Concept Analysis
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Discovery Science
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2084826 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2080653 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1988954 (Why is no real title available?) | 2003-10-20 | Paper |
The consistency dimension and distribution-dependent learning from queries.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1804113 (Why is no real title available?) | 2002-09-22 | Paper |
A new abstract combinatorial dimension for exact learning via queries
Journal of Computer and System Sciences | 2002-07-04 | Paper |
| scientific article; zbMATH DE number 1418473 (Why is no real title available?) | 2001-03-12 | Paper |
| scientific article; zbMATH DE number 1542859 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1424024 (Why is no real title available?) | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1453030 (Why is no real title available?) | 2000-05-25 | Paper |
The structure of logarithmic advice complexity classes
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1048038 (Why is no real title available?) | 1997-09-22 | Paper |
Computational power of neural networks: a characterization in terms of Kolmogorov complexity
IEEE Transactions on Information Theory | 1997-07-23 | Paper |
| scientific article; zbMATH DE number 1008506 (Why is no real title available?) | 1997-06-12 | Paper |
| scientific article; zbMATH DE number 1008507 (Why is no real title available?) | 1997-06-12 | Paper |
A First-Order Isomorphism Theorem
SIAM Journal on Computing | 1997-05-26 | Paper |
Adaptive logspace reducibility and parallel time
Mathematical Systems Theory | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 719756 (Why is no real title available?) | 1995-02-06 | Paper |
The query complexity of learning DFA
New Generation Computing | 1994-11-20 | Paper |
| scientific article; zbMATH DE number 512825 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 219271 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 192916 (Why is no real title available?) | 1993-06-05 | Paper |
| scientific article; zbMATH DE number 176523 (Why is no real title available?) | 1993-05-18 | Paper |
Deciding bisimilarity is P-complete
Formal Aspects of Computing | 1993-02-04 | Paper |
Logarithmic advice classes
Theoretical Computer Science | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 46423 (Why is no real title available?) | 1992-09-17 | Paper |
Strong and robustly strong polynomial-time reducibilities to sparse sets
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 18632 (Why is no real title available?) | 1992-06-26 | Paper |
Self-reducibility
Journal of Computer and System Sciences | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4126690 (Why is no real title available?) | 1989-01-01 | Paper |
Nonuniform complexity classes specified by lower and upper bounds
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
Immunity and simplicity in relativizations of probabilistic complexity classes
RAIRO - Theoretical Informatics and Applications | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4081538 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4022646 (Why is no real title available?) | 1987-01-01 | Paper |
On characterizations of the class PSPACE/poly
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3974293 (Why is no real title available?) | 1986-01-01 | Paper |
The polynomial-time hierarchy and sparse oracles
Journal of the ACM | 1986-01-01 | Paper |
Sets with small generalized Kolmogorov complexity
Acta Informatica | 1986-01-01 | Paper |
On \(\Delta ^ P_ 2\)-immunity
Information Processing Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3990861 (Why is no real title available?) | 1986-01-01 | Paper |
Uniform characterizations of non-uniform complexity measures
Information and Control | 1985-01-01 | Paper |
Bi-immune sets for complexity classes
Mathematical Systems Theory | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917710 (Why is no real title available?) | 1985-01-01 | Paper |
Simplicity, Relativizations and Nondeterminism
SIAM Journal on Computing | 1985-01-01 | Paper |
On bounded query machines
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3883611 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3883613 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3980490 (Why is no real title available?) | 1984-01-01 | Paper |
A note on a theorem by Ladner
Information Processing Letters | 1982-01-01 | Paper |
