Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines. - Sanjay Jain 001; Arun Sharma 001; John Case (COLT, 1989)

Anomalous Learning Helps Succinctness (Extended Abstract). - John Case; Sanjay Jain 001; Arun Sharma 001 (ALT, 1990)

Finite Learning by a "Team". - Sanjay Jain 001; Arun Sharma 001 (COLT, 1990)

Language Learning by a "Team" (Extended Abstract). - Sanjay Jain 001; Arun Sharma 001 (ICALP, 1990)

Hypothesis Formation and Language Acquisition with an Infinitely-Often Correct Teacher. - Sanjay Jain 001; Arun Sharma 001 (TARK, 1990)

On the Limitations of Locally Robust Positive Reductions. - Lane A. Hemachandra; Sanjay Jain 001 (Int. J. Found. Comput. Sci., 1991)

Learning in the Presence of Partial Explanations - Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1991)

Prudence in Vacillatory Language Identification (Extended Abstract). - Sanjay Jain 001; Arun Sharma 001 (ALT, 1992)

On Learning Limiting Programs. - John Case; Sanjay Jain 001; Arun Sharma 001 (Int. J. Found. Comput. Sci., 1992)

Strong separation of learning classes. - John Case; Keh-Jiann Chen; Sanjay Jain 001 (J. Exp. Theor. Artif. Intell., 1992)

Probability is More Powerful Than Team for Language Identification from Positive Data. - Sanjay Jain 001; Arun Sharma 001 (COLT, 1993)

Banishing Robust Turing Completeness. - Lane A. Hemaspaandra; Sanjay Jain 001; Nikolai K. Vereshchagin (Int. J. Found. Comput. Sci., 1993)

On the Non-Existence of Maximal Inference Degrees for Language Identification. - Sanjay Jain 001; Arun Sharma 001 (Inf. Process. Lett., 1993)

Learning with the Knowledge of an Upper Bound on Program Size - Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1993)

On Monotonic Strategies for Learning r.e. Languages. - Sanjay Jain 001; Arun Sharma 001 (AII/ALT, 1994)

Extremes in the Degrees of Inferability. - Lance Fortnow; William I. Gasarch; Sanjay Jain 001; Efim B. Kinber; Martin Kummer; Stuart A. Kurtz; Mark Pleszkovich; Theodore A. Slaman; Robert Solovay; Frank Stephan 001 (Ann. Pure Appl. Log., 1994)

Vacillatory Learning of Nearly Minimal Size Grammars. - John Case; Sanjay Jain 001; Arun Sharma 001 (J. Comput. Syst. Sci., 1994)

Open Problems in "Systems That Learn". - Mark A. Fulk; Sanjay Jain 001; Daniel N. Osherson (J. Comput. Syst. Sci., 1994)

Characterizing Language Identification by Standardizing Operations. - Sanjay Jain 001; Arun Sharma 001 (J. Comput. Syst. Sci., 1994)

Machine Learning of Higher-Order Programs. - Ganesh R. Baliga; John Case; Sanjay Jain 001; Mandayam Suraj (J. Symb. Log., 1994)

Refinements of inductive inference by Popperian and reliable machines. - John Case; Sanjay Jain 001; Suzanne Ngo Manguelle (Kybernetika, 1994)

Program Size Restrictions in Computational Learning. - Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 1994)

Approximate Inference and Scientific Method - Mark A. Fulk; Sanjay Jain 001 (Inf. Comput., 1994)

Machine Induction Without Revolutionary Paradigm Shifts. - John Case; Sanjay Jain 001; Arun Sharma 001 (ALT, 1995)

Not-So-Nearly-Minimal-Size Program Inference. - John Case; Mandayam Suraj; Sanjay Jain 001 (GOSLER Final Report, 1995)

On Identification by Teams and Probabilistic Machines. - Sanjay Jain 001; Arun Sharma 001 (GOSLER Final Report, 1995)

An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings. - Sanjay Jain 001 (Int. J. Found. Comput. Sci., 1995)

On a Question About Learning Nearly Minimal Programs. - Sanjay Jain 001 (Inf. Process. Lett., 1995)

Language Learning with Some Negative Information. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (J. Comput. Syst. Sci., 1995)

Prudence in Vacillatory Language Identification. - Sanjay Jain 001; Arun Sharma 001 (Math. Syst. Theory, 1995)

On Aggregating Teams of Learning Machines. - Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 1995)

Complexity Issues for Vacillatory Function Identification - John Case; Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1995)

Finite Identification of Functions by Teams with Success Ratio 1 over2 and Above - Sanjay Jain 001; Arun Sharma 001; Mahendran Velauthapillai (Inf. Comput., 1995)

On Learning and Co-learning of Minimal Programs. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (ALT, 1996)

Synthesizing Enumeration Techniques for Language Learning. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (COLT, 1996)

Team Learning of Recursive Languages. - Sanjay Jain 001; Arun Sharma 001 (PRICAI, 1996)

Machine Induction Without Revolutionary Changes in Hypothesis Size. - John Case; Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1996)

Computational Limits on Team Identification of Languages. - Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1996)

Program Synthesis in the Presence of Infinite Number of Inaccuracies. - Sanjay Jain 001 (J. Comput. Syst. Sci., 1996)

The Intrinsic Complexity of Language Identification. - Sanjay Jain 001; Arun Sharma 001 (J. Comput. Syst. Sci., 1996)

Anomalous Learning Helps Succinctness. - John Case; Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 1996)

Learning in the Presence of Inaccurate Information. - Mark A. Fulk; Sanjay Jain 001 (Theor. Comput. Sci., 1996)

Learning of R.E. Languages from Good Examples. - Sanjay Jain 001; Steffen Lange; Jochen Nessel (ALT, 1997)

Characterizing Language Identification in Terms of Computable Numberings. - Sanjay Jain 001; Arun Sharma 001 (Ann. Pure Appl. Log., 1997)

Elementary Formal Systems, Intrinsic Complexity, and Procrastination. - Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1997)

Strong monotonic and set-driven inductive inference. - Sanjay Jain 001 (J. Exp. Theor. Artif. Intell., 1997)

The Structure of Intrinsic Complexity of Learning. - Sanjay Jain 001; Arun Sharma 001 (J. Symb. Log., 1997)

Learning from Multiple Sources of Inaccurate Data. - Ganesh R. Baliga; Sanjay Jain 001; Arun Sharma 001 (SIAM J. Comput., 1997)

Kolmogorov Numberings and Minimal Identification. - Rusins Freivalds; Sanjay Jain 001 (Theor. Comput. Sci., 1997)

On the Power of Learning Robustly. - Sanjay Jain 001; Carl H. Smith; Rolf Wiehagen (COLT, 1998)

Generalized Replicator Dynamics as a Model of Specialization and Diversity in Societies. - Vivek S. Borkar; Sanjay Jain 001; Govindan Rangarajan (Adv. Complex Syst., 1998)

Generalization and Specialization Strategies for Learning r.e. Languages. - Sanjay Jain 001; Arun Sharma 001 (Ann. Math. Artif. Intell., 1998)

Dynamics of individual specialization and global diversification in communities. - Vivek S. Borkar; Sanjay Jain 001; Govindan Rangarajan (Complex., 1998)

Minimal Concept Identification and Reliability. - Sanjay Jain 001 (Int. J. Found. Comput. Sci., 1998)

Learning with Refutation. - Sanjay Jain 001 (J. Comput. Syst. Sci., 1998)

The Synthesis of Language Learners. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (Inf. Comput., 1999)

Incremental Concept Learning for Bounded Data Mining. - John Case; Sanjay Jain 001; Steffen Lange; Thomas Zeugmann (Inf. Comput., 1999)

Robust Behaviorally Correct Learning. - Sanjay Jain 001 (Inf. Comput., 1999)

On a Question of Nearly Minimal Identification of Functions. - Sanjay Jain 001 (Inf. Process. Lett., 1999)

Ordinal Mind Change Complexity of Language Identification. - Andris Ambainis; Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 1999)

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (COLT, 2000)

Robust Learning Aided by Context. - John Case; Sanjay Jain 001; Matthias Ott; Arun Sharma 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2000)

Team Learning of Computable Languages. - Sanjay Jain 001; Arun Sharma 001 (Theory Comput. Syst., 2000)

Vacillatory and BC learning on noisy data. - John Case; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2000)

Learning languages and functions by erasing. - Sanjay Jain 001; Efim B. Kinber; Steffen Lange; Rolf Wiehagen; Thomas Zeugmann (Theor. Comput. Sci., 2000)

Learning Recursive Functions Refutably. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen; Thomas Zeugmann (ALT, 2001)

On a Generalized Notion of Mistake Bounds. - Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 2001)

Synthesizing Learners Tolerating Computable Noisy Data. - John Case; Sanjay Jain 001 (J. Comput. Syst. Sci., 2001)

Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (J. Comput. Syst. Sci., 2001)

Robust Learning Is Rich. - Sanjay Jain 001; Carl H. Smith; Rolf Wiehagen (J. Comput. Syst. Sci., 2001)

On an open problem in classification of languages. - Sanjay Jain 001 (J. Exp. Theor. Artif. Intell., 2001)

Some Independence Results for Control Structures in Complete Numberings. - Sanjay Jain 001; Jochen Nessel (J. Symb. Log., 2001)

Costs of general purpose learning. - John Case; Keh-Jiann Chen; Sanjay Jain 001 (Theor. Comput. Sci., 2001)

Predictive learning models for concept drift. - John Case; Sanjay Jain 001; Susanne Kaufmann; Arun Sharma 001; Frank Stephan 001 (Theor. Comput. Sci., 2001)

Synthesizing noise-tolerant language learners. - John Case; Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 2001)

Branch and bound on the network model. - Sanjay Jain 001 (Theor. Comput. Sci., 2001)

On the learnability of recursively enumerable languages from good examples. - Sanjay Jain 001; Steffen Lange; Jochen Nessel (Theor. Comput. Sci., 2001)

Control structures in hypothesis spaces: the influence on learning. - John Case; Sanjay Jain 001; Mandayam Suraj (Theor. Comput. Sci., 2002)

Mind change complexity of learning logic programs. - Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 2002)

The Intrinsic Complexity of Learning: A Survey. - Sanjay Jain 001 (Fundam. Informaticae, 2003)

On the intrinsic complexity of learning recursive functions. - Sanjay Jain 001; Efim B. Kinber; Christophe Papazian; Carl H. Smith; Rolf Wiehagen (Inf. Comput., 2003)

Learning by switching type of information. - Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2003)

Intrinsic complexity of learning geometrical concepts from positive data. - Sanjay Jain 001; Efim B. Kinber (J. Comput. Syst. Sci., 2003)

On learning of functions refutably. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen; Thomas Zeugmann (Theor. Comput. Sci., 2003)

A Polynomial Time Learner for a Subclass of Regular Patterns - John Case; Sanjay Jain 001; Rüdiger Reischuk; Frank Stephan 001; Thomas Zeugmann (Electron. Colloquium Comput. Complex., 2004)

Learning all subfunctions of a function. - Sanjay Jain 001; Efim B. Kinber; Rolf Wiehagen (Inf. Comput., 2004)

Classes with easily learnable subclasses. - Sanjay Jain 001; Wolfram Menzel; Frank Stephan 001 (Inf. Comput., 2004)

Counting extensional differences in BC-learning. - Sanjay Jain 001; Frank Stephan 001; Sebastiaan Terwijn (Inf. Comput., 2004)

Robust learning–rich and poor. - John Case; Sanjay Jain 001; Frank Stephan 001; Rolf Wiehagen (J. Comput. Syst. Sci., 2004)

Parsimony hierarchies for inductive inference. - Andris Ambainis; John Case; Sanjay Jain 001; Mandayam Suraj (J. Symb. Log., 2004)

Learning how to separate. - Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2004)

Gold-Style and Query Learning Under Various Constraints on the Target Class. - Sanjay Jain 001; Steffen Lange; Sandra Zilles (ALT, 2005)

Editors' Introduction. - Sanjay Jain 001; Hans Ulrich Simon; Etsuji Tomita (ALT, 2005)

On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. - John Case; Sanjay Jain 001; Franco Montagna; Giulia Simi; Andrea Sorbi (J. Comput. Syst. Sci., 2005)

Preface. - Hiroki Arimura; Sanjay Jain 001 (Theor. Comput. Sci., 2005)

Towards a Better Understanding of Incremental Learning. - Sanjay Jain 001; Steffen Lange; Sandra Zilles (ALT, 2006)

Memory-Limited U-Shaped Learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (COLT, 2006)

Some Recent Results in U-Shaped Learning. - Sanjay Jain 001; Frank Stephan 001 (TAMC, 2006)

Generality's price: Inescapable deficiencies in machine-learned programs. - John Case; Keh-Jiann Chen; Sanjay Jain 001; Wolfgang Merkle; James S. Royer (Ann. Pure Appl. Log., 2006)

Variations on U-shaped learning. - Lorenzo Carlucci; Sanjay Jain 001; Efim B. Kinber; Frank Stephan 001 (Inf. Comput., 2006)

Learning languages from positive data and a finite number of queries. - Sanjay Jain 001; Efim B. Kinber (Inf. Comput., 2006)

Identifying Clusters from Positive Data. - John Case; Sanjay Jain 001; Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (SIAM J. Comput., 2006)

Learning a subclass of regular patterns in polynomial time. - John Case; Sanjay Jain 001; Rüdiger Reischuk; Frank Stephan 001; Thomas Zeugmann (Theor. Comput. Sci., 2006)

Mitotic Classes. - Sanjay Jain 001; Frank Stephan 001 (COLT, 2007)

Results on memory-limited U-shaped learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2007)

Iterative learning from positive data and negative counterexamples. - Sanjay Jain 001; Efim B. Kinber (Inf. Comput., 2007)

Some natural conditions on incremental learning. - Sanjay Jain 001; Steffen Lange; Sandra Zilles (Inf. Comput., 2007)

Learning languages in a union. - Sanjay Jain 001; Yen Kaow Ng; Tiong Seng Tay (J. Comput. Syst. Sci., 2007)

Learning multiple languages in groups. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2007)

Learning languages from positive data and a limited number of short counterexamples. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2007)

A general comparison of language learning from examples and from queries. - Sanjay Jain 001; Steffen Lange; Sandra Zilles (Theor. Comput. Sci., 2007)

Invertible classes. - Sanjay Jain 001; Jochen Nessel; Frank Stephan 001 (Theor. Comput. Sci., 2007)

Prescribed Learning of Indexed Families. - Sanjay Jain 001; Frank Stephan 001; Nan Ye (Fundam. Informaticae, 2008)

Learning in Friedberg numberings. - Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2008)

Non-U-shaped vacillatory and team learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2008)

Learning languages from positive data and negative counterexamples. - Sanjay Jain 001; Efim B. Kinber (J. Comput. Syst. Sci., 2008)

Mitotic Classes in Inductive Inference. - Sanjay Jain 001; Frank Stephan 001 (SIAM J. Comput., 2008)

Learning and extending sublanguages. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2008)

Absolute versus probabilistic classification in a logical setting. - Sanjay Jain 001; Eric Martin 002; Frank Stephan 001 (Theor. Comput. Sci., 2008)

Learning from Streams. - Sanjay Jain 001; Frank Stephan 001; Nan Ye (ALT, 2009)

Consistent Partial Identification. - Sanjay Jain 001; Frank Stephan 001 (COLT, 2009)

On some open problems in reflective inductive inference. - Sanjay Jain 001 (Inf. Process. Lett., 2009)

On some open problems in monotonic and conservative learning. - Sanjay Jain 001 (Inf. Process. Lett., 2009)

Learning correction grammars. - Lorenzo Carlucci; John Case; Sanjay Jain 001 (J. Symb. Log., 2009)

Input-Dependence in Function-Learning. - Sanjay Jain 001; Eric Martin 002; Frank Stephan 001 (Theory Comput. Syst., 2009)

One-shot learners using negative counterexamples and nearest positive examples. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2009)

Prescribed learning of r.e. classes. - Sanjay Jain 001; Frank Stephan 001; Nan Ye (Theor. Comput. Sci., 2009)

Inductive Inference of Languages from Samplings. - Sanjay Jain 001; Efim B. Kinber (ALT, 2010)

Regular patterns, regular languages and context-free languages. - Sanjay Jain 001; Yuh Shin Ong; Frank Stephan 001 (Inf. Process. Lett., 2010)

Numberings optimal for learning. - Sanjay Jain 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2010)

Iterative learning of simple external contextual languages. - Leonor Becerra-Bonache; John Case; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2010)

Incremental learning with temporary memory. - Sanjay Jain 001; Steffen Lange; Samuel E. Moelius; Sandra Zilles (Theor. Comput. Sci., 2010)

Connections Between Inductive Inference and Machine Learning. - John Case; Sanjay Jain 001 (Encyclopedia of Machine Learning, 2010)

Complexity of Inductive Inference. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning, 2010)

Computational Complexity of Learning. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning, 2010)

Inductive Inference. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning, 2010)

Query-Based Learning. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning, 2010)

Hypothesis spaces for learning. - Sanjay Jain 001 (Inf. Comput., 2011)

Index sets and universal numberings. - Sanjay Jain 001; Frank Stephan 001; Jason Teutsch (J. Comput. Syst. Sci., 2011)

Iterative learning from texts and counterexamples using additional information. - Sanjay Jain 001; Efim B. Kinber (Mach. Learn., 2011)

Rice and Rice-Shapiro Theorems for transfinite correction grammars. - John Case; Sanjay Jain 001 (Math. Log. Q., 2011)

Uncountable automatic classes and learning. - Sanjay Jain 001; Qinglong Luo; Pavel Semukhin; Frank Stephan 001 (Theor. Comput. Sci., 2011)

Automatic Learning from Positive Data and Negative Counterexamples. - Sanjay Jain 001; Efim B. Kinber (ALT, 2012)

On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data. - Sanjay Jain 001; Frank Stephan 001; Thomas Zeugmann (TAMC, 2012)

Automatic learning of subclasses of pattern languages. - John Case; Sanjay Jain 001; Trong Dao Le; Yuh Shin Ong; Pavel Semukhin; Frank Stephan 001 (Inf. Comput., 2012)

Learning with ordinal-bounded memory from positive data. - Lorenzo Carlucci; Sanjay Jain 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2012)

Learnability of automatic classes. - Sanjay Jain 001; Qinglong Luo; Frank Stephan 001 (J. Comput. Syst. Sci., 2012)

Editors' Introduction. - Sanjay Jain 001; Rémi Munos; Frank Stephan 001; Thomas Zeugmann (ALT, 2013)

On Conservative Learning of Recursively Enumerable Languages. - Ziyuan Gao; Sanjay Jain 001; Frank Stephan 001 (CiE, 2013)

Automatic functions, linear time and learning. - John Case; Sanjay Jain 001; Samuel Seah; Frank Stephan 001 (Log. Methods Comput. Sci., 2013)

Learning and classifying. - Sanjay Jain 001; Eric Martin 002; Frank Stephan 001 (Theor. Comput. Sci., 2013)

Mind change speed-up for learning languages from positive data. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2013)

Learning without coding. - Sanjay Jain 001; Samuel E. Moelius III; Sandra Zilles (Theor. Comput. Sci., 2013)

Learning from Positive Data and Negative Counterexamples: A Survey. - Sanjay Jain 001; Efim B. Kinber (Computing with New Resources, 2014)

Graphs realised by r.e. equivalence relations. - Alexander Gavruskin; Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001 (Ann. Pure Appl. Log., 2014)

Automatic learners with feedback queries. - John Case; Sanjay Jain 001; Yuh Shin Ong; Pavel Semukhin; Frank Stephan 001 (J. Comput. Syst. Sci., 2014)

Robust learning of automatic classes of languages. - Sanjay Jain 001; Eric Martin 002; Frank Stephan 001 (J. Comput. Syst. Sci., 2014)

Priced Learning. - Sanjay Jain 001; Junqi Ma 001; Frank Stephan 001 (ALT, 2015)

Deterministic Frequency Pushdown Automata. - Cristian S. Calude; Rusins Freivalds; Sanjay Jain 001; Frank Stephan 001 (J. Univers. Comput. Sci., 2015)

When Cryptocurrencies Mine Their Own Business. - Jason Teutsch; Sanjay Jain 001; Prateek Saxena (Financial Cryptography, 2016)

Learning Automatic Families of Languages. - Sanjay Jain 001; Frank Stephan 001 (SOFSEM, 2016)

Inductive inference and reverse mathematics. - Rupert Hölzl 001; Sanjay Jain 001; Frank Stephan 001 (Ann. Pure Appl. Log., 2016)

How to verify computation with a rational network. - Sanjay Jain 001; Prateek Saxena; Frank Stephan 001; Jason Teutsch (CoRR, 2016)

On the role of update constraints and text-types in iterative learning. - Sanjay Jain 001; Timo Kötzing; Junqi Ma 001; Frank Stephan 001 (Inf. Comput., 2016)

Enlarging learnable classes. - Sanjay Jain 001; Timo Kötzing; Frank Stephan 001 (Inf. Comput., 2016)

Parallel learning of automatic classes of languages. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2016)

Tree-automatic scattered linear orders. - Sanjay Jain 001; Bakhadyr Khoussainov; Philipp Schlicht; Frank Stephan 001 (Theor. Comput. Sci., 2016)

Guest Editors' foreword. - Sanjay Jain 001; Rémi Munos; Frank Stephan 001; Thomas Zeugmann (Theor. Comput. Sci., 2016)

Automatic Learning from Repetitive Texts. - Rupert Hölzl 001; Sanjay Jain 001; Philipp Schlicht; Karen Seidel 001; Frank Stephan 001 (ALT, 2017)

An ordered approach to solving parity games in quasi polynomial time and quasi linear space. - John Fearnley; Sanjay Jain 001; Sven Schewe; Frank Stephan 001; Dominik Wojtczak (SPIN, 2017)

Deciding parity games in quasipolynomial time. - Cristian S. Calude; Sanjay Jain 001; Bakhadyr Khoussainov; Wei Li 050; Frank Stephan 001 (STOC, 2017)

Closed left-r.e. sets. - Sanjay Jain 001; Frank Stephan 001; Jason Teutsch (Comput., 2017)

Special issue on the conference Theory and Applications of Models of Computation. - Rahul Jain 001; Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2017)

Automatic learning from positive data and negative counterexamples. - Sanjay Jain 001; Efim B. Kinber; Frank Stephan 001 (Inf. Comput., 2017)

Semiautomatic Structures. - Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001; Dan Teng; Siyuan Zou (Theory Comput. Syst., 2017)

Enumerations including laconic enumerators. - Sanjay Jain 001; Jason Teutsch (Theor. Comput. Sci., 2017)

Connections Between Inductive Inference and Machine Learning. - John Case; Sanjay Jain 001 (Encyclopedia of Machine Learning and Data Mining, 2017)

Complexity of Inductive Inference. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning and Data Mining, 2017)

Computational Complexity of Learning. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning and Data Mining, 2017)

Inductive Inference. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning and Data Mining, 2017)

Query-Based Learning. - Sanjay Jain 001; Frank Stephan 001 (Encyclopedia of Machine Learning and Data Mining, 2017)

On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference. - Ziyuan Gao; Sanjay Jain 001; Frank Stephan 001; Thomas Zeugmann (ALT, 2018)

Finitely generated semiautomatic groups. - Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001 (Comput., 2018)

Effectivity questions for Kleene's recursion theorem. - John Case; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2018)

Learning pattern languages over groups. - Rupert Hölzl 001; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2018)

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. - Gordon Hoi; Sanjay Jain 001; Frank Stephan 001 (FSTTCS, 2019)

Random Subgroups of Rationals. - Ziyuan Gao; Sanjay Jain 001; Bakhadyr Khoussainov; Wei Li 050; Alexander G. Melnikov; Karen Seidel 001; Frank Stephan 001 (MFCS, 2019)

Exact Satisfiabitity with Jokers. - Gordon Hoi; Sanjay Jain 001; Sibylle Schwarz; Frank Stephan 001 (TAMC, 2019)

Reductions between types of numberings. - Ian Herbert; Sanjay Jain 001; Steffen Lempp; Manat Mustafa; Frank Stephan 001 (Ann. Pure Appl. Log., 2019)

The isomorphism problem for tree-automatic ordinals with addition. - Sanjay Jain 001; Bakhadyr Khoussainov; Philipp Schlicht; Frank Stephan 001 (Inf. Process. Lett., 2019)

The complexity of verbal languages over groups. - Sanjay Jain 001; Alexei Miasnikov; Frank Stephan 001 (J. Comput. Syst. Sci., 2019)

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. - John Fearnley; Sanjay Jain 001; Bart de Keijzer; Sven Schewe; Frank Stephan 001; Dominik Wojtczak (Int. J. Softw. Tools Technol. Transf., 2019)

Intrinsic complexity of partial learning. - Sanjay Jain 001; Efim B. Kinber (Theor. Comput. Sci., 2019)

A Faster Exact Algorithm to Count X3SAT Solutions. - Gordon Hoi; Sanjay Jain 001; Frank Stephan 001 (CP, 2020)

Ordered Semiautomatic Rings with Applications to Geometry. - Ziyuan Gao; Sanjay Jain 001; Ji Qi; Philipp Schlicht; Frank Stephan 001; Jacob Tarr (LATA, 2020)

Searching for shortest and least programs. - Cristian S. Calude; Sanjay Jain 001; Wolfgang Merkle; Frank Stephan 001 (Theor. Comput. Sci., 2020)

On the amount of nonconstructivity in learning formal languages from text. - Sanjay Jain 001; Frank Stephan 001; Thomas Zeugmann (Inf. Comput., 2021)

Bi-immunity over different size alphabets. - Cristian S. Calude; Karen Frilya Celine; Ziyuan Gao; Sanjay Jain 001; Ludwig Staiger; Frank Stephan 001 (Theor. Comput. Sci., 2021)

Alternating Automatic Register Machines. - Ziyuan Gao; Sanjay Jain 001; Zeyong Li; Ammar Fathin Sabili; Frank Stephan 001 (ICTAC, 2022)

Lamplighter groups and automata. - Sanjay Jain 001; Birzhan Moldagaliyev; Frank Stephan 001; Tien Dat Tran (Acta Informatica, 2022)

Learners based on transducers. - Sanjay Jain 001; Shao Ning Kuek; Eric Martin 002; Frank Stephan 001 (Inf. Comput., 2022)

Deciding Parity Games in Quasi-polynomial Time. - Cristian S. Calude; Sanjay Jain 001; Bakhadyr Khoussainov; Wei Li 050; Frank Stephan 001 (SIAM J. Comput., 2022)

A computation model with automatic functions and relations as primitive operations. - Ziyuan Gao; Sanjay Jain 001; Zeyong Li; Ammar Fathin Sabili; Frank Stephan 001 (Theor. Comput. Sci., 2022)

Languages given by Finite Automata over the Unary Alphabet. - Gordon Hoi; Sanjay Jain 001; Frank Stephan 001; Christopher Tan (CoRR, 2023)

Addition machines, automatic functions and open problems of Floyd and Knuth. - Sanjay Jain 001; Xiaodong Jia; Ammar Fathin Sabili; Frank Stephan 001 (J. Comput. Syst. Sci., 2023)

String compression in FA-presentable structures. - Dmitry Berdinsky; Sanjay Jain 001; Bakhadyr Khoussainov; Frank Stephan 001 (Theor. Comput. Sci., 2023)

Learnability and positive equivalence relations. - David R. Bélanger; Ziyuan Gao; Sanjay Jain 001; Wei Li 050; Frank Stephan 001 (Inf. Comput., 2023)

Quasi-Isometric Reductions Between Infinite Strings. - Karen Frilya Celine; Ziyuan Gao; Sanjay Jain 001; Ryan Lou; Frank Stephan 001; Guohua Wu (MFCS, 2024)

A Bisection Approach to Subcubic Maximum Induced Matching. - Gordon Hoi; Sanjay Jain 001; Ammar Fathin Sabili; Frank Stephan 001 (WALCOM, 2024)

An Improved Algorithm for Sparse Instances of SAT. - Sanjay Jain 001; Tzeh Yuan Neoh; Frank Stephan 001 (CoRR, 2024)

Languages given by finite automata over the unary alphabet. - Wojciech Czerwinski; Maciej Debski; Tomasz Gogasz; Gordon Hoi; Sanjay Jain 001; Michal Skrzypczak; Frank Stephan 001; Christopher Tan (J. Comput. Syst. Sci., 2025)