The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ramakrishna Thurimella: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Donald S. Fussell, Ramakrishna Thurimella
    Separation Pair Detection. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:149-159 [Conf]
  2. 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]
  3. 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]
  4. Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
    Finding Triconnected Components by Local Replacements. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:379-393 [Conf]
  5. Samir Khuller, Ramakrishna Thurimella
    Approximation Algorithms for Graph Augmentation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:330-341 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. Donald S. Fussell, Ramakrishna Thurimella
    Successive Approximation in Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:205-217 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. James J. Treinen, Ramakrishna Thurimella
    Application of the PageRank Algorithm to Alarm Graphs. [Citation Graph (0, 0)][DBLP]
    ICICS, 2007, pp:480-494 [Conf]

  27. Finding the Needle: Suppression of False Alarms in Large Intrusion Detection Data Sets. [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002