Frank Stephan

Inf. Process. Lett., January, 2024

An Improved Algorithm for Sparse Instances of SAT.

[BibT_eX]

[DOI]

Tzeh Yuan Neoh

CoRR, 2024

A Bisection Approach to Subcubic Maximum Induced Matching.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Quasi-Isometric Reductions Between Infinite Strings.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Randomness Versus Superspeedability.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

String compression in FA-presentable structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Addition machines, automatic functions and open problems of Floyd and Knuth.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2023

Languages given by Finite Automata over the Unary Alphabet.

[BibT_eX]

[DOI]

CoRR, 2023

Languages Given by Finite Automata over the Unary Alphabet.

[BibT_eX]

[DOI]

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

Randomness and initial segment complexity for measures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A computation model with automatic functions and relations as primitive operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Deciding Parity Games in Quasi-polynomial Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs.

[BibT_eX]

[DOI]

Ammar Fathin Sabili

CoRR, 2022

Lamplighter groups and automata.

[BibT_eX]

[DOI]

Acta Informatica, 2022

Alternating Automatic Register Machines.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

On Trees Without Hyperimmune Branches.

[BibT_eX]

[DOI]

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Improved algorithms for the general exact satisfiability problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Bi-immunity over different size alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the amount of nonconstructivity in learning formal languages from text.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Computable irrational numbers with representations of surprising complexity.

[BibT_eX]

[DOI]

Ivan Georgiev

Lars Kristiansen

Ann. Pure Appl. Log., 2021

Learnability and Positive Equivalence Relations.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2021

2020

Searching for shortest and least programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Chaitin's ω as a continuous function.

[BibT_eX]

[DOI]

J. Symb. Log., 2020

Randomness and Initial Segment Complexity for Probability Measures.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Ordered Semiautomatic Rings with Applications to Geometry.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

A Faster Exact Algorithm to Count X3SAT Solutions.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2020

2019

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2019

The isomorphism problem for tree-automatic ordinals with addition.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Reductions between types of numberings.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2019

Exact Satisfiabitity with Jokers.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Random Subgroups of Rationals.

[BibT_eX]

[DOI]

Alexander G. Melnikov

Karen Seidel

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Measure and Conquer for Max Hamming Distance XSAT.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Pumping, with or Without Choice.

[BibT_eX]

[DOI]

Aquinas Hobor

Elaine Li

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018

Implementing fragments of ZFC within an r.e. Universe.

[BibT_eX]

[DOI]

J. Log. Comput., 2018

Randomness and Solovay degrees.

[BibT_eX]

[DOI]

Kenshi Miyabe

J. Log. Anal., 2018

Limit-depth and DNR degrees.

[BibT_eX]

[DOI]

Philippe Moser

Inf. Process. Lett., 2018

Equivalences between learning of data and probability distributions, and their applications.

[BibT_eX]

[DOI]

George Barmpalias

Nan Fang

Inf. Comput., 2018

On the Values for Factor Complexity.

[BibT_eX]

[DOI]

Birzhan Moldagaliyev

Ludwig Staiger

Proceedings of the Implementation and Application of Automata, 2018

Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Learners Based on Transducers.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2018

On General Sum Approximations of Irrational Numbers.

[BibT_eX]

[DOI]

Ivan Georgiev

Lars Kristiansen

Proceedings of the Sailing Routes in the World of Computation, 2018

On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2018

2017

Query-Based Learning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Computational Complexity of Learning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Complexity of Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Automatic learning from positive data and negative counterexamples.

[BibT_eX]

[DOI]

Efim B. Kinber

Inf. Comput., 2017

Special issue on the conference Theory and Applications of Models of Computation.

[BibT_eX]

[DOI]

Rahul Jain

Inf. Comput., 2017

Algorithmic learning of probability distributions from random data in the limit.

[BibT_eX]

[DOI]

George Barmpalias

CoRR, 2017

Deciding parity games in quasipolynomial time.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

An ordered approach to solving parity games in quasi polynomial time and quasi linear space.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

Weakly Represented Families in Reverse Mathematics.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

Automatic Learning from Repetitive Texts.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Guest Editors' foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Tree-automatic scattered linear orders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Reducibilities among equivalence relations induced by recursively enumerable structures.

[BibT_eX]

[DOI]

Alex Gavryushkin

Theor. Comput. Sci., 2016

On block pumpable languages.

[BibT_eX]

[DOI]

Christopher Hanrui Chak

Rusins Freivalds

Henrietta Tan Wan Yik

Theor. Comput. Sci., 2016

How to verify computation with a rational network.

[BibT_eX]

[DOI]

CoRR, 2016

On Martin's pointed tree theorem.

[BibT_eX]

[DOI]

Rupert Hölzl

Liang Yu

Comput., 2016

Learning Automatic Families of Languages.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Finitely Generated Semiautomatic Groups.

[BibT_eX]

[DOI]

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

Learning Pattern Languages over Groups.

[BibT_eX]

[DOI]

Rupert Hölzl

Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2015

Deterministic Frequency Pushdown Automata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2015

Partial functions and domination.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Cone avoidance and randomness preservation.

[BibT_eX]

[DOI]

Stephen G. Simpson

Ann. Pure Appl. Log., 2015

Inductive Inference and Reverse Mathematics.

[BibT_eX]

[DOI]

Rupert Hölzl

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Depth, Highness and DNR Degrees.

[BibT_eX]

[DOI]

Philippe Moser

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Covering the Recursive Sets.

[BibT_eX]

[DOI]

Sebastiaan A. Terwijn

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

Priced Learning.

[BibT_eX]

[DOI]

Junqi Ma

Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

Combining Models of Approximation with Partial Learning.

[BibT_eX]

[DOI]

Sandra Zilles

Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014

Things that can be made into themselves.

[BibT_eX]

[DOI]

Inf. Comput., 2014

The Complexity of Recursive Splittings of Random Sets.

[BibT_eX]

[DOI]

Keng Meng Ng

Comput., 2014

Algorithmic Aspects of Lipschitz Functions.

[BibT_eX]

[DOI]

Comput., 2014

A reducibility related to being hyperimmune-free.

[BibT_eX]

[DOI]

Liang Yu

Ann. Pure Appl. Log., 2014

Graphs realised by r.e. equivalence relations.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

Finite State Incompressible Infinite Sequences.

[BibT_eX]

[DOI]

Cristian S. Calude

Ludwig Staiger

Proceedings of the Theory and Applications of Models of Computation, 2014

Semiautomatic Structures.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2014

On the Role of Update Constraints and Text-Types in Iterative Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013

Guest Editors' foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Anti-complex sets and reducibilities with tiny use.

[BibT_eX]

[DOI]

Johanna N. Y. Franklin

Noam Greenberg

J. Symb. Log., 2013

Highness, locally noncappability and nonboundings.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2013

Automatic models of first order theories.

[BibT_eX]

[DOI]

Pavel Semukhin

Ann. Pure Appl. Log., 2013

Automata on ordinals and automaticity of linear orders.

[BibT_eX]

[DOI]

Philipp Schlicht

Ann. Pure Appl. Log., 2013

Selection by Recursively Enumerable Sets.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Effectivity Questions for Kleene's Recursion Theorem.

[BibT_eX]

[DOI]

John Case

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

On Conservative Learning of Recursively Enumerable Languages.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

Editors' Introduction.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

Partial Learning of Recursively Enumerable Languages.

[BibT_eX]

[DOI]

Sandra Zilles

Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012

Arithmetic complexity via effective names for random sequences.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

An incomplete set of shortest descriptions.

[BibT_eX]

[DOI]

J. Symb. Log., 2012

Learning with ordinal-bounded memory from positive data.

[BibT_eX]

[DOI]

Lorenzo Carlucci

J. Comput. Syst. Sci., 2012

On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

The Complexity of Verbal Languages over Groups.

[BibT_eX]

[DOI]

Alexei Miasnikov

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Learnability of Co-r.e. Classes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Automatic Functions, Linear Time and Learning.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

Learning Families of Closed Sets in Matroids.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

Enlarging Learnable Classes.

[BibT_eX]

[DOI]

Timo Kötzing

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

Confident and Consistent Partial Learning of Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

The Discrete Time Behaviour of Restricted Linear Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the Modern Applications of Automata Theory., 2012

2011

Van Lambalgen's Theorem and High Degrees.

[BibT_eX]

[DOI]

Johanna N. Y. Franklin

Notre Dame J. Formal Log., 2011

Representation of left-computable ε-random reals.

[BibT_eX]

[DOI]

Cristian S. Calude

Nicholas J. Hay

J. Comput. Syst. Sci., 2011

Closed Left-R.E. Sets.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

Automatic Learning of Subclasses of Pattern Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

On the Parameterised Complexity of Learning Patterns.

[BibT_eX]

[DOI]

Ryo Yoshinaka

Proceedings of the Computer and Information Sciences II, 2011

Automata on Ordinals and Linear Orders.

[BibT_eX]

[DOI]

Philipp Schlicht

Proceedings of the Models of Computation in Context, 2011

Automatic Learners with Feedback Queries.

[BibT_eX]

[DOI]

Proceedings of the Models of Computation in Context, 2011

Learning and Classifying.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

Robust Learning of Automatic Classes of Languages.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

Query-Based Learning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning, 2010

Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning, 2010

Computational Complexity of Learning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning, 2010

Complexity of Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning, 2010

Schnorr trivial sets and truth-table reducibility.

[BibT_eX]

[DOI]

Johanna N. Y. Franklin

J. Symb. Log., 2010

Regular patterns, regular languages and context-free languages.

[BibT_eX]

[DOI]

Yuh Shin Ong

Inf. Process. Lett., 2010

Enumerating randoms

[BibT_eX]

[DOI]

CoRR, 2010

Higher Kurtz randomness.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2010

Learnability of Automatic Classes.

[BibT_eX]

[DOI]

Qinglong Luo

Proceedings of the Language and Automata Theory and Applications, 2010

Initial Segment Complexities of Randomness Notions.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2010

Splitting of Learnable Classes.

[BibT_eX]

[DOI]

Hongyang Li

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

How Powerful Are Integer-Valued Martingales?

[BibT_eX]

[DOI]

Laurent Bienvenu

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Editors' Introduction.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Constructive Dimension and Turing Degrees.

[BibT_eX]

[DOI]

Laurent Bienvenu

David Doty

Theory Comput. Syst., 2009

Consistent Partial Identification.

[BibT_eX]

[DOI]

Proceedings of the COLT 2009, 2009

Index Sets and Universal Numberings.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

Learning from Streams.

[BibT_eX]

[DOI]

Nan Ye

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

Uncountable Automatic Classes and Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Preface.

[BibT_eX]

[DOI]

Philip M. Long

Theor. Comput. Sci., 2008

Mitotic Classes in Inductive Inference.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Immunity and Hyperimmunity for Sets of Minimal Indices.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2008

When unlearning helps.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Prescribed Learning of Indexed Families.

[BibT_eX]

[DOI]

Nan Ye

Fundam. Informaticae, 2008

Computable categoricity and the Ershov hierarchy.

[BibT_eX]

[DOI]

Yue Yang

Ann. Pure Appl. Log., 2008

Lowness properties and approximations of the jump.

[BibT_eX]

[DOI]

Santiago Figueira

Ann. Pure Appl. Log., 2008

I classes, LR degrees and Turing degrees.

[BibT_eX]

[DOI]

George Barmpalias

Andrew E. M. Lewis

Ann. Pure Appl. Log., 2008

Universal Recursively Enumerable Sets of Strings.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Numberings Optimal for Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

Iterative Learning of Simple External Contextual Languages.

[BibT_eX]

[DOI]

Leonor Becerra-Bonache

John Case

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

Deduction, Induction, and beyond in Parametric Logic.

[BibT_eX]

[DOI]

Proceedings of the Induction, Algorithmic Learning Theory, and Philosophy, 2007

Post's Programme for the Ershov Hierarchy.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

Applications of Kolmogorov complexity to computable model theory.

[BibT_eX]

[DOI]

Pavel Semukhin

J. Symb. Log., 2007

Results on memory-limited U-shaped learning.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Mitotic Classes.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

On C-Degrees, H-Degrees and T-Degrees.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

Input-Dependence in Function-Learning.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

Constructive Dimension and Weak Truth-Table Degrees.

[BibT_eX]

[DOI]

Laurent Bienvenu

David Doty

Proceedings of the Computation and Logic in the Real World, 2007

Prescribed Learning of R.E. Classes.

[BibT_eX]

[DOI]

Nan Ye

Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

Learning in Friedberg Numberings.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006

Unifying logic, topology and learning in Parametric logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Lowness for Weakly 1-generic and Kurtz-Random.

[BibT_eX]

[DOI]

Liang Yu

Proceedings of the Theory and Applications of Models of Computation, 2006

Some Recent Results in U-Shaped Learning.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

Invertible Classes.

[BibT_eX]

[DOI]

Jochen Nessel

Proceedings of the Theory and Applications of Models of Computation, 2006

Kolmogorov Complexity and the Recursion Theorem.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Behavioural Approximations for Restricted Linear Differential Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 9th International Workshop, 2006

Memory-Limited U-Shaped Learning.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Degrees of Weakly Computable Reals.

[BibT_eX]

[DOI]

Keng Meng Ng

Proceedings of the Logical Approaches to Computational Barriers, 2006

Editors' Introduction.

[BibT_eX]

[DOI]

José L. Balcázar

Philip M. Long

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

Automatic linear orders and trees.

[BibT_eX]

[DOI]

Sasha Rubin

ACM Trans. Comput. Log., 2005

Lowness for the Class of Schnorr Random Reals.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Randomness, relativization and Turing degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

The dot-depth and the polynomial hierarchies correspond on the delta levels.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Kolmogorov-Loveland Randomness and Stochasticity.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Variations on U-Shaped Learning.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Presentations of K-Trivial Reals and Kolmogorov Complexity.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

Randomness and Universal Machines.

[BibT_eX]

Santiago Figueira

Proceedings of the CCA 2005, 2005

Absolute Versus Probabilistic Classification in a Logical Setting.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Non U-Shaped Vacillatory and Team Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004

Counting extensional differences in BC-learning.

[BibT_eX]

[DOI]

Inf. Comput., 2004

On the classification of recursive languages.

[BibT_eX]

[DOI]

Inf. Comput., 2004

A Polynomial Time Learner for a Subclass of Regular Patterns

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Enumerations of the Kolmogorov Function

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Definability and Regularity in Automatic Structures.

[BibT_eX]

[DOI]

Sasha Rubin

Proceedings of the STACS 2004, 2004

Automatic Structures: Richness and Limitations.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Identifying Clusters from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults.

[BibT_eX]

[DOI]

William I. Gasarch

Proceedings of the Algebraic Methods in Computational Complexity, 10.-15. October 2004, 2004

On the Data Consumption Benefits of Accepting Increased Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Learning power and language expressiveness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Topological aspects of numberings.

[BibT_eX]

[DOI]

Wolfram Menzel

Math. Log. Q., 2003

Strong Reductions and Immunity for Exponential Time.

[BibT_eX]

[DOI]

Marcus Schaefer

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

On Automatic Partial Orders.

[BibT_eX]

[DOI]

Sasha Rubin

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Infinitely-Often Autoreducible Sets.

[BibT_eX]

[DOI]

Richard Beigel

Lance Fortnow

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

On Ordinal VC-Dimension and Some Notions of Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

Learning a Subclass of Regular Patterns in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002

Learning classes of approximations to non-recursive function.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Trivial Reals.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity in Analysis, 2002

Classes bounded by incomplete sets.

[BibT_eX]

[DOI]

Kejia Ho

Ann. Pure Appl. Log., 2002

Learning in Logic with RichProlog.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 18th International Conference, 2002

Learning, Logic, and Topology in a Common Framework.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

Classes with Easily Learnable Subclasses.

[BibT_eX]

[DOI]

Wolfram Menzel

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

On the Learnability of Vector Spaces.

[BibT_eX]

[DOI]

Valentina S. Harizanov

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001

Learning algebraic structures from text.

[BibT_eX]

[DOI]

Yuri Ventsov

Theor. Comput. Sci., 2001

On The Structures Inside Truth-Table Degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2001

On one-sided versus two-sided classification.

[BibT_eX]

[DOI]

Arch. Math. Log., 2001

A General Theory of Deduction, Induction, and Learning.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

Robust Learning - Rich and Poor.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2001

Hausdorff Dimension in Exponential Time.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

Refuting Learning Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Learning How to Separate.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Learning by Switching Type of Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

The Comlexity of OddAn.

[BibT_eX]

[DOI]

J. Symb. Log., 2000

Counting Extensional Differences in BC-Learning.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

Unlearning Helps.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Average-Case Complexity of Learning Polynomials.

[BibT_eX]

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.

[BibT_eX]

[DOI]

Henning Fernau

J. Autom. Lang. Comb., 1999

Avoiding Coding Tricks by Hyperrobust Learning.

[BibT_eX]

[DOI]

Matthias Ott

Proceedings of the Computational Learning Theory, 4th European Conference, 1999

On the Uniform Learnability of Approximations to Non-Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

The VC-Dimension of Subclasses of Pattern.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998

On the Relative Sizes of Learnable Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions.

[BibT_eX]

[DOI]

Desh Ranjan

Theory Comput. Syst., 1998

Classification Using Information.

[BibT_eX]

[DOI]

William I. Gasarch

Mark G. Pleszkoch

Mahendran Velauthapillai

Ann. Math. Artif. Intell., 1998

On Existentially First-Order Definable Languages and Their Relation to NP.

[BibT_eX]

[DOI]

Dietrich Kuske

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Robust Learning Aided by Context.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

Learning Algebraic Structures from Text Using Semantical Knowledge.

[BibT_eX]

[DOI]

Yuri Ventsov

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

Learning to Win Process-Control Games Watching Game-Masters.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

Predictive Learning Models for Concept Drift.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Correction to "A Cohesive Set which is not High".

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Math. Log. Q., 1997

On the Classification of Computable Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

The Complexity of Learning Branches and Strategies from Queries.

[BibT_eX]

[DOI]

Matthias Ott

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

The Complexity of Universal Text-Learners.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Structural Measures for Games and Process Control in the Branch Learning Model.

[BibT_eX]

[DOI]

Matthias Ott

Proceedings of the Computational Learning Theory, Third European Conference, 1997

Robust Learning with Infinite Additional Information.

[BibT_eX]

[DOI]

Susanne Kaufmann

Proceedings of the Computational Learning Theory, Third European Conference, 1997

How Powerful is Unconditional Transfer? - When UT meets AC.

[BibT_eX]

Henning Fernau

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Generalized Notions of Mind Change Complexity.

[BibT_eX]

[DOI]

Yuri Ventsov

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

Resource Bounded Next Value and Explanatory Identification: Learning Automata, Patterns and Polynomials On-Line.

[BibT_eX]

[DOI]

Susanne Kaufmann

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

Inclusion Problems in Parallel Learning and Games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Looking for an Analogue of Rice's Theorem in Complexity Theory

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1996

On the Query Complexity of Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Trees and Learning.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

Vacillatory and BC Learning on Noisy Data.

[BibT_eX]

[DOI]

John Case

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

Recursion Theoretic Properties of Frequency Computation and Bounded Queries

[BibT_eX]

[DOI]

Inf. Comput., July, 1995

Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity.

[BibT_eX]

[DOI]

Efim B. Kinber

Inf. Comput., 1995

Measure, Category and Learning Theory.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

The Power of Frequency Computation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Learning via Queries and Oracles.

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract).

[BibT_eX]

[DOI]

Efim B. Kinber

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Noisy Inference and Oracles.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Effective Search Problems.

[BibT_eX]

[DOI]

Math. Log. Q., 1994

Extremes in the Degrees of Inferability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1994

Inclusion Problems in Parallel Learning and Games (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

Approximable Sets.

[BibT_eX]

[DOI]

Richard Beigel

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

On Optimizing Diameter and Average Distance of Directed Interconnected Networks.

[BibT_eX]

[DOI]

Heinrich Braun

IEEE Trans. Computers, 1993

A Cohesive Set which is not High.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Math. Log. Q., 1993

Weakly Semirecursive Sets and r.e. Orderings.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1993

Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

On the Structure of Degrees of Inferability.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

Quantifying the Amount of Verboseness.

[BibT_eX]

[DOI]

Richard Beigel

Proceedings of the Logical Foundations of Computer Science, 1992

1990

X-Raeume als Verallgemeinerung topologischer Raeume

[BibT_eX]

[DOI]