Conference Papers

12

Sarnath Ramnath: Dynamic digraph connectivity hastens minimum sum-of-diameters clustering, to appear in SIAM Journal of Discrete Math

11

Sarnath Ramnath: New approximations for the Rectilinear Steiner Arborescence Problem, IEEE Transactions on CAD of ICS, July 2003

10.

Sarnath Ramnath, Brahma Dathan: Pattern Integration: Emphasizing the De-Coupling of Software Subsystems in Conjunction with the Use of Design Patterns. Journal of Object Technology 2(2): 7-16 (2003)

9.

Sarnath Ramnath, Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm. SWAT 2002: 220-229

8.

Sarnath Ramnath, Peiyi Zhao: On the isomorphism of expressions. Inf. Process. Lett. 74(3-4): 97-102 (2000)

7.

Sarnath Ramnath, Venkatesh Raman: Selecting Small Ranks in EREW PRAM. Inf. Process. Lett. 71(5-6): 183-186 (1999)

6.

Venkatesh Raman, Sarnath Ramnath: Improved Upper Bounds for Time-Space Trade-offs for Selection. Nord. J. Comput. 6(2): 162-180 (1999)

5.

Venkatesh Raman, Sarnath Ramnath: Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage. SWAT 1998: 131-142

4.

Sarnath Ramnath, Hong Shen: A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract). WADS 1997: 368-377

3.

Sarnath Ramnath, Sivaprakasam Sunder: On Two-Processor Scheduling and Maximum Matching in Permutation Graphs. Inf. Process. Lett. 57(6): 321-327 (1996)

2.

Hong Shen, Sarnath Ramnath: Optimal Parallel Selection in Sorted Matrices. Inf. Process. Lett. 59(3): 117-122 (1996)

1.

Sarnath Ramnath: DTML is Logspace Hard under NC1 Reductions. Parallel Processing Letters 2: 189-193 (1992)