Since May 2019, I have been a postdoc at the Max Planck Institute for Software Systems, Kaiserslautern. I work with Georg Zetzsche and Rupak Majumdar . From October 2018 to March 2019, I was a Visiting Fellow at Chennai Mathematical Institute. I defended my PhD. thesis titled ``Definability and Decidability in First Order Theories of Graph Order'' on February 12, 2019. I was guided by Prof. R. Ramanujam of the Theoretical Computer Science department at the Institute of Mathematical Sciences, Chennai, India. You can find my CV here.

### General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond.

Rupak Majumdar, Ramanathan S Thinniyam, Georg Zetzsche.

*Submitted to TACAS 2021. Full Version*

### Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs.

Pascal Baumann, Rupak Majumdar, Ramanathan S Thinniyam, Georg Zetzsche.

*Accepted at POPL 2021. Full Version*

### The Complexity of Bounded Context Switching with Dynamic Thread Creation.

Pascal Baumann, Rupak Majumdar, Ramanathan S Thinniyam, Georg Zetzsche.

*47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Schloss Dagstuhl-Leibniz-Zentrum fur Informatik, 2020.*

### Regular Separability and Intersection Emptiness are Independent Problems.

Ramanathan S Thinniyam, Georg Zetzsche.

*Foundations of Software Technology and Theoretical Computer Science, 2019. Paper*

### Definability of recursive predicates in the induced subgraph order.

Ramanathan S Thinniyam.

*Indian Conference on Logic and Its Applications 2017 Jan 5 (pp. 211-223). Springer, Berlin, Heidelberg.*

### Definability in first order theories of graph orderings.

Ramaswamy Ramanujam, Ramanathan S Thinniyam.

*International Symposium on Logical Foundations of Computer Science 2016 Jan 4 (pp. 331-348). Springer, Cham. Paper*

### Network coding in optical networks with O/E/O based wavelength conversion.

Ramanathan S Thinniyam, Kim M, Medard M, O Reilly U.

*Optical Fiber Communication (OFC), collocated National Fiber Optic Engineers Conference, 2010 Conference on (OFC/NFOEC) 2010 Mar 21 (pp. 1-3) IEEE. Paper*

### Definability in first-order theories of graph orderings.

Ramaswamy Ramanujam, Ramanathan S Thinniyam.

*Journal of Logic and Computation 30.1 (2020): 403-420.*

### Defining recursive predicates in graph orders.

Ramanathan S Thinniyam.

*Logical Methods in Computer Science (LMCS). Sep 2018. Volume 14 Issue 3. Paper.*

### Regular Separability and Intersection Emptiness are Independent Problems.

at Highlights of Logic, Games and Automata, September 9, 2019

### Thesis Defence.

at IMSc, February 12, 2019

### The Graph Reconstruction Conjecture.

at Institute Seminar Day, IMSc, March 8, 2017

### Definability of Recursive Predicates in the Induced Subgraph Order.

at Indian Conference on Logic and its Applications (ICLA) January 5, 2017.

### Definability in First Order Theories of Graph Orderings.

at International Symposium on Logical Foundations of Computer Science (LFCS) December 28, 2015.

Room #612

Max Planck Institute for Software Systems

Paul-Ehrlich-Strasse, Building G 26,

D-67663
Kaiserslautern

Germany

Email: thinniyam
[AT]mpi-sws[DOT]org