| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6124953 | 2024-04-10 | Paper |
| New results on the zero-visibility cops and robber game | 2024-02-23 | Paper |
| Inferring Symbolic Automata | 2023-08-26 | Paper |
| Fast searching on \(k\)-combinable graphs | 2023-07-07 | Paper |
| Fast searching on cactus graphs | 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 | 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 | 2020-01-29 | Paper |
| The complexity of exact learning of acyclic conditional preference networks from swap examples | 2020-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645637 | 2019-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645644 | 2019-01-10 | Paper |
| The fast search number of a complete \(k\)-partite graph | 2018-10-18 | Paper |
| On the teaching complexity of linear sets | 2018-03-12 | Paper |
| Distinguishing pattern languages with membership examples | 2017-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5361292 | 2017-09-27 | Paper |
| A Survey on Recent Results on Partial Learning | 2017-06-09 | Paper |
| Fast Searching on Complete k-partite Graphs | 2017-02-01 | Paper |
| Combining Models of Approximation with Partial Learning | 2016-11-30 | Paper |
| On the Teaching Complexity of Linear Sets | 2016-11-30 | Paper |
| Classifying the Arithmetical Complexity of Teaching Models | 2016-11-09 | Paper |
| Partial learning of recursively enumerable languages | 2016-02-26 | Paper |
| Order compression schemes | 2016-02-26 | Paper |
| Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces | 2015-12-23 | Paper |
| A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS | 2015-04-22 | Paper |
| Predicting optimal solution cost with conditional probabilities | 2015-02-05 | Paper |
| Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes | 2015-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934114 | 2014-12-08 | Paper |
| Algebraic methods proving Sauer's bound for teaching complexity | 2014-10-31 | Paper |
| Distinguishing Pattern Languages with Membership Examples | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396611 | 2014-02-03 | Paper |
| Partial Learning of Recursively Enumerable Languages | 2013-11-06 | Paper |
| Order Compression Schemes | 2013-11-06 | Paper |
| Predicting the size of IDA\(^*\)'s search tree | 2013-08-23 | Paper |
| Learning without coding | 2013-03-04 | Paper |
| Sauer’s Bound for a Notion of Teaching Complexity | 2012-10-16 | Paper |
| Polynomial-Time Algorithms for Learning Typed Pattern Languages | 2012-06-08 | Paper |
| Learning heuristic functions for large state spaces | 2012-05-23 | Paper |
| Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach | 2011-10-28 | Paper |
| Learning Relational Patterns | 2011-10-19 | Paper |
| Erratum: Learning without Coding | 2011-10-19 | Paper |
| Competitive Search in Symmetric Trees | 2011-08-12 | Paper |
| The computational complexity of avoiding spurious states in state space abstraction | 2011-01-31 | Paper |
| Recursive Teaching Dimension, Learning Complexity, and Maximum Classes | 2010-10-01 | Paper |
| Learning without Coding | 2010-10-01 | Paper |
| Incremental learning with temporary memory | 2010-07-07 | Paper |
| Models of active learning in group-structured state spaces | 2010-04-08 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Formal language identification: query learning vs. gold-style learning | 2009-07-21 | Paper |
| Active Learning of Group-Structured Environments | 2008-10-14 | Paper |
| Learning with Temporary Memory | 2008-10-14 | Paper |
| Towards a Better Understanding of Incremental Learning | 2008-09-04 | Paper |
| Learning recursive functions: A survey | 2008-05-28 | Paper |
| Learning indexed families of recursive languages from positive data: A survey | 2008-05-28 | Paper |
| A general comparison of language learning from examples and from queries | 2007-12-19 | Paper |
| Some natural conditions on incremental learning | 2007-11-21 | Paper |
| An approach to intrinsic complexity of uniform learning | 2007-01-09 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Relations between Gold-style learning and query learning | 2006-01-10 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Increasing the power of uniform inductive learners | 2005-06-13 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046707 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473558 | 2004-08-04 | Paper |
| Separation of uniform learning classes. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148804 | 2002-09-22 | Paper |
