| 2008 |
|---|
| 28 | EE | Andrew Burt,
Michael Darschewski,
Indrajit Ray,
Ramakrishna Thurimella,
Hailin Wu:
Origins: an approach to trace fast spreading worms to their roots.
IJSN 3(1): 36-46 (2008) |
| 2007 |
|---|
| 27 | EE | James J. Treinen,
Ramakrishna Thurimella:
Application of the PageRank Algorithm to Alarm Graphs.
ICICS 2007: 480-494 |
| 2006 |
|---|
| 26 | EE | James J. Treinen,
Ramakrishna Thurimella:
A Framework for the Application of Association Rule Mining in Large Intrusion Detection Infrastructures.
RAID 2006: 1-18 |
| 2003 |
|---|
| 25 | EE | Hailin Wu,
Andrew Burt,
Ramki Thurimella:
Making Secure TCP Connections Resistant to Server Failures.
ACSAC 2003: 197-207 |
| 2000 |
|---|
| 24 | EE | Leana Golubchik,
Sanjeev Khanna,
Samir Khuller,
Ramakrishna Thurimella,
An Zhu:
Approximation algorithms for data placement on parallel disks.
SODA 2000: 223-232 |
| 23 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching.
SIAM J. Comput. 30(2): 528-560 (2000) |
| 1999 |
|---|
| 22 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation.
J. Algorithms 33(1): 15-50 (1999) |
| 1998 |
|---|
| 21 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Electronic Colloquium on Computational Complexity (ECCC) 5(25): (1998) |
| 1997 |
|---|
| 20 | | Ramakrishna Thurimella:
Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components.
J. Algorithms 23(1): 160-179 (1997) |
| 1996 |
|---|
| 19 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).
FOCS 1996: 292-301 |
| 18 | EE | Joseph Cheriyan,
Ramakrishna Thurimella:
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract).
STOC 1996: 37-46 |
| 1995 |
|---|
| 17 | | Ramakrishna Thurimella:
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Extended Abstract).
PODC 1995: 28-37 |
| 16 | | Mario Alberto López,
Ramakrishna Thurimella:
On Computing Connected Components of Line Segments.
IEEE Trans. Computers 44(4): 597-601 (1995) |
| 1994 |
|---|
| 15 | | Omer Berkman,
Joseph JáJá,
Sridhar Krishnamurthy,
Ramakrishna Thurimella,
Uzi Vishkin:
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima.
SIAM J. Comput. 23(3): 449-465 (1994) |
| 1993 |
|---|
| 14 | | Samir Khuller,
Ramakrishna Thurimella:
Approximation Algorithms for Graph Augmentation.
J. Algorithms 14(2): 214-225 (1993) |
| 13 | | Bernard L. Menezes,
Ivan Luiz Marques Ricarte,
Ramakrishna Thurimella:
Analysis of Pipelined External Sorting on a Reconfigurable Message-Passing Multicomputer.
Parallel Computing 19(8): 839-858 (1993) |
| 12 | | Joseph Cheriyan,
Ming-Yang Kao,
Ramakrishna Thurimella:
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity.
SIAM J. Comput. 22(1): 157-174 (1993) |
| 11 | | Donald S. Fussell,
Vijaya Ramachandran,
Ramakrishna Thurimella:
Finding Triconnected Components by Local Replacement.
SIAM J. Comput. 22(3): 587-616 (1993) |
| 1992 |
|---|
| 10 | | Samir Khuller,
Ramakrishna Thurimella:
Approximation Algorithms for Graph Augmentation.
ICALP 1992: 330-341 |
| 9 | | Ramakrishna Thurimella,
Yaacov Yesha:
A Scheduling Principle for Precedence Graphs with Communication Delay.
ICPP (3) 1992: 229-236 |
| 1991 |
|---|
| 8 | | Dipak Ghosal,
Amar Mukherjee,
Ramakrishna Thurimella,
Yaacov Yesha:
Mapping Task Trees onto a Linear Array.
ICPP (1) 1991: 629-633 |
| 7 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract)
STOC 1991: 391-401 |
| 1990 |
|---|
| 6 | | Omer Berkman,
Joseph JáJá,
Sridhar Krishnamurthy,
Ramakrishna Thurimella,
Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)
FOCS 1990: 871-881 |
| 5 | | Bernard L. Menezes,
Ramakrishna Thurimella:
Reliability Analysis of Two Classes of Double-Tree Network-Based Multiprocessors.
ICPP (1) 1990: 585-586 |
| 4 | | Donald S. Fussell,
Ramakrishna Thurimella:
Successive Approximation in Parallel Graph Algorithms.
Theor. Comput. Sci. 74(1): 19-35 (1990) |
| 1989 |
|---|
| 3 | | Donald S. Fussell,
Vijaya Ramachandran,
Ramakrishna Thurimella:
Finding Triconnected Components by Local Replacements.
ICALP 1989: 379-393 |
| 2 | | Donald S. Fussell,
Ramakrishna Thurimella:
Successive Approximation in Parallel Graph Algorithms.
STACS 1989: 205-217 |
| 1988 |
|---|
| 1 | | Donald S. Fussell,
Ramakrishna Thurimella:
Separation Pair Detection.
AWOC 1988: 149-159 |
