| Publication | Date of Publication | Type |
|---|
The zero-visibility cops and robber game on graph products
Theoretical Computer Science | 2024-06-28 | Paper |
| Inferring symbolic automata | 2024-04-10 | Paper |
New results on the zero-visibility cops and robber game
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Inferring Symbolic Automata
Logical Methods in Computer Science | 2023-08-26 | Paper |
Fast searching on \(k\)-combinable graphs
Algorithmic Aspects in Information and Management | 2023-07-07 | Paper |
Fast searching on cactus graphs
Journal of Combinatorial Optimization | 2023-04-17 | Paper |
| Aggregating preferences represented by conditional preference networks | 2023-03-31 | Paper |
A simple method for proving lower bounds in the zero-visibility cops and robber game
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
| A partition approach to lower bounds for zero-visibility cops and robber | 2020-02-25 | Paper |
Finitely distinguishable erasing pattern languages
Theoretical Computer Science | 2020-01-29 | Paper |
The complexity of exact learning of acyclic conditional preference networks from swap examples
Artificial Intelligence | 2020-01-20 | Paper |
| Erasing pattern languages distinguishable by a finite number of strings | 2019-01-10 | Paper |
| Preference-based teaching of unions of geometric objects | 2019-01-10 | Paper |
The fast search number of a complete \(k\)-partite graph
Algorithmica | 2018-10-18 | Paper |
On the teaching complexity of linear sets
Theoretical Computer Science | 2018-03-12 | Paper |
Distinguishing pattern languages with membership examples
Information and Computation | 2017-09-28 | Paper |
| Preference-based teaching | 2017-09-27 | Paper |
Preference-based teaching
(available as arXiv preprint) | 2017-09-27 | Paper |
A survey on recent results on partial learning
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
Fast searching on complete \(k\)-partite graphs
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the Teaching Complexity of Linear Sets
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Combining models of approximation with partial learning
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Classifying the arithmetical complexity of teaching models
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Order compression schemes
Theoretical Computer Science | 2016-02-26 | Paper |
Partial learning of recursively enumerable languages
Theoretical Computer Science | 2016-02-26 | Paper |
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces
Artificial Intelligence | 2015-12-23 | Paper |
A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
International Journal of Computational Geometry & Applications | 2015-04-22 | Paper |
Predicting optimal solution cost with conditional probabilities
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
Generalizing labeled and unlabeled sample compression to multi-label concept classes
Lecture Notes in Computer Science | 2015-01-14 | Paper |
| Recursive teaching dimension, VC-dimension and sample compression | 2014-12-08 | Paper |
Algebraic methods proving Sauer's bound for teaching complexity
Theoretical Computer Science | 2014-10-31 | Paper |
Distinguishing pattern languages with membership examples
Language and Automata Theory and Applications | 2014-03-31 | Paper |
| Models of cooperative teaching and learning | 2014-02-03 | Paper |
Order compression schemes
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Partial learning of recursively enumerable languages
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Predicting the size of IDA\(^*\)'s search tree
Artificial Intelligence | 2013-08-23 | Paper |
Learning without coding
Theoretical Computer Science | 2013-03-04 | Paper |
Sauer's bound for a notion of teaching complexity
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Polynomial-time algorithms for learning typed pattern languages
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Learning heuristic functions for large state spaces
Artificial Intelligence | 2012-05-23 | Paper |
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
Algorithmic Decision Theory | 2011-10-28 | Paper |
Learning relational patterns
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Erratum: ``Learning without coding
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Competitive search in symmetric trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The computational complexity of avoiding spurious states in state space abstraction
Artificial Intelligence | 2011-01-31 | Paper |
Recursive teaching dimension, learning complexity, and maximum classes
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Learning without Coding
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Incremental learning with temporary memory
Theoretical Computer Science | 2010-07-07 | Paper |
Models of active learning in group-structured state spaces
Information and Computation | 2010-04-08 | Paper |
Intrinsic complexity of uniform learning
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Formal language identification: query learning vs. gold-style learning
Information Processing Letters | 2009-07-21 | Paper |
Learning with Temporary Memory
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Active Learning of Group-Structured Environments
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Towards a Better Understanding of Incremental Learning
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science | 2008-05-28 | Paper |
Learning recursive functions: A survey
Theoretical Computer Science | 2008-05-28 | Paper |
A general comparison of language learning from examples and from queries
Theoretical Computer Science | 2007-12-19 | Paper |
Some natural conditions on incremental learning
Information and Computation | 2007-11-21 | Paper |
An approach to intrinsic complexity of uniform learning
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Relations between Gold-style learning and query learning
Information and Computation | 2006-01-10 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Increasing the power of uniform inductive learners
Journal of Computer and System Sciences | 2005-06-13 | Paper |
| scientific article; zbMATH DE number 2089363 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080662 (Why is no real title available?) | 2004-08-04 | Paper |
Separation of uniform learning classes.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1804102 (Why is no real title available?) | 2002-09-22 | Paper |
