| Publication | Date of Publication | Type |
|---|
Learning ordered binary decision diagrams
Lecture Notes in Computer Science | 2023-12-08 | Paper |
A new method of moments for latent variable models
Machine Learning | 2018-12-07 | Paper |
An efficient closed frequent itemset miner for the MOA stream mining system
AI Communications | 2017-11-07 | Paper |
Learning probability distributions generated by finite-state machines
Topics in Grammatical Inference | 2017-02-15 | Paper |
Learning read-constant polynomials of constant degree modulo composites
Theory of Computing Systems | 2015-02-05 | Paper |
Adaptively learning probabilistic deterministic automata from data streams
Machine Learning | 2014-12-05 | Paper |
Learning probabilistic automata: a study in state distinguishability
Theoretical Computer Science | 2013-03-04 | Paper |
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Computer Science – Theory and Applications | 2011-06-17 | Paper |
A lower bound for learning distributions generated by probabilistic automata
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Learning PDFA with Asynchronous Transitions
Grammatical Inference: Theoretical Results and Applications | 2010-09-10 | Paper |
An Algebraic Perspective on Boolean Function Learning
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Self-adaptive utility-based web session management
Computer Networks | 2009-10-26 | Paper |
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
Grammatical Inference: Algorithms and Applications | 2008-10-16 | Paper |
Tractable Clones of Polynomials over Semigroups
Principles and Practice of Constraint Programming - CP 2005 | 2008-09-09 | Paper |
Learning expressions and programs over monoids
Information and Computation | 2006-04-28 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Non-automatizability of bounded-depth Frege proofs
Computational Complexity | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2083809 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1962825 (Why is no real title available?) | 2003-08-11 | Paper |
Monotone proofs of the pigeon hole principle
Mathematical Logic Quarterly (MLQ) | 2002-06-16 | Paper |
Adaptive sampling methods for scaling up knowledge discovery algorithms
Data Mining and Knowledge Discovery | 2002-05-30 | Paper |
| scientific article; zbMATH DE number 1688371 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670820 (Why is no real title available?) | 2001-11-11 | 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 |
Bounding the expected length of longest common subsequences and forests
Theory of Computing Systems | 1999-06-28 | 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 |
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences | 1996-11-26 | Paper |
Bounding the complexity of advice functions
Journal of Computer and System Sciences | 1995-07-24 | Paper |
Structural analysis of polynomial-time query learnability
Mathematical Systems Theory | 1995-03-20 | Paper |
The query complexity of learning DFA
New Generation Computing | 1994-11-20 | Paper |
On the Computational Complexity of Small Descriptions
SIAM Journal on Computing | 1994-11-13 | Paper |
A positive relativization of polynomial time versus polylog space
Information Processing Letters | 1993-10-03 | 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 |
| scientific article; zbMATH DE number 4081538 (Why is no real title available?) | 1988-01-01 | Paper |
