Sanjay Jain

Orcid: 0000-0001-6798-8330

Affiliations:
  • National University of Singapore


According to our database1, Sanjay Jain authored at least 212 papers between 1989 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Classifying different criteria for learning algebraic structures.
Ann. Pure Appl. Log., 2026

2024
An Improved Algorithm for Sparse Instances of SAT.
CoRR, 2024

A Bisection Approach to Subcubic Maximum Induced Matching.
Proceedings of the WALCOM: Algorithms and Computation, 2024

Quasi-Isometric Reductions Between Infinite Strings.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
String compression in FA-presentable structures.
Theor. Comput. Sci., February, 2023

Addition machines, automatic functions and open problems of Floyd and Knuth.
J. Comput. Syst. Sci., 2023

Languages given by Finite Automata over the Unary Alphabet.
CoRR, 2023

Languages Given by Finite Automata over the Unary Alphabet.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
A computation model with automatic functions and relations as primitive operations.
Theor. Comput. Sci., 2022

Deciding Parity Games in Quasi-polynomial Time.
SIAM J. Comput., 2022

Lamplighter groups and automata.
Acta Informatica, 2022

Alternating Automatic Register Machines.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

2021
Bi-immunity over different size alphabets.
Theor. Comput. Sci., 2021

On the amount of nonconstructivity in learning formal languages from text.
Inf. Comput., 2021

Learnability and Positive Equivalence Relations.
Proceedings of the Language and Automata Theory and Applications, 2021

2020
Searching for shortest and least programs.
Theor. Comput. Sci., 2020

Ordered Semiautomatic Rings with Applications to Geometry.
Proceedings of the Language and Automata Theory and Applications, 2020

A Faster Exact Algorithm to Count X3SAT Solutions.
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.
Int. J. Softw. Tools Technol. Transf., 2019

The isomorphism problem for tree-automatic ordinals with addition.
Inf. Process. Lett., 2019

Reductions between types of numberings.
Ann. Pure Appl. Log., 2019

Exact Satisfiabitity with Jokers.
Proceedings of the Theory and Applications of Models of Computation, 2019

Random Subgroups of Rationals.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Learners Based on Transducers.
Proceedings of the Language and Automata Theory and Applications, 2018

On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Query-Based Learning.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Inductive Inference.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Computational Complexity of Learning.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Complexity of Inductive Inference.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Connections Between Inductive Inference and Machine Learning.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Enumerations including laconic enumerators.
Theor. Comput. Sci., 2017

Automatic learning from positive data and negative counterexamples.
Inf. Comput., 2017

Special issue on the conference Theory and Applications of Models of Computation.
Inf. Comput., 2017

Deciding parity games in quasipolynomial time.
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.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

Automatic Learning from Repetitive Texts.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Guest Editors' foreword.
Theor. Comput. Sci., 2016

Tree-automatic scattered linear orders.
Theor. Comput. Sci., 2016

How to verify computation with a rational network.
CoRR, 2016

Learning Automatic Families of Languages.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

When Cryptocurrencies Mine Their Own Business.
Proceedings of the Financial Cryptography and Data Security, 2016

Finitely Generated Semiautomatic Groups.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

Intrinsic Complexity of Partial Learning.
Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

Learning Pattern Languages over Groups.
Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2015
Deterministic Frequency Pushdown Automata.
J. Univers. Comput. Sci., 2015

Inductive Inference and Reverse Mathematics.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

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

2014
Graphs realised by r.e. equivalence relations.
Ann. Pure Appl. Log., 2014

Semiautomatic Structures.
Proceedings of the Computer Science - Theory and Applications, 2014

Learning from Positive Data and Negative Counterexamples: A Survey.
Proceedings of the Computing with New Resources, 2014

On the Role of Update Constraints and Text-Types in Iterative Learning.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

Parallel Learning of Automatic Classes of Languages.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013
Learning without coding.
Theor. Comput. Sci., 2013

Effectivity Questions for Kleene's Recursion Theorem.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

On Conservative Learning of Recursively Enumerable Languages.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

Editors' Introduction.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012
Learning with ordinal-bounded memory from positive data.
J. Comput. Syst. Sci., 2012

On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data.
Proceedings of the Theory and Applications of Models of Computation, 2012

Mind Change Speed-up for Learning Languages from Positive Data.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

The Complexity of Verbal Languages over Groups.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Automatic Functions, Linear Time and Learning.
Proceedings of the How the World Computes, 2012

Enlarging Learnable Classes.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

Automatic Learning from Positive Data and Negative Counterexamples.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Rice and Rice-Shapiro Theorems for transfinite correction grammars.
Math. Log. Q., 2011

Closed Left-R.E. Sets.
Proceedings of the Theory and Applications of Models of Computation, 2011

Automatic Learning of Subclasses of Pattern Languages.
Proceedings of the Language and Automata Theory and Applications, 2011

Automatic Learners with Feedback Queries.
Proceedings of the Models of Computation in Context, 2011

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

Robust Learning of Automatic Classes of Languages.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Query-Based Learning.
Proceedings of the Encyclopedia of Machine Learning, 2010

Inductive Inference.
Proceedings of the Encyclopedia of Machine Learning, 2010

Computational Complexity of Learning.
Proceedings of the Encyclopedia of Machine Learning, 2010

Complexity of Inductive Inference.
Proceedings of the Encyclopedia of Machine Learning, 2010

Connections Between Inductive Inference and Machine Learning.
Proceedings of the Encyclopedia of Machine Learning, 2010

Incremental learning with temporary memory.
Theor. Comput. Sci., 2010

Regular patterns, regular languages and context-free languages.
Inf. Process. Lett., 2010

Learnability of Automatic Classes.
Proceedings of the Language and Automata Theory and Applications, 2010

Inductive Inference of Languages from Samplings.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
On some open problems in monotonic and conservative learning.
Inf. Process. Lett., 2009

On some open problems in reflective inductive inference.
Inf. Process. Lett., 2009

Hypothesis Spaces for Learning.
Proceedings of the Language and Automata Theory and Applications, 2009

Consistent Partial Identification.
Proceedings of the COLT 2009, 2009

Index Sets and Universal Numberings.
Proceedings of the Mathematical Theory and Computational Practice, 2009

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

Uncountable Automatic Classes and Learning.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

Iterative Learning from Texts and Counterexamples Using Additional Information.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Mitotic Classes in Inductive Inference.
SIAM J. Comput., 2008

Prescribed Learning of Indexed Families.
Fundam. Informaticae, 2008

Numberings Optimal for Learning.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

Iterative Learning of Simple External Contextual Languages.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
A general comparison of language learning from examples and from queries.
Theor. Comput. Sci., 2007

Some natural conditions on incremental learning.
Inf. Comput., 2007

Results on memory-limited U-shaped learning.
Inf. Comput., 2007

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

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

Input-Dependence in Function-Learning.
Proceedings of the Computation and Logic in the Real World, 2007

Prescribed Learning of R.E. Classes.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

Learning in Friedberg Numberings.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
Some Recent Results in U-Shaped Learning.
Proceedings of the Theory and Applications of Models of Computation, 2006

Invertible Classes.
Proceedings of the Theory and Applications of Models of Computation, 2006

On Learning Languages from Positive Data and a Limited Number of Short Counterexamples.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Memory-Limited U-Shaped Learning.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Towards a Better Understanding of Incremental Learning.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

Iterative Learning from Positive Data and Negative Counterexamples.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

Learning and Extending Sublanguages.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005
Preface.
Theor. Comput. Sci., 2005

Variations on U-Shaped Learning.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Editors' Introduction.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Absolute Versus Probabilistic Classification in a Logical Setting.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Gold-Style and Query Learning Under Various Constraints on the Target Class.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Learning Multiple Languages in Groups.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Non U-Shaped Vacillatory and Team Learning.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
Parsimony hierarchies for inductive inference.
J. Symb. Log., 2004

Counting extensional differences in BC-learning.
Inf. Comput., 2004

A Polynomial Time Learner for a Subclass of Regular Patterns
Electron. Colloquium Comput. Complex., 2004

Identifying Clusters from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

Learning Languages from Positive Data and a Finite Number of Queries.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Learning Languages from Positive Data and Negative Counterexamples.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
On learning of functions refutably.
Theor. Comput. Sci., 2003

On the intrinsic complexity of learning recursive functions.
Inf. Comput., 2003

The Intrinsic Complexity of Learning: A Survey.
Fundam. Informaticae, 2003

Learning All Subfunctions of a Function.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

Generality's Price: Inescapable Deficiencies in Machine-Learned Programs.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

Learning a Subclass of Regular Patterns in Polynomial Time.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002
Classes with Easily Learnable Subclasses.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001
On the learnability of recursively enumerable languages from good examples.
Theor. Comput. Sci., 2001

Some Independence Results for Control Structures in Complete Numberings.
J. Symb. Log., 2001

On an open problem in classification of languages.
J. Exp. Theor. Artif. Intell., 2001

Robust Learning Is Rich.
J. Comput. Syst. Sci., 2001

Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations.
J. Comput. Syst. Sci., 2001

Intrinsic Complexity of Learning Geometrical Concepts from Positive Data.
Proceedings of the Computational Learning Theory, 2001

Robust Learning - Rich and Poor.
Proceedings of the Computational Learning Theory, 2001

Learning How to Separate.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Learning by Switching Type of Information.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Learning Languages in a Union.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Learning Recursive Functions Refutably.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000
Learning languages and functions by erasing.
Theor. Comput. Sci., 2000

Team Learning of Computable Languages.
Theory Comput. Syst., 2000

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999
On a Question of Nearly Minimal Identification of Functions.
Inf. Process. Lett., 1999

Robust Behaviorally Correct Learning.
Inf. Comput., 1999

Incremental Concept Learning for Bounded Data Mining.
Inf. Comput., 1999

The Synthesis of Language Learners.
Inf. Comput., 1999

Costs of General Purpose Learning.
Proceedings of the STACS 99, 1999

Mind Change Complexity of Learning Logic Programs.
Proceedings of the Computational Learning Theory, 4th European Conference, 1999

On a Generalized Notion of Mistake Bounds.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
Minimal Concept Identification and Reliability.
Int. J. Found. Comput. Sci., 1998

Dynamics of individual specialization and global diversification in communities.
Complex., 1998

Generalization and Specialization Strategies for Learning r.e. Languages.
Ann. Math. Artif. Intell., 1998

Generalized Replicator Dynamics as a Model of Specialization and Diversity in Societies.
Adv. Complex Syst., 1998

On the Power of Learning Robustly.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

Robust Learning Aided by Context.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

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

Predictive Learning Models for Concept Drift.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

Synthesizing Learners Tolerating Computable Noisy Data.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Strong monotonic and set-driven inductive inference.
J. Exp. Theor. Artif. Intell., 1997

Characterizing Language Identification in Terms of Computable Numberings.
Ann. Pure Appl. Log., 1997

Control Structures in Hypothesis Spaces: The Influence on Learning.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Ordinal Mind Change Complexity of Language Identification.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Learning of R.E. Languages from Good Examples.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

Synthesizing Noise-Tolerant Language Learners.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Anomalous Learning Helps Succinctness.
Theor. Comput. Sci., 1996

Computational Limits on Team Identification of Languages.
Inf. Comput., 1996

Machine Induction Without Revolutionary Changes in Hypothesis Size.
Inf. Comput., 1996

Team Learning of Recursive Languages.
Proceedings of the PRICAI'96: Topics in Artificial Intelligence, 1996

Elementary Formal Systems, Intrinsic Complexity, and Procrastination.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

Synthesizing Enumeration Techniques for Language Learning.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

On Learning and Co-learning of Minimal Programs.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

Vacillatory and BC Learning on Noisy Data.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above
Inf. Comput., September, 1995

Prudence in Vacillatory Language Identification.
Math. Syst. Theory, 1995

On a Question About Learning Nearly Minimal Programs.
Inf. Process. Lett., 1995

An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings.
Int. J. Found. Comput. Sci., 1995

On Identification by Teams and Probabilistic Machines.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Not-So-Nearly-Minimal-Size Program Inference.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Branch and Bound on the Network Model.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

The structure of intrinsic complexity of learning.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

Kolmogorov numberings and minimal identification.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

Machine Induction Without Revolutionary Paradigm Shifts.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Program Size Restrictions in Computational Learning.
Theor. Comput. Sci., 1994

Refinements of inductive inference by Popperian and reliable machines.
Kybernetika, 1994

Characterizing Language Identification by Standardizing Operations.
J. Comput. Syst. Sci., 1994

Open Problems in "Systems That Learn".
J. Comput. Syst. Sci., 1994

Vacillatory Learning of Nearly Minimal Size Grammars.
J. Comput. Syst. Sci., 1994

Extremes in the Degrees of Inferability.
Ann. Pure Appl. Log., 1994

On the Intrinsic Complexity of Language Identification.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

On Monotonic Strategies for Learning r.e. Languages.
Proceedings of the Algorithmic Learning Theory, 1994

Program Synthesis in the Presence of Infinite Number of Inaccuracies.
Proceedings of the Algorithmic Learning Theory, 1994

1993
Learning with the Knowledge of an Upper Bound on Program Size
Inf. Comput., January, 1993

On the Non-Existence of Maximal Inference Degrees for Language Identification.
Inf. Process. Lett., 1993

Language Learning With Some Negative Information.
Proceedings of the STACS 93, 1993

Probability is More Powerful Than Team for Language Identification from Positive Data.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On Aggregating Teams of Learning Machines.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
Banishing Robust Turing Completeness.
Proceedings of the Logical Foundations of Computer Science, 1992

Machine Learning of Higher Order Programs.
Proceedings of the Logical Foundations of Computer Science, 1992

On Learning Limiting Programs.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Prudence in Vacillatory Language Identification (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

Strong Separation of Learning Classes.
Proceedings of the Analogical and Inductive Inference, 1992

Learning from Multiple Sources of Inaccurate Data.
Proceedings of the Analogical and Inductive Inference, 1992

1991
Learning in the Presence of Partial Explanations
Inf. Comput., December, 1991

Complexity Issues for Vacillatory Function Identification.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
Hypothesis Formation and Language Acquisition with an Infinitely-Often Correct Teacher.
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

Language Learning by a "Team" (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Finite Learning by a "Team".
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

Approximate Inference and Scientific Method.
Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990

Anomalous Learning Helps Succinctness (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990

1989
On the Limitations of Locally Robust Positive Reductions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

Learning in the Presence of Inaccurate Information.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989


  Loading...