Amaldev Manuel

Assistant Professor, CSE
School of Mathematics and Computer Science
Indian Institute of Technology Goa
GEC Campus, Farmagudi, Ponda, Goa 403401
amal@iitgoa.ac.in

Hello!, I am an assistant professor in Computer Science and Engineering at the School of Mathematics (SMCS) at the Indian Institute of Technology (IIT) Goa. I am interested in the mathematical foundations of Computer Science, especially the study of automata and logic and their associated algebras. In particular I am interested in formal languages and finite semigroups, decidability of logics and automata etc.

Activities

Organizing Committee Chair, FSTTCS 2020
PC Member, DLT 2019
PC Co-Chair, ICLA 2019

Publications

  • Logics for Reversible Regular Languages and Semigroups with Involution, with Paul Gastin and Govind R., Developments in Language Theory (DLT) 2019 PDF
  • Logic and Its Applications - 8th Indian Conference, Proceedings, ICLA 2019, Lecture Notes in Computer Science 11600, with Md. Aquil Khan
  • Two-variable logic over countable linear orderings, with Sreejith A V, Mathematical Foundations of Computer Science (MFCS) 2016 PDF
  • Cost Functions Definable by Min/Max Automata, with Thomas Colcombet, Denis Kuperberg, and Szymon Toruńczyk, Symposium on Theoretical Aspects of Computer Science (STACS) 2016 PDF
  • Walking on datawords, with Anca Muscholl and Gabriele Puppis, Theory of Computing Systems, 2016 PDF
  • Uniformization Results on Regular Cost Functions, with Thomas Colcomber and Stefan Göller, Manuscript 2015 PDF
  • Fragments of Fixpoint Logic on Data Words, with Thomas Colcombet, Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2015 PDF
  • Combinatorial Expressions and lowerbounds, with Thomas Colcombet, Symposium on Theoretical Aspects of Computer Science (STACS) 2015 PDF
  • Generalized data automata and fixpoint logic, with Thomas Colcombet, Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2014 PDF
  • Definability and transformations for cost logics and automatic structures, with Martin Lang and Christof Löding, Mathematical Foundations of Computer Science (MFCS) 2014 PDF
  • Two variable logic on two dimensional structures, with Thomas Zeume, Computer Science Logic (CSL) 2013 PDF
  • Walking on datawords, with Anca Muscholl and Gabriele Puppis, Computer Science in Russia (CSR) 2013 PDF
  • Counter automata and classical logics for datawords, PhD Thesis, Institute of Mathematical Sciences, Chennai 2012 Thesis PDF Synopsis PDF Summary PDF
  • Automata on infinite alphabets, with R. Ramanujam, Modern Applications of Automata Theory, 2012 PDF
  • Class counting automata on data words, with R. Ramanujam, International Journal on Foundations of Computer Science (IJFCS) 2011 PDF
  • Two variables and two successors, Mathematical Foundations of Computer Science (MFCS) 2010 PDF
  • Counting multiplicity over infinite alphabets, with R. Ramanujam, Reachability Problems 2009 PDF
  • LTL with a suborder, European Summer School on Languages Logic and Information (ESSLLI) 2009 PDF

Teaching

CS101 Introduction to Computing through Python, Monsoon 2019
CS113 Data Structures and Algorithms, Summer 2018
CS251 Software Systems Lab, Monsoon 2018
CS207 Discrete Mathematical Structures, Monsoon 2017
CS310 Automata Theory, Summer 2017
CS113 Data Structures and Algorithms, Summer 2017
CS215 Data Analysis and Interpretation, Monsoon 2017
Algebraic Automata Theory, Jan-April 2017, Chennai Mathematical Institute