Ramki Thurimella
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j16 | Rinku Dewri, Ramakrishna Thurimella: Can a Phone's GPS "Lie" Intelligently? IEEE Computer 46(2): 91-93 (2013) | |
| 2012 | ||
| c19 | Matthias Wachs, Christian Grothoff, Ramakrishna Thurimella: Partitioning the Internet. CRiSIS 2012: 1-8 | |
| 2011 | ||
| j15 | S. Andrew Johnson, Dinesh P. Mehta, Ramakrishna Thurimella: Identifying algorithmic vulnerabilities through simulated annealing. Optimization Letters 5(3): 479-490 (2011) | |
| j14 | David Pritchard, Ramakrishna Thurimella: Fast computation of small cuts via cycle space sampling. ACM Transactions on Algorithms 7(4): 46 (2011) | |
| 2010 | ||
| c18 | Taylor Phillips, Chris GauthierDickey, Ramki Thurimella: Using Transitivity to Increase the Accuracy of Sample-Based Pearson Correlation Coefficients. DaWak 2010: 157-171 | |
| 2009 | ||
| j13 | Ramakrishna Thurimella, William Mitchell: Cloak and Dagger: Man-In-The-Middle and Other Insidious Attacks. IJISP 3(3): 55-75 (2009) | |
| j12 | Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu: Approximation algorithms for data placement on parallel disks. ACM Transactions on Algorithms 5(4) (2009) | |
| c17 | James J. Treinen, Ramakrishna Thurimella: Finding the Needle: Suppression of False Alarms in Large Intrusion Detection Data Sets. CSE (2) 2009: 237-244 | |
| 2008 | ||
| j11 | 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 | ||
| c16 | James J. Treinen, Ramakrishna Thurimella: Application of the PageRank Algorithm to Alarm Graphs. ICICS 2007: 480-494 | |
| 2006 | ||
| c15 | James J. Treinen, Ramakrishna Thurimella: A Framework for the Application of Association Rule Mining in Large Intrusion Detection Infrastructures. RAID 2006: 1-18 | |
| 2003 | ||
| c14 | Hailin Wu, Andrew Burt, Ramki Thurimella: Making Secure TCP Connections Resistant to Server Failures. ACSAC 2003: 197-206 | |
| 2000 | ||
| j10 | Joseph Cheriyan, Ramakrishna Thurimella: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. SIAM J. Comput. 30(2): 528-560 (2000) | |
| c13 | Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu: Approximation algorithms for data placement on parallel disks. SODA 2000: 223-232 | |
| 1999 | ||
| j9 | Joseph Cheriyan, Ramakrishna Thurimella: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. J. Algorithms 33(1): 15-50 (1999) | |
| 1998 | ||
| i1 | Joseph Cheriyan, Ramakrishna Thurimella: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. Electronic Colloquium on Computational Complexity (ECCC) 5(25) (1998) | |
| 1997 | ||
| j8 | Ramakrishna Thurimella: Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components. J. Algorithms 23(1): 160-179 (1997) | |
| 1996 | ||
| c12 | Joseph Cheriyan, Ramakrishna Thurimella: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). FOCS 1996: 292-301 | |
| c11 | Joseph Cheriyan, Ramakrishna Thurimella: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract). STOC 1996: 37-46 | |
| 1995 | ||
| j7 | Mario Alberto López, Ramakrishna Thurimella: On Computing Connected Components of Line Segments. IEEE Trans. Computers 44(4): 597-601 (1995) | |
| c10 | Ramakrishna Thurimella: Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Extended Abstract). PODC 1995: 28-37 | |
| 1994 | ||
| j6 | 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 | ||
| j5 | Samir Khuller, Ramakrishna Thurimella: Approximation Algorithms for Graph Augmentation. J. Algorithms 14(2): 214-225 (1993) | |
| j4 | 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) | |
| j3 | 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) | |
| j2 | Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella: Finding Triconnected Components by Local Replacement. SIAM J. Comput. 22(3): 587-616 (1993) | |
| 1992 | ||
| c9 | Samir Khuller, Ramakrishna Thurimella: Approximation Algorithms for Graph Augmentation. ICALP 1992: 330-341 | |
| c8 | Ramakrishna Thurimella, Yaacov Yesha: A Scheduling Principle for Precedence Graphs with Communication Delay. ICPP (3) 1992: 229-236 | |
| 1991 | ||
| c7 | Dipak Ghosal, Amar Mukherjee, Ramakrishna Thurimella, Yaacov Yesha: Mapping Task Trees onto a Linear Array. ICPP (1) 1991: 629-633 | |
| c6 | Joseph Cheriyan, Ramakrishna Thurimella: Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract). STOC 1991: 391-401 | |
| 1990 | ||
| j1 | Donald S. Fussell, Ramakrishna Thurimella: Successive Approximation in Parallel Graph Algorithms. Theor. Comput. Sci. 74(1): 19-35 (1990) | |
| c5 | Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin: Some Triply-Logarithmic Parallel Algorithms (Extended Abstract). FOCS 1990: 871-881 | |
| c4 | Bernard L. Menezes, Ramakrishna Thurimella: Reliability Analysis of Two Classes of Double-Tree Network-Based Multiprocessors. ICPP (1) 1990: 585-586 | |
| 1989 | ||
| c3 | Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella: Finding Triconnected Components by Local Replacements. ICALP 1989: 379-393 | |
| c2 | Donald S. Fussell, Ramakrishna Thurimella: Successive Approximation in Parallel Graph Algorithms. STACS 1989: 205-217 | |
| 1988 | ||
| c1 | ||
Colors in the list of coauthors
Last update Sat May 25 08:12:41 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page