Browse by Fellow

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 35.

Sosa, Maria Ximena ; Sivakumar, I. K. Ashok ; Maragh, Samantha ; Veeramachaneni, Vamsi ; Hariharan, Ramesh ; Parulekar, Minothi ; Fredrikson, Karin M. ; Harkins, Timothy T. ; Lin, Jeffrey ; Feldman, Andrew B. ; Tata, Pramila ; Ehret, Georg B. ; Chakravarti, Aravinda (2012) Next-generation sequencing of human mitochondrial reference genomes uncovers high heteroplasmy frequency PLoS Computational Biology, 8 (10). Article ID e1002737-11 pages. ISSN 1553-734X

Hariharan, Ramesh ; Janakiraman, Anand ; Nilakantan, Ramaswamy ; Singh, Bhupender ; Varghese, Sajith ; Landrum, Gregory ; Schuffenhauer, Ansgar (2011) MultiMCS: a fast algorithm for the maximum common substructure problem on multiple molecules Journal of Chemical Information and Modeling, 51 (4). pp. 788-806. ISSN 1549-9596

Fung, Wai Shing ; Hariharan, Ramesh ; Harvey, Nicholas J. A. ; Panigrahi, Debmalya (2011) A general framework for graph sparsification In: STOC '11 Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, June 06 - 08, 2011, San Jose, California, USA.

Bhalgat, Anand ; Hariharan, Ramesh (2009) Fast edge orientation for unweighted graphs In: SODA '09 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, January 04-06, 2009, New York, New York.

Bhalgat, Anand ; Hariharan, Ramesh ; Telikepalli, Kavitha ; Panigra, Debmalya (2008) Fast edge splitting and Edmonds' arborescence construction for unweighted graphs In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 20-22, 2008, San Francisco, California.

Hariharan, Ramesh ; Kavitha, Telikepalli ; Mehlhorn, Kurt (2008) Faster algorithms for minimum cycle basis in directed graphs SIAM Journal on Computing, 38 (4). pp. 1430-1447. ISSN 0097-5397

Hariharan, Ramesh ; Telikepalli, Kavitha ; Panigrahi, Debmalya (2007) Efficient algorithms for computing all low s-t edge connectivities and related problems In: SODA '07 Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 07-09, 2007, New Orleans, Louisiana.

Kumar, Krishnan ; Bhattacharya, Chiru ; Hariharan, Ramesh (2007) A randomized algorithm for large scale support vector learning In: Advances in Neural Information Processing Systems 20 (NIPS 2007).

Hariharan, Ramesh ; Telikepalli, Kavitha ; Panigrahi, Debmalya ; Bhalgat, Anand (2007) An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs In: STOC '07 Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, June 11-13, 2007, San Diego, California, USA.

Cole, Richard ; Hariharan, Ramesh (2005) Dynamic LCA queries on trees SIAM Journal on Computing, 34 (4). pp. 894-923. ISSN 0097-5397

Ehrlich, Marcelo ; Boll, Werner ; van Oijen, Antoine ; Hariharan, Ramesh ; Chandran, Kartik ; Nibert, Max L. ; Kirchhausen, Tomas (2004) Endocytosis by random initiation and stabilization of clathrin-coated pits Cell, 118 (5). pp. 591-605. ISSN 0092-8674

Cole, Richard ; Galil, Zvi ; Hariharan, Ramesh ; Muthukrishnan, S. ; Park, Kunsoo (2004) Parallel two dimensional witness computation Information and Computation, 188 (1). pp. 20-67. ISSN 0890-5401

Anil Kumar, V. S. ; Ramesh, H. (2003) Covering rectilinear polygons with axis-parallel rectangles SIAM Journal on Computing, 32 (6). pp. 1509-1541. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh (2003) Faster suffix tree construction with missing suffix links SIAM Journal on Computing, 33 (1). pp. 26-42. ISSN 0097-5397

Baswana, Surender ; Hariharan, Ramesh ; Sen, Sandeep (2003) Maintaining all-pairs approximate shortest paths under deletion of edges In: SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland.

Cole, Richard ; Hariharan, Ramesh (2003) Tree pattern matching to subset matching in linear time SIAM Journal on Computing, 32 (4). pp. 1056-1066. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh (2003) A fast algorithm for computing steiner edge connectivity In: STOC '03 Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, June 09-11, 2003, San Diego, CA, USA.

Pandurangan, Gopal ; Ramesh, H. (2002) The restriction mapping problem revisited Journal of Computer and System Sciences, 65 (3). pp. 526-544. ISSN 0022-0000

Cole, Richard ; Hariharan, Ramesh (2002) Approximate string matching: a simpler faster algorithm SIAM Journal on Computing, 31 (6). pp. 1761-1782. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh (2002) Verifying candidate matches in sparse and wildcard matching In: Proceeding STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada.

Anil Kumar, V. S. ; Ramesh, H. (2001) Coupling vs. conductance for the Jerrum-Sinclair chain Random Structures and Algorithms, 18 (1). pp. 1-17. ISSN 1042-9832

Cole, Richard ; Hariharan, Ramesh ; Lewenstein, Moshe ; Porat, Ely (2001) A faster implementation of the Goemans-Williamson clustering algorithm In: SODA '01 Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, January 07-09, 2001, Washington, D.C., USA.

Kapoor, S. ; H, Ramesh (2000) An algorithm for enumerating all spanning trees of a directed graph Algorithmica, 27 (2). pp. 120-130. ISSN 0178-4617

Cole, Richard ; Farach-Colton, Martin ; Hariharan, Ramesh ; Przytycka, Teresa ; Thorup, Mikkel (2000) An On(log n) algorithm for the maximum agreement subtree problem for binary trees SIAM Journal on Computing, 30 (5). pp. 1385-1404. ISSN 0097-5397

Mahajan, Sanjeev ; H., Ramesh (1999) Derandomizing semidefinite programming based approximation algorithms SIAM Journal on Computing, 28 (5). pp. 1641-1663. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh ; Indyk, Piotr (1999) Tree pattern matching and subset matching in deterministic O(n log3 n)-time In: SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, January 17-19, 1999, Baltimore, Maryland, USA.

Arya, Sunil ; Ramesh, H. (1998) A 2.5-factor approximation algorithm for the k-MST problem Information Processing Letters, 65 (3). pp. 117-118. ISSN 0020-0190

Crochemore, Maxime ; Gasieniec, Leszek ; Hariharan, Ramesh ; Muthukrishnan, S. ; Rytte, Wojciech (1998) A constant time optimal parallel algorithm for two-dimensional pattern matching SIAM Journal on Computing, 27 (3). pp. 669-681. ISSN 0097-5397

Hariharan, Ramesh (1997) Optimal parallel suffix tree construction Journal of Computer and System Sciences, 55 (1). pp. 44-69. ISSN 0022-0000

Cole, Richard ; Hariharan, Ramesh (1997) Tighter upper bounds on the exact complexity of string matching SIAM Journal on Computing, 26 (3). pp. 803-856. ISSN 0097-5397

Alon, Noga ; Kelsen, Pierre ; Mahajan, Sanjeev ; Ramesh, Hariharan (1996) Coloring 2-colorable hypergraphs with a sublinear number of colors Nordic Journal of Computing, 3 (4). pp. 425-439. ISSN 1236-6064

Muthukrishnan, S. ; Ramesh, H. (1995) String matching under a general matching relation Information and Computation, 122 (1). pp. 140-148. ISSN 0890-5401

Ramesh, H. (1995) On traversing layered graphs on-line Journal of Algorithms, 18 (3). pp. 480-512. ISSN 0196-6774

Kapoor, Sanjiv ; Ramesh, H. (1995) Algorithms forenumerating all spanning trees of undirected and weighted graphs SIAM Journal on Computing, 24 (2). pp. 247-265. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh ; Paterson, Mike ; Zwick, Uri (1995) Tighter lower bounds on the exact complexity of string matching SIAM Journal on Computing, 24 (1). pp. 30-45. ISSN 0097-5397

This list was generated on Mon May 23 00:19:16 2022 UTC.