|
Search the dblp DataBase
Ramakrishna Thurimella:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Donald S. Fussell, Ramakrishna Thurimella
Separation Pair Detection. [Citation Graph (0, 0)][DBLP] AWOC, 1988, pp:149-159 [Conf]
- Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:871-881 [Conf]
- Joseph Cheriyan, Ramakrishna Thurimella
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). [Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:292-301 [Conf]
- Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
Finding Triconnected Components by Local Replacements. [Citation Graph (0, 0)][DBLP] ICALP, 1989, pp:379-393 [Conf]
- Samir Khuller, Ramakrishna Thurimella
Approximation Algorithms for Graph Augmentation. [Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:330-341 [Conf]
- Dipak Ghosal, Amar Mukherjee, Ramakrishna Thurimella, Yaacov Yesha
Mapping Task Trees onto a Linear Array. [Citation Graph (0, 0)][DBLP] ICPP (1), 1991, pp:629-633 [Conf]
- Bernard L. Menezes, Ramakrishna Thurimella
Reliability Analysis of Two Classes of Double-Tree Network-Based Multiprocessors. [Citation Graph (0, 0)][DBLP] ICPP (1), 1990, pp:585-586 [Conf]
- Ramakrishna Thurimella, Yaacov Yesha
A Scheduling Principle for Precedence Graphs with Communication Delay. [Citation Graph (0, 0)][DBLP] ICPP (3), 1992, pp:229-236 [Conf]
- Ramakrishna Thurimella
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Extended Abstract). [Citation Graph (0, 0)][DBLP] PODC, 1995, pp:28-37 [Conf]
- James J. Treinen, Ramakrishna Thurimella
A Framework for the Application of Association Rule Mining in Large Intrusion Detection Infrastructures. [Citation Graph (0, 0)][DBLP] RAID, 2006, pp:1-18 [Conf]
- Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu
Approximation algorithms for data placement on parallel disks. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:223-232 [Conf]
- Donald S. Fussell, Ramakrishna Thurimella
Successive Approximation in Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP] STACS, 1989, pp:205-217 [Conf]
- Joseph Cheriyan, Ramakrishna Thurimella
Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) [Citation Graph (0, 0)][DBLP] STOC, 1991, pp:391-401 [Conf]
- Joseph Cheriyan, Ramakrishna Thurimella
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1996, pp:37-46 [Conf]
- Joseph Cheriyan, Ramakrishna Thurimella
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:25, pp:- [Journal]
- Joseph Cheriyan, Ramakrishna Thurimella
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:15-50 [Journal]
- Samir Khuller, Ramakrishna Thurimella
Approximation Algorithms for Graph Augmentation. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1993, v:14, n:2, pp:214-225 [Journal]
- Ramakrishna Thurimella
Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:23, n:1, pp:160-179 [Journal]
- Bernard L. Menezes, Ivan Luiz Marques Ricarte, Ramakrishna Thurimella
Analysis of Pipelined External Sorting on a Reconfigurable Message-Passing Multicomputer. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1993, v:19, n:8, pp:839-858 [Journal]
- Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:3, pp:449-465 [Journal]
- Joseph Cheriyan, Ming-Yang Kao, Ramakrishna Thurimella
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:1, pp:157-174 [Journal]
- Joseph Cheriyan, Ramakrishna Thurimella
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:2, pp:528-560 [Journal]
- Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
Finding Triconnected Components by Local Replacement. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:3, pp:587-616 [Journal]
- Mario Alberto López, Ramakrishna Thurimella
On Computing Connected Components of Line Segments. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1995, v:44, n:4, pp:597-601 [Journal]
- Donald S. Fussell, Ramakrishna Thurimella
Successive Approximation in Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:1, pp:19-35 [Journal]
- James J. Treinen, Ramakrishna Thurimella
Application of the PageRank Algorithm to Alarm Graphs. [Citation Graph (0, 0)][DBLP] ICICS, 2007, pp:480-494 [Conf]
Finding the Needle: Suppression of False Alarms in Large Intrusion Detection Data Sets. [Citation Graph (, )][DBLP]
Search in 0.124secs, Finished in 0.126secs
|