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)

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)

Probability is More Powerful Than Team for Language Identification from Positive Data. - Sanjay Jain 001; Arun Sharma 001 (COLT, 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)

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

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

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

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

On Identification by Teams and Probabilistic Machines. - Sanjay Jain 001; Arun Sharma 001 (GOSLER Final Report, 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)

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)

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)

ILP with Noise and Fixed Example Size: A Bayesian Approach. - Eric McCreath; Arun Sharma 001 (IJCAI, 1997)

On the Classification of Computable Languages. - John Case; Efim B. Kinber; Arun Sharma 001; Frank Stephan 001 (STACS, 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)

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)

LIME: A System for Learning Relations. - Eric McCreath; Arun Sharma 001 (ALT, 1998)

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

A Note on Batch and Incremental Learnability. - Arun Sharma 001 (J. Comput. Syst. Sci., 1998)

The VC-Dimension of Subclasses of Pattern. - Andrew R. Mitchell; Tobias Scheffer; Arun Sharma 001; Frank Stephan 001 (ALT, 1999)

On Sufficient Conditions for Learnability of Logic Programs from Positive Data. - Eric Martin 002; Arun Sharma 001 (ILP, 1999)

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

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)

A General Theory of Deduction, Induction, and Learning. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (Discovery Science, 2001)

On a Generalized Notion of Mistake Bounds. - Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 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)

Learning, Logic, and Topology in a Common Framework. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (ALT, 2002)

Learning in Logic with RichProlog. - Eric Martin 002; Phuong Minh Nguyen; Arun Sharma 001; Frank Stephan 001 (ICLP, 2002)

Learning to Win Process-Control Games Watching Game-Masters. - John Case; Matthias Ott; Arun Sharma 001; Frank Stephan 001 (Inf. Comput., 2002)

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

Preface - Osamu Watanabe 001; Arun Sharma 001 (Theor. Comput. Sci., 2002)

Learning power and language expressiveness. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (Theor. Comput. Sci., 2003)

Web Searching and S 2 Queries. - Arun Sharma 001 (APWeb, 2004)

On the classification of recursive languages. - John Case; Efim B. Kinber; Arun Sharma 001; Frank Stephan 001 (Inf. Comput., 2004)

Generalized notions of mind change complexity. - Arun Sharma 001; Frank Stephan 001; Yuri Ventsov (Inf. Comput., 2004)

Some applications of logic to feasibility in higher types. - Aleksandar Ignjatovic; Arun Sharma 001 (ACM Trans. Comput. Log., 2004)

On a Syntactic Characterization of Classification with a Mind Change Bound. - Eric Martin 002; Arun Sharma 001 (COLT, 2005)

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

Unifying logic, topology and learning in Parametric logic. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (Theor. Comput. Sci., 2006)

On ordinal VC-dimension and some notions of complexity. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (Theor. Comput. Sci., 2006)

On the data consumption benefits of accepting increased uncertainty. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (Theor. Comput. Sci., 2007)

Deduction, Induction, and beyond in Parametric Logic. - Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (Induction, Algorithmic Learning Theory, and Philosophy, 2007)