O(1) Parallel Time Incremental Graph Algorithms. - Deepak D. Sherlekar; Shaunak Pawagi; I. V. Ramakrishnan (FSTTCS, 1985)

Parallel Updates of Graph Properties in Logarithmic Time. - Shaunak Pawagi; I. V. Ramakrishnan (ICPP, 1985)

A Parallel Algorithm for Dominators. - Shaunak Pawagi; P. S. Gopalakrishnan; I. V. Ramakrishnan (ICPP, 1986)

An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. - Shaunak Pawagi; I. V. Ramakrishnan (Inf. Process. Lett., 1986)

Parallel Algorithm for Maximum Weight Matching in Trees. - Shaunak Pawagi (ICPP, 1987)

Maximum Weight Independent Set in Trees. - Shaunak Pawagi (BIT, 1987)

Computing Dominators in Parallel. - Shaunak Pawagi; P. S. Gopalakrishnan; I. V. Ramakrishnan (Inf. Process. Lett., 1987)

A Parallel Algorithm for Multiple Updates of Minimum Spanning Trees. - Shaunak Pawagi (ICPP (3), 1989)

Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution. - R. C. Sekar 001; Shaunak Pawagi; I. V. Ramakrishnan (RTA, 1989)

Small Domains Spell Fast Strictness Analysis. - R. C. Sekar 001; Shaunak Pawagi; I. V. Ramakrishnan (POPL, 1990)

Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. - Owen Kaser; Shaunak Pawagi; C. R. Ramakrishnan 001; I. V. Ramakrishnan; R. C. Sekar 001 (LISP and Functional Programming, 1992)

Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. - Shaunak Pawagi; Owen Kaser (Algorithmica, 1993)

On the Conversion of Indirect to Direct Recursion. - Owen Kaser; C. R. Ramakrishnan 001; Shaunak Pawagi (LOPLAS, 1993)