| Publication | Date of Publication | Type |
|---|
| A bisection approach to subcubic maximum induced matching | 2024-07-19 | Paper |
| Pumping, with or without choice | 2024-04-19 | Paper |
| Learnability and positive equivalence relations | 2024-02-02 | Paper |
| Word automatic groups of nilpotency class 2 | 2023-10-12 | Paper |
| Alternating automatic register machines | 2023-07-28 | Paper |
| Addition machines, automatic functions and open problems of Floyd and Knuth | 2023-06-12 | Paper |
| Languages given by Finite Automata over the Unary Alphabet | 2023-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874332 | 2023-02-07 | Paper |
| Measure and Conquer for Max Hamming Distance XSAT | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875650 | 2023-02-03 | Paper |
| String compression in FA-presentable structures | 2023-02-01 | Paper |
| On the classification of computable languages | 2022-11-09 | Paper |
| Lamplighter groups and automata | 2022-08-30 | Paper |
| Random Subgroups of Rationals | 2022-07-21 | Paper |
| Members of thin Π₁⁰ classes and generic degrees | 2022-06-15 | Paper |
| A computation model with automatic functions and relations as primitive operations | 2022-06-13 | Paper |
| Deciding Parity Games in Quasi-polynomial Time | 2022-05-03 | Paper |
| Learners based on transducers | 2022-03-14 | Paper |
| An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs | 2022-01-10 | Paper |
| Randomness and initial segment complexity for measures | 2021-12-22 | Paper |
| On the amount of nonconstructivity in learning formal languages from text | 2021-11-25 | Paper |
| Bi-immunity over different size alphabets | 2021-11-11 | Paper |
| Improved algorithms for the general exact satisfiability problem | 2021-10-06 | Paper |
| Learnability and positive equivalence relations | 2021-10-04 | Paper |
| members of thin $\Pi_1^0$ classes and generic degrees | 2020-08-11 | Paper |
| Closure of resource-bounded randomness notions under polynomial time permutations | 2020-08-05 | Paper |
| Ordered semiautomatic rings with applications to geometry | 2020-07-27 | Paper |
| On the order dimension of locally countable partial orderings | 2020-05-27 | Paper |
| CHAITIN’S Ω AS A CONTINUOUS FUNCTION | 2020-04-17 | Paper |
| Searching for shortest and least programs | 2020-01-22 | Paper |
| Exact satisfiabitity with jokers | 2019-10-15 | Paper |
| Reductions between types of numberings | 2019-10-07 | Paper |
| The isomorphism problem for tree-automatic ordinals with addition | 2019-09-20 | Paper |
| Randomness and initial segment complexity for probability measures | 2019-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617615 | 2019-02-06 | Paper |
| The complexity of verbal languages over groups | 2019-01-25 | Paper |
| Measure, category and learning theory | 2019-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645642 | 2019-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560220 | 2018-12-10 | Paper |
| On the values for factor complexity | 2018-11-07 | Paper |
| Implementing fragments of ZFC within an r.e. Universe | 2018-09-28 | Paper |
| Equivalences between learning of data and probability distributions, and their applications | 2018-09-27 | Paper |
| Finitely generated semiautomatic groups | 2018-09-20 | Paper |
| Learning pattern languages over groups | 2018-08-22 | Paper |
| Learners based on transducers | 2018-06-26 | Paper |
| Effectivity questions for Kleene's recursion theorem | 2018-06-05 | Paper |
| Randomness and Solovay degrees | 2018-05-04 | Paper |
| Subrecursive Approximations of Irrational Numbers by Variable Base Sums | 2018-04-15 | Paper |
| Limit-depth and DNR degrees | 2018-04-05 | Paper |
| Semiautomatic structures | 2018-02-01 | Paper |
| Regular patterns, regular languages and context-free languages | 2017-11-03 | Paper |
| Boolean algebras realized by c.e. equivalence relations | 2017-09-11 | Paper |
| Deciding parity games in quasipolynomial time | 2017-08-17 | Paper |
| Automatic learning from positive data and negative counterexamples | 2017-08-08 | Paper |
| Automatic linear orders and trees | 2017-07-12 | Paper |
| A Survey on Recent Results on Partial Learning | 2017-06-09 | Paper |
| The Complexity of Verbal Languages over Groups | 2017-05-16 | Paper |
| Weakly Represented Families in Reverse Mathematics | 2017-04-04 | Paper |
| Closed left-r.e. sets | 2017-02-23 | Paper |
| Covering the recursive sets | 2017-02-08 | Paper |
| Inductive Inference and Reverse Mathematics | 2017-01-24 | Paper |
| Priced Learning | 2016-11-30 | Paper |
| Combining Models of Approximation with Partial Learning | 2016-11-30 | Paper |
| Enlarging learnable classes | 2016-11-18 | Paper |
| Learning Pattern Languages over Groups | 2016-11-09 | Paper |
| Inductive inference and reverse mathematics | 2016-10-10 | Paper |
| Finitely Generated Semiautomatic Groups | 2016-08-17 | Paper |
| On Martin’s pointed tree theorem | 2016-07-25 | Paper |
| Tree-automatic scattered linear orders | 2016-03-31 | Paper |
| Learning Automatic Families of Languages | 2016-03-10 | Paper |
| Finite state incompressible infinite sequences | 2016-03-10 | Paper |
| On the role of update constraints and text-types in iterative learning | 2016-03-10 | Paper |
| Partial learning of recursively enumerable languages | 2016-02-26 | Paper |
| Reducibilities among equivalence relations induced by recursively enumerable structures | 2015-12-15 | Paper |
| Effectivity Questions for Kleene’s Recursion Theorem | 2015-12-11 | Paper |
| On block pumpable languages | 2015-12-08 | Paper |
| Covering the Recursive Sets | 2015-10-20 | Paper |
| Depth, Highness and DNR Degrees | 2015-09-29 | Paper |
| Arithmetic complexity via effective names for random sequences | 2015-09-17 | Paper |
| Graphs realised by r.e. equivalence relations | 2015-06-17 | Paper |
| A reducibility related to being hyperimmune-free | 2015-06-17 | Paper |
| Cone avoidance and randomness preservation | 2015-05-15 | Paper |
| On the Role of Update Constraints and Text-Types in Iterative Learning | 2015-01-14 | Paper |
| Confident and consistent partial learning of recursive functions | 2014-10-31 | Paper |
| Things that can be made into themselves | 2014-07-18 | Paper |
| Semiautomatic Structures | 2014-06-24 | Paper |
| The Complexity of Recursive Splittings of Random Sets | 2014-06-19 | Paper |
| Algorithmic Aspects of Lipschitz Functions | 2014-06-19 | Paper |
| Finite State Incompressible Infinite Sequences | 2014-04-16 | Paper |
| Anti-Complex Sets and Reducibilities with Tiny Use | 2014-04-04 | Paper |
| Robust learning of automatic classes of languages | 2014-02-13 | Paper |
| Automatic learners with feedback queries | 2014-02-13 | Paper |
| Initial segment complexities of randomness notions | 2014-02-11 | Paper |
| Learning and classifying | 2014-01-09 | Paper |
| Automatic models of first order theories | 2013-12-11 | Paper |
| Editors’ Introduction | 2013-11-06 | Paper |
| Partial Learning of Recursively Enumerable Languages | 2013-11-06 | Paper |
| Automatic functions, linear time and learning | 2013-09-26 | Paper |
| On Conservative Learning of Recursively Enumerable Languages | 2013-08-05 | Paper |
| ON AUTOMATIC FAMILIES | 2013-06-03 | Paper |
| Selection by Recursively Enumerable Sets | 2013-05-28 | Paper |
| Trivial Reals | 2013-04-19 | Paper |
| Highness, locally noncappability and nonboundings | 2013-04-05 | Paper |
| Automata on ordinals and automaticity of linear orders | 2013-04-05 | Paper |
| The Discrete Time Behaviour of Restricted Linear Hybrid Automata | 2013-02-26 | Paper |
| How powerful are integer-valued martingales? | 2012-12-07 | Paper |
| Automatic learning of subclasses of pattern languages | 2012-11-27 | Paper |
| Learnability of automatic classes | 2012-11-06 | Paper |
| Enlarging Learnable Classes | 2012-10-16 | Paper |
| Confident and Consistent Partial Learning of Recursive Functions | 2012-10-16 | Paper |
| Learning with ordinal-bounded memory from positive data | 2012-08-17 | Paper |
| Automatic Functions, Linear Time and Learning | 2012-08-14 | Paper |
| On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data | 2012-07-16 | Paper |
| Learning Families of Closed Sets in Matroids | 2012-06-15 | Paper |
| Learnability of Co-r.e. Classes | 2012-06-08 | Paper |
| An incomplete set of shortest descriptions | 2012-04-19 | Paper |
| Robust Learning of Automatic Classes of Languages | 2011-10-19 | Paper |
| Learning and Classifying | 2011-10-19 | Paper |
| Kolmogorov complexity and the Recursion Theorem | 2011-10-17 | Paper |
| Automatic Learners with Feedback Queries | 2011-09-09 | Paper |
| Automata on Ordinals and Linear Orders | 2011-09-09 | Paper |
| Higher Kurtz randomness | 2011-08-26 | Paper |
| Relativizations of randomness and genericity notions | 2011-08-16 | Paper |
| Closed Left-R.E. Sets | 2011-07-01 | Paper |
| Automatic Learning of Subclasses of Pattern Languages | 2011-06-03 | Paper |
| Van Lambalgen's theorem and high degrees | 2011-06-03 | Paper |
| Universal recursively enumerable sets of strings | 2011-05-10 | Paper |
| Index sets and universal numberings | 2011-04-28 | Paper |
| Representation of left-computable \(\varepsilon \)-random reals | 2011-04-28 | Paper |
| Uncountable automatic classes and learning | 2011-04-14 | Paper |
| Initial Segment Complexities of Randomness Notions | 2010-10-27 | Paper |
| Splitting of Learnable Classes | 2010-09-10 | Paper |
| How powerful are integer-valued martingales? | 2010-07-29 | Paper |
| Index Sets and Universal Numberings | 2010-07-28 | Paper |
| Iterative learning of simple external contextual languages | 2010-07-07 | Paper |
| Schnorr trivial sets and truth-table reducibility | 2010-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3567853 | 2010-06-17 | Paper |
| Topological aspects of poset spaces | 2010-06-17 | Paper |
| Learnability of Automatic Classes | 2010-05-26 | Paper |
| Numberings optimal for learning | 2010-05-25 | Paper |
| Vacillatory and BC learning on noisy data | 2010-04-27 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Uncountable Automatic Classes and Learning | 2009-12-01 | Paper |
| Learning from Streams | 2009-12-01 | Paper |
| Constructive dimension and Turing degrees | 2009-10-19 | Paper |
| Input-dependence in function-learning | 2009-10-19 | Paper |
| Mitotic Classes in Inductive Inference | 2009-08-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Prescribed learning of r.e. classes | 2009-05-12 | Paper |
| On the structure of degrees of inferability. | 2008-12-21 | Paper |
| \(\Pi_1^0 \) classes, LR degrees and Turing degrees | 2008-12-05 | Paper |
| Computable categoricity and the Ershov hierarchy | 2008-12-05 | Paper |
| Universal Recursively Enumerable Sets of Strings | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530402 | 2008-10-20 | Paper |
| Iterative Learning of Simple External Contextual Languages | 2008-10-14 | Paper |
| Numberings Optimal for Learning | 2008-10-14 | Paper |
| Editors’ Introduction | 2008-09-04 | Paper |
| Learning in Friedberg numberings | 2008-08-22 | Paper |
| Prescribed Learning of R.E. Classes | 2008-08-19 | Paper |
| Learning in Friedberg Numberings | 2008-08-19 | Paper |
| Immunity and hyperimmunity for sets of minimal indices | 2008-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505895 | 2008-06-11 | Paper |
| Non-U-shaped vacillatory and team learning | 2008-06-10 | Paper |
| Absolute versus probabilistic classification in a logical setting | 2008-05-28 | Paper |
| When unlearning helps | 2008-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5459629 | 2008-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457305 | 2008-04-14 | Paper |
| Lowness properties and approximations of the jump | 2008-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5448304 | 2008-03-20 | Paper |
| Kolmogorov complexity and the Recursion Theorem | 2008-03-19 | Paper |
| Post's Programme for the Ershov Hierarchy | 2008-02-07 | Paper |
| Mitotic Classes | 2008-01-03 | Paper |
| Input-Dependence in Function-Learning | 2007-11-13 | Paper |
| Constructive Dimension and Weak Truth-Table Degrees | 2007-11-13 | Paper |
| Applications of Kolmogorov complexity to computable model theory | 2007-10-17 | Paper |
| Automatic Structures: Richness and Limitations | 2007-10-11 | Paper |
| Results on memory-limited U-shaped learning | 2007-10-10 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Invertible classes | 2007-09-28 | Paper |
| Using random sets as oracles | 2007-09-27 | Paper |
| On the data consumption benefits of accepting increased uncertainty | 2007-09-18 | Paper |
| Memory-Limited U-Shaped Learning | 2007-09-14 | Paper |
| Infinitely‐Often Autoreducible Sets | 2007-06-26 | Paper |
| Hybrid Systems: Computation and Control | 2007-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3434496 | 2007-05-02 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Randomness and universal machines | 2007-02-08 | Paper |
| On the learnability of vector spaces | 2007-01-22 | Paper |
| On ordinal VC-dimension and some notions of complexity | 2007-01-09 | Paper |
| Learning a subclass of regular patterns in polynomial time | 2007-01-09 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494239 | 2006-10-17 | Paper |
| Variations on U-shaped learning | 2006-08-17 | Paper |
| Enumerations of the Kolmogorov function | 2006-08-03 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Lowness for the Class of Schnorr Random Reals | 2006-06-01 | Paper |
| Identifying Clusters from Positive Data | 2006-06-01 | Paper |
| Unifying logic, topology and learning in parametric logic | 2006-03-20 | Paper |
| Randomness, relativization and Turing degrees | 2006-01-16 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Kolmogorov-Loveland randomness and stochasticity | 2005-12-29 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5700818 | 2005-11-02 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS | 2005-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664253 | 2005-04-05 | Paper |
| Counting extensional differences in BC-learning | 2004-11-23 | Paper |
| Generalized notions of mind change complexity | 2004-10-04 | Paper |
| Robust learning -- rich and poor | 2004-10-01 | Paper |
| Trees and learning | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736044 | 2004-08-09 | Paper |
| Classes with easily learnable subclasses | 2004-08-06 | Paper |
| On the classification of recursive languages | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473555 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473556 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473561 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460833 | 2004-03-29 | Paper |
| Learning how to separate. | 2004-03-14 | Paper |
| Learning by switching type of information. | 2004-03-14 | Paper |
| On one-sided versus two-sided classification | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420752 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420753 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420754 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418681 | 2003-08-11 | Paper |
| Learning power and language expressiveness. | 2003-05-25 | Paper |
| Refuting learning revisited. | 2003-05-22 | Paper |
| Topological aspects of numberings | 2003-04-10 | Paper |
| On the structures inside truth-table degrees | 2003-02-06 | Paper |
| Learning classes of approximations to non-recursive functions. | 2003-01-21 | Paper |
| The complexity of universal text-learners. | 2003-01-14 | Paper |
| Learning to win process-control games watching game-masters | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148803 | 2002-09-22 | Paper |
| Avoiding coding tricks by hyperrobust learning | 2002-07-15 | Paper |
| Classes bounded by incomplete sets | 2002-06-24 | Paper |
| Learning algebraic structures from text | 2002-03-03 | Paper |
| Predictive learning models for concept drift | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757846 | 2001-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754021 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754201 | 2001-11-11 | Paper |
| Robust learning with infinite additional information | 2001-08-20 | Paper |
| Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory | 2001-07-16 | Paper |
| On Existentially First-Order Definable Languages and Their Relation to NP | 2000-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955318 | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938554 | 2000-09-20 | Paper |
| Vacillatory and BC learning on noisy data | 2000-08-21 | Paper |
| Structural measures for games and process control in the branch learning model | 2000-08-21 | Paper |
| Robust learning aided by context | 2000-07-24 | Paper |
| The complexity of ODDnA | 2000-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939577 | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955303 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944898 | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247000 | 2000-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247012 | 2000-03-13 | Paper |
| Learning via queries and oracles | 2000-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247015 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231780 | 1999-03-15 | Paper |
| Classification using information | 1999-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364508 | 1998-08-13 | Paper |
| Noisy inference and oracles | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375806 | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370209 | 1998-01-14 | Paper |
| Inclusion problems in parallel learning and games | 1996-11-26 | Paper |
| Approximable sets | 1996-04-16 | Paper |
| Language learning from texts: Mindchanges, limited memory and monotonicity | 1996-02-26 | Paper |
| Recursion theoretic properties of frequency computation and bounded queries | 1995-10-29 | Paper |
| Quantifying the amount of verboseness | 1995-05-28 | Paper |
| Effective Search Problems | 1995-02-16 | Paper |
| Extremes in the degrees of inferability | 1994-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4282611 | 1994-03-17 | Paper |
| Weakly semirecursive sets and r.e. orderings | 1993-05-16 | Paper |
| A cohesive set which is not high | 1993-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998086 | 1992-09-17 | Paper |
| Randomness versus superspeedability | N/A | Paper |
