ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 27.

Book Chapter

Chandru, Vijay and Hariharan, Ramesh and Krishnakumar, Narasimha M (2004) Short-Cuts on Star, Source and Planar Unfoldings. [Book Chapter]

Conference Proceedings

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. In: ACM, Jun 11-13, San Diegeo, pp. 605-614.

Cole, Richard and Hariharan, Ramesh (2002) Verifying Candidate Matches in Sparse and Wildcard Matching. In: 34th Annual ACM Symposium on Theory of Computing, May 19 - 21, Montreal, Quebec, Canada, pp. 592-601.

Conference Paper

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2008) Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. In: SODA '08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA.

Krishnan, S and Bhattacharyya, Chiranjib and Hariharan, Ramesh and Genomics, Strand (2007) A Randomized Algorithm for Large Scale Support Vector Learning. In: Proceedings of 21st Annual Conference on Neural Information Processing Systems (NIPS), June 2007.

Hariharan, Ramesh and Kavitha, Telikepalli and 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, Philadelphia, PA.

Bhalgat, Anand and Hariharan, Ramesh and Kavitha, Telikepalli and Panigrahi, Debmalya (2007) An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs. In: STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, New York, NY.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2006) A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In: 33rd ICALP 2006, 10 July 2006, Venice, Italy, pp. 250-261.

Cole, Richard and Hariharan, Ramesh (2003) A Fast Algorithm for Computing Steiner Edge Connectivity. In: Thirty-Fifth Annual ACM Symposium on Theory of Computing, June 9–11, 2003, San Diego, California, USA, pp. 167-176.

Baswana, Surender and Sen, Sandeep and Hariharan, Ramesh (2002) Improved Decremental Algorithms for Maintaining Transitive Closure and Allpairs Shortest Paths. In: of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada, pp. 117-123.

Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2001) A Faster Implementation of the Goemans-Williamson Clustering Algorithm. In: The twelfth annual ACM-SIAM symposium on Discrete algorithms, January 07 - 09, Washington, D.C., United States, pp. 17-25.

Amir, Amihood and Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2001) Overlap Matching. In: The twelfth annual ACM-SIAM symposium on Discrete algorithms, January 07 - 09, Washington, D.C., United States, pp. 279-288.

Journal Article

Mannan, Ashraf U and Singh, Jaya and Lakshmikeshava, Ravikiran and Thota, Nishita and Singh, Suhasini and Sowmya, TS and Mishra, Avshesh and Sinha, Aditi and Deshwal, Shivani and Soni, Megha R and Chandrasekar, Anbukayalvizhi and Ramesh, Bhargavi and Ramamurthy, Bharat and Padhi, Shila and Manek, Payal and Ramalingam, Ravi and Kapoor, Suman and Ghosh, Mithua and Sankaran, Satish and Ghosh, Arunabha and Veeramachaneni, Vamsi and Ramamoorthy, Preveen and Hariharan, Ramesh and Subramanian, Kalyanasundaram (2016) Detection of high frequency of mutations in a breast and/or ovarian cancer cohort: implications of embracing a multi-gene panel in molecular diagnosis in India. In: JOURNAL OF HUMAN GENETICS, 61 (6). pp. 515-522.

Hariharan, Ramesh (2014) Turing and animal coat patterns. In: CURRENT SCIENCE, 106 (12). pp. 1681-1686.

Hariharan, Ramesh and Kavitha, Telikepalli and Mehlhorn, Kurt (2008) Faster Algorithms for Minimum Cycle Basis in Directed Graphs. In: SIAM JOURNAL ON COMPUTING, 38 (4). pp. 1430-1447.

Cole, Richard and Hariharan, Ramesh (2005) Dynamic LCA Queries on Trees. In: SIAM Journal on Computing, 34 (4). pp. 894-923.

Cole, Richard and Hariharan, Ramesh (2003) Faster Suffix Tree Construction with Missing Suffix Links. In: SIAM Journal on Computing, 33 (1). pp. 26-42.

Cole, Richard and Hariharan, Ramesh (2003) Tree Pattern Matching to Subset Matching in Linear Time. In: SIAM Journal on Computing, 32 (4). pp. 1056-1066.

Amir, Amihood and Cole, Richard and Hariharan, Ramesh and Lewenstein, Moshe and Porat, Ely (2003) Overlap matching. In: Information and Computation, 181 (1). pp. 57-74.

Cole, Richard and Hariharan, Ramesh (2000) Approximate String Matching: A Simpler Faster Algorithm. In: SIAM Journal on Computing, 31 (6). pp. 1761-1782.

Raghavan, Sowmya and Hariharan, Ramesh and Brahmachari, Samir K (2000) Polypurine.polypyrimidine sequences in complete bacterial genomes: preference for polypurines in protein-coding regions. In: GENE, 242 (1-2). pp. 275-283.

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

Hariharan, Ramesh (1997) Optimal Parallel Suffix Tree Construction. In: Journal of Computer and System Sciences, 55 (1). pp. 44-69.

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

Hariharan, Ramesh and Kulkarni, VD (1982) A Microprocessor-Based Pulse-Height Analyzer. In: IEEE Micro Magazine, 2 (3). pp. 86-91.

Hariharan, Ramesh and Bhaskar, Majumdar S (1978) Moiré Displacement Transducer for N/C Systems. In: Transactions on Instrumentation and Measurement, 27 (1). pp. 8-10.

Nagaraj, HS and Hariharan, Ramesh (1973) step-up epicyclic gear-train and flowgraph analysis. In: International Journal of Control, 17 (5). pp. 1059-1063.

This list was generated on Tue Dec 6 17:05:04 2016 IST.