Dr. Sreejith A V

Designation : Associate Professor

Broad Area of Expertise : Computer Science and Engineering

Email : sreejithav{at}iitgoa.ac.in

Contact Number : 0832-2490-125

Address : F-6, Academic Block A.

Personal Page

Educational Qualifications

  1. Ph.D. in Theoretical Computer Science at Institute of Mathematical Sciences(IMSc), Chennai
  2. MTech in Computer Science, IIT Madras, Chennai
  3. BTech in Computer Science, College of Engineering

Areas of Research

Logic, Automata Theory, Formal Methods, and Verification, Data Science

Courses Taught

IIT Goa,

  1. Advanced data structures and algorithms
  2. High dimensional data science
  3. Data structures and algorithms
  4. Algorithm design lab
  5. Combinatorial optimization
  6. Logic for computer science
  7. Advanced algorithms
  8. Topics in Logic and Automata theory
  9. Computer programming
  10. Computer networks

University of Tubingen, Germany

  1. Verification

Professional Appointments

  1. PostDoc at Institute of Informatics, University of Warsaw, Poland
  2. Visiting Faculty at Chennai Mathematical Institute (CMI)
  3. PostDoc at Laboratoire d'Informatique Algorithmique: Fondements et Applications (LIAFA), Paris, France
  4. PostDoc at Tata Institute of Fundamental Research (TIFR), Mumbai

Recent Publications

  1. Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith, First-Order logic and its Infinitary Quantifier Extensions over Countable Words, FCT, 2021
  2. Gaurav, K., Metivier, F., A V Sreejith, Sinha, R., Kumar, A., and Tandon, S. K.: “Coupling threshold theory and satellite-derived channel width to estimate the formative discharge of Himalayan foreland rivers”, Earth Surface Dynamics, 9, 47-70, https://doi.org/10.5194/esurf-9-47-2021, 2021
  3. M. Bojanczyk, L. Daviaud, B. Guillon, V. Penelle, A. V. Sreejith “Undecidability of a weak version of MSO+U”, Logical Methods in Computer Science (LMCS), volume 16:1, 2020.
  4. Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith, “Block products for algebras over countable words and applications to logic”, Logic in Computer Science (LICS), pages 1-13, 2019.
  5. Kamal Lodaya, A. V. Sreejith, “Two variable first order logic with counting quantifiers: complexity results”, Developments in Language Theory (DLT), LNCS 10396, pages 260 - 271, 2017.
  6. Amaldev Manuel, A. V. Sreejith, “Two variable logic over countable linear orderings”, Mathematical Foundations of Computer Science (MFCS), LIPIcs 58, pages 66:1-66:13, 2016.
  7. Thomas Colcombet, A. V. Sreejith, “Limited Set quantifiers over Countable Linear Orderings”, Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium (ICALP), volume 9135 of LNCS, pages 146-158, 2015.
  8. Kamal Lodaya, A. V. Sreejith, “Counting quantifiers and linear arithmetic on word models” with Kamal Lodaya in 14th Asian Logic Conference (ALC), 2014.
  9. V. Arvind, S. Raja, A. V. Sreejith, “On lower bounds for multiplicative circuits and linear circuits in noncommutative domains”, 9th International Computer Science Symposium in Russia (CSR), volume 8476 of LNCS, pages 65-76, 2014.
  10. Andreas Krebs, A. V. Sreejith, “Non-definability of Languages by Generalized First-order Formulas over (N, +)”, Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 451-460, 2012.
  11. A. V. Sreejith, “Expressive Completeness for LTL With Modulo Counting and Group Quantifiers”, Electronic Notes in Theoretical Computer Science, ENTCS 278, pages 201-214, 2011.
  12. Kamal Lodaya, A. V. Sreejith, “LTL can be more succinct”, Proceedings of Automated Technology for Verification and Analysis (ATVA), LNCS 6252, 21- 24, 2010.

Recognition and Awards

  1. ACM India Doctoral Dissertation Award 2014: Honourable mention for doctoral dissertation (link to ACM website)
Edit Profile