 | 1993 |
|---|
| 13 |       | Shaunak Pawagi,
Owen Kaser:
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees.
Algorithmica 9(4): 357-381 (1993) |
| 12 |  | Owen Kaser,
C. R. Ramakrishnan,
Shaunak Pawagi:
On the Conversion of Indirect to Direct Recursion.
LOPLAS 2(1-4): 151-164 (1993) |
| 1992 |
|---|
| 11 | | Owen Kaser,
Shaunak Pawagi,
C. R. Ramakrishnan,
I. V. Ramakrishnan,
R. C. Sekar:
Fast Parallel Implementation of Lazy Languages - The EQUALS Experience.
LISP and Functional Programming 1992: 335-344 |
| 1990 |
|---|
| 10 | | R. C. Sekar,
Shaunak Pawagi,
I. V. Ramakrishnan:
Small Domains Spell Fast Strictness Analysis.
POPL 1990: 169-183 |
| 1989 |
|---|
| 9 | | Shaunak Pawagi:
A Parallel Algorithm for Multiple Updates of Minimum Spanning Trees.
ICPP (3) 1989: 9-15 |
| 8 | | R. C. Sekar,
Shaunak Pawagi,
I. V. Ramakrishnan:
Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution.
RTA 1989: 404-418 |
| 1987 |
|---|
| 7 | | Shaunak Pawagi:
Parallel Algorithm for Maximum Weight Matching in Trees.
ICPP 1987: 204-206 |
| 6 | | Shaunak Pawagi:
Maximum Weight Independent Set in Trees.
BIT 27(2): 170-180 (1987) |
| 5 | | Shaunak Pawagi,
P. S. Gopalakrishnan,
I. V. Ramakrishnan:
Computing Dominators in Parallel.
Inf. Process. Lett. 24(4): 217-221 (1987) |
| 1986 |
|---|
| 4 | | Shaunak Pawagi,
P. S. Gopalakrishnan,
I. V. Ramakrishnan:
A Parallel Algorithm for Dominators.
ICPP 1986: 877-879 |
| 3 | | Shaunak Pawagi,
I. V. Ramakrishnan:
An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees.
Inf. Process. Lett. 22(5): 223-229 (1986) |
| 1985 |
|---|
| 2 | | Deepak D. Sherlekar,
Shaunak Pawagi,
I. V. Ramakrishnan:
O(1) Parallel Time Incremental Graph Algorithms.
FSTTCS 1985: 477-495 |
| 1 | | Shaunak Pawagi,
I. V. Ramakrishnan:
Parallel Updates of Graph Properties in Logarithmic Time.
ICPP 1985: 186-193 |
