Combinatory Formulations of Concurrent Languages. - N. Raja 001; R. K. Shyamasundar (ASIAN, 1995)

The Quine-Bernays Combinatory Calculus. - N. Raja 001; R. K. Shyamasundar (Int. J. Found. Comput. Sci., 1995)

Actors as a Coordinating Model of Computation (Extended Abstract). - N. Raja 001; R. K. Shyamasundar (Ershov Memorial Conference, 1996)

Combinatory Formaulations of Concurrent Languages. - N. Raja 001; R. K. Shyamasundar (ACM Trans. Program. Lang. Syst., 1997)

Mobile Computation: Calculus and Languages (A Tutorial). - N. Raja 001; R. K. Shyamasundar (ASIAN, 1998)

Type Systems for Concurrent Programming Calculi. - N. Raja 001; R. K. Shyamasundar (Informatica (Slovenia), 2004)

A Negation-free Proof of Cantor's Theorem. - N. Raja 001 (Notre Dame J. Formal Log., 2005)

Actors as a Coordinating Model of Computation. - N. Raja 001; R. K. Shyamasundar (Informatica (Slovenia), 2006)

A closer look at constraints as processes. - N. Raja 001; R. K. Shyamasundar (Inf. Process. Lett., 2006)

On Attending Conferences. - Raja Natarajan (Computer, 2008)

Social processes, program verification and all that. - Andrea Asperti; Herman Geuvers; Raja Natarajan (Math. Struct. Comput. Sci., 2009)

An Outline of Separation Logic. - Abhishek Kr Singh; Raja Natarajan (CoRR, 2017)

Towards a Constructive Formalization of Perfect Graph Theorems. - Abhishek Kr Singh; Raja Natarajan (ICLA, 2019)

A constructive formalization of the weak perfect graph theorem. - Abhishek Kr Singh; Raja Natarajan (CPP, 2020)

Verified Double Sided Auctions for Financial Markets. - Raja Natarajan; Suneel Sarswat; Abhishek Kr Singh (ITP, 2021)

Double Auctions: Formalization and Automated Checkers. - Mohit Garg 003; N. Raja 001; Suneel Sarswat; Abhishek Kr Singh (J. Autom. Reason., 2025)