H. Ramesh
H. Ramesh
Professor of Computer Science, Indian Institute of Science, CTO, Strand Life Sciences
Adresse e-mail validée de strandls.com
Titre
Citée par
Citée par
Année
Endocytosis by random initiation and stabilization of clathrin-coated pits
M Ehrlich, W Boll, A Van Oijen, R Hariharan, K Chandran, ML Nibert, ...
Cell 118 (5), 591-605, 2004
8612004
Tree pattern matching and subset matching in randomized O(nlog3m) time
R Cole, R Hariharan
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
1521997
Approximate string matching: A simpler faster algorithm
R Cole, R Hariharan
SIAM Journal on Computing 31 (6), 1761-1782, 2002
1462002
Algorithms for enumerating all spanning trees of undirected and weighted graphs
S Kapoor, H Ramesh
SIAM Journal on Computing 24 (2), 247-265, 1995
1401995
An O (n log n) algorithm for the maximum agreement subtree problem for binary trees
R Cole, M Farach-Colton, R Hariharan, T Przytycka, M Thorup
SIAM Journal on Computing 30 (5), 1385-1404, 2000
1372000
A general framework for graph sparsification
WS Fung, R Hariharan, NJA Harvey, D Panigrahi
SIAM Journal on Computing 48 (4), 1196-1223, 2019
1342019
Verifying candidate matches in sparse and wildcard matching
R Cole, R Hariharan
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
1312002
Derandomizing semidefinite programming based approximation algorithms
S Mahajan, H Ramesh
Proceedings of IEEE 36th Annual Foundations of Computer Science, 162-169, 1995
1231995
Optimal parallel suffix tree construction
R Hariharan
Journal of Computer and System Sciences 55 (1), 44-69, 1997
1001997
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
S Baswana, R Hariharan, S Sen
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
93*2002
Hardness of set cover with intersection 1
VSA Kumar, S Arya, H Ramesh
International Colloquium on Automata, Languages, and Programming, 624-635, 2000
932000
Derandomizing approximation algorithms based on semidefinite programming
S Mahajan, H Ramesh
SIAM Journal on Computing 28 (5), 1641-1663, 1999
931999
Dynamic LCA Queries on Trees.
R Cole, R Hariharan
SODA 99, 235-244, 1999
801999
Faster suffix tree construction with missing suffix links
R Cole, R Hariharan
SIAM Journal on Computing 33 (1), 26-42, 2003
792003
Overlap matching
A Amir, R Cole, R Hariharan, M Lewenstein, E Porat
Information and Computation 181 (1), 57-74, 2003
772003
Dynamic LCA queries on trees
R Cole, R Hariharan
SIAM Journal on Computing 34 (4), 894-923, 2005
762005
Next-generation sequencing of human mitochondrial reference genomes uncovers high heteroplasmy frequency
MX Sosa, IKA Sivakumar, S Maragh, V Veeramachaneni, R Hariharan, ...
PLoS Comput Biol 8 (10), e1002737, 2012
742012
Covering rectilinear polygons with axis-parallel rectangles
VS Anil Kumar, H Ramesh
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
70*1999
An O (mn) Gomory-Hu tree construction algorithm for unweighted graphs
R Hariharan, T Kavitha, D Panigrahi, A Bhalgat
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
662007
A 2.5-factor approximation algorithm for the k-MST problem
S Arya, H Ramesh
Information Processing Letters 65 (3), 117-118, 1998
551998
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20