sanjay jain

Employment

• National University of Singapore Professor
  1994 - Present
• National University of Singapore Associate Research Staff
  1992 - 1994
• University of Delaware Assistant Professor
  1990 - 1992

Education

• University of Rochester PhD
  1986 - 1990
• Indian Institute of Technology Kharagpur B. Technology
  1982 - 1986

Projects & Funding

Projects & funding information is unavailable.

Publications (25)

• An Improved Algorithm for Sparse Instances of SAT
  2026 DOI: 10.2139/ssrn.7330510
  +Save
• Lamplighter groups and automata
  Acta Informatica 2022 DOI: 10.1007/s00236-022-00423-3
  +Save
• A computation model with automatic functions and relations as primitive operations
  Theoretical Computer Science 2022 DOI: 10.1016/j.tcs.2022.04.038
  +Save
• Deciding Parity Games in Quasi-polynomial Time
  SIAM Journal on Computing 2022 DOI: 10.1137/17m1145288
  +Save
• Learnability and positive equivalence relations
  Information and Computation 2022 DOI: 10.1016/j.ic.2022.104913
  +Save
• Learners based on transducers
  Information and Computation 2022 DOI: 10.1016/j.ic.2020.104676
  +Save
• On the amount of nonconstructivity in learning formal languages from text
  Information and Computation 2021 DOI: 10.1016/j.ic.2020.104668
  +Save
• Bi-immunity over different size alphabets
  Theoretical Computer Science 2021 DOI: 10.1016/j.tcs.2021.09.005
  +Save
• Learnability and Positive Equivalence Relations
  Language and Automata Theory and Applications 2021 DOI: 10.1007/978-3-030-68195-1_12
  +Save
• Searching for shortest and least programs
  Theoretical Computer Science 2020 DOI: 10.1016/j.tcs.2019.10.011
  +Save
• A Faster Exact Algorithm to Count X3SAT Solutions
  Lecture Notes in Computer Science 2020 DOI: 10.1007/978-3-030-58475-7_22
  +Save
• Ordered Semiautomatic Rings with Applications to Geometry
  Language and Automata Theory and Applications 2020 DOI: 10.1007/978-3-030-40608-0_9
  +Save
• Reductions between types of numberings
  Annals of Pure and Applied Logic 2019 DOI: 10.1016/j.apal.2019.102716
  +Save
• The isomorphism problem for tree-automatic ordinals with addition
  Information Processing Letters 2019 DOI: 10.1016/j.ipl.2019.05.004
  +Save
• Intrinsic complexity of partial learning
  Theoretical Computer Science 2019 DOI: 10.1016/j.tcs.2018.12.022
  +Save
• An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space
  International Journal on Software Tools for Technology Transfer 2019 DOI: 10.1007/s10009-019-00509-3
  +Save
• The complexity of verbal languages over groups
  Journal of Computer and System Sciences 2019 DOI: 10.1016/j.jcss.2018.10.005
  +Save
• A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT
  Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2019 DOI: 10.4230/LIPICS.FSTTCS.2019.17
  +Save
• Exact Satisfiabitity with Jokers
  Lecture Notes in Computer Science 2019 DOI: 10.1007/978-3-030-14812-6_17
  +Save
• Random Subgroups of Rationals
  Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2019 DOI: 10.4230/LIPICS.MFCS.2019.25
  +Save