default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamesh Hariharan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j20]Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi:
A General Framework for Graph Sparsification. SIAM J. Comput. 48(4): 1196-1223 (2019)- [c35]Ramesh Hariharan:
Genome Sequencing for Disease Diagnosis: The Confluence of Biology and Computing. HiPC 2019: 183 - 2016
- [r2]Ramesh Hariharan:
Maximum Agreement Subtree (of 2 Binary Trees). Encyclopedia of Algorithms 2016: 1218-1221 - 2015
- [c34]Ramesh Hariharan, Ananth Kalyanaraman, Michela Taufer
, Trilce Estrada, Pietro Cicotti, Pavan Balaji:
HiCOMB 2015 Keynote and Invited Talks. IPDPS Workshops 2015: 331 - 2012
- [j19]Maria Ximena Sosa, I. K. Ashok Sivakumar, Samantha Maragh, Vamsi Veeramachaneni, Ramesh Hariharan, Minothi Parulekar, Karin M. Fredrikson, Timothy T. Harkins, Jeffrey Lin, Andrew B. Feldman, Pramila Tata, Georg B. Ehret, Aravinda Chakravarti:
Next-Generation Sequencing of Human Mitochondrial Reference Genomes Uncovers High Heteroplasmy Frequency. PLoS Comput. Biol. 8(10) (2012) - [c33]Ramesh Hariharan:
Data-Driven Biology and Computation. IC3 2012: 7 - 2011
- [j18]Ramesh Hariharan, Anand Janakiraman, Ramaswamy Nilakantan, Bhupender Singh, Sajith Varghese, Gregory A. Landrum, Ansgar Schuffenhauer:
MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple Molecules. J. Chem. Inf. Model. 51(4): 788-806 (2011) - [c32]Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi:
A general framework for graph sparsification. STOC 2011: 71-80 - 2010
- [i3]Ramesh Hariharan, Debmalya Panigrahi:
A General Framework for Graph Sparsification. CoRR abs/1004.4080 (2010) - [i2]Ramesh Hariharan, Debmalya Panigrahi:
A Linear-time Algorithm for Sparsification of Unweighted Graphs. CoRR abs/1005.0670 (2010)
2000 – 2009
- 2009
- [c31]Anand Bhalgat, Ramesh Hariharan:
Fast edge orientation for unweighted graphs. SODA 2009: 265-272 - [i1]Vinay Jethava, Krishnan Suresh, Chiranjib Bhattacharyya, Ramesh Hariharan:
Randomized Algorithms for Large scale SVMs. CoRR abs/0909.3609 (2009) - 2008
- [j17]Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn:
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008) - [c30]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: 10 - [c29]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: i - [c28]Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464 - [e2]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India. LIPIcs 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2008 [contents] - [r1]Ramesh Hariharan:
Maximum Agreement Subtree (of 2 Binary Trees). Encyclopedia of Algorithms 2008 - 2007
- [j16]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62(2): 74-92 (2007) - [c27]Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariharan:
A Randomized Algorithm for Large Scale Support Vector Learning. NIPS 2007: 793-800 - [c26]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Efficient algorithms for computing all low s-t edge connectivities and related problems. SODA 2007: 127-136 - [c25]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat:
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614 - 2006
- [c24]Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn:
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261 - 2005
- [j15]Richard Cole, Ramesh Hariharan:
Dynamic LCA Queries on Trees. SIAM J. Comput. 34(4): 894-923 (2005) - 2004
- [j14]Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park:
Parallel two dimensional witness computation. Inf. Comput. 188(1): 20-67 (2004) - [c23]Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar:
Short-Cuts on Star, Source and Planar Unfoldings. FSTTCS 2004: 174-185 - 2003
- [j13]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. Inf. Comput. 181(1): 57-74 (2003) - [j12]Ramesh Hariharan, V. Vinay:
String matching in Õ(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1(1): 103-110 (2003) - [j11]Richard Cole, Ramesh Hariharan:
Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32(4): 1056-1066 (2003) - [j10]Richard Cole, Ramesh Hariharan:
Faster Suffix Tree Construction with Missing Suffix Links. SIAM J. Comput. 33(1): 26-42 (2003) - [c22]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403 - [c21]Richard Cole, Ramesh Hariharan:
A fast algorithm for computing steiner edge connectivity. STOC 2003: 167-176 - 2002
- [j9]Gopal Pandurangan, Ramesh Hariharan:
The restriction mapping problem revisited. J. Comput. Syst. Sci. 65(3): 526-544 (2002) - [j8]Richard Cole, Ramesh Hariharan:
Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. 31(6): 1761-1782 (2002) - [c20]Kalika Bali, Ramesh Hariharan, Swami Manohar:
Language Technology Solutions in Simputer: an Overview. Language Engineering Conference 2002: 189 - [c19]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123 - [c18]Richard Cole, Ramesh Hariharan:
Verifying candidate matches in sparse and wildcard matching. STOC 2002: 592-601 - 2001
- [c17]Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 - [c16]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. SODA 2001: 279-288 - [e1]Ramesh Hariharan, Madhavan Mukund, V. Vinay:
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. Lecture Notes in Computer Science 2245, Springer 2001, ISBN 3-540-43002-4 [contents] - 2000
- [j7]Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup:
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30(5): 1385-1404 (2000) - [c15]Richard Cole, Ramesh Hariharan:
Faster suffix tree construction with missing suffix links. STOC 2000: 407-415 - [c14]Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan:
Efficient Expected-Case Algorithms for Planar Point Location. SWAT 2000: 353-366
1990 – 1999
- 1999
- [c13]Richard Cole, Ramesh Hariharan:
Dynamic LCA Queries on Trees. SODA 1999: 235-244 - [c12]Richard Cole, Ramesh Hariharan, Piotr Indyk:
Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254 - 1998
- [j6]Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter:
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM J. Comput. 27(3): 668-681 (1998) - [c11]Richard Cole, Ramesh Hariharan:
Approximate String Matching: A Simpler Faster Algorithm. SODA 1998: 463-472 - 1997
- [j5]Ramesh Hariharan:
Optimal Parallel Suffix Tree Construction. J. Comput. Syst. Sci. 55(1): 44-69 (1997) - [j4]Richard Cole, Ramesh Hariharan:
Tighter Upper Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 26(3): 803-856 (1997) - [c10]Richard Cole, Ramesh Hariharan:
Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time. STOC 1997: 66-75 - 1996
- [j3]Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring. Nord. J. Comput. 3(4): 425-439 (1996) - [j2]Dany Breslauer, Ramesh Hariharan:
Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Process. Lett. 6(1): 35-44 (1996) - [c9]Richard Cole, Ramesh Hariharan:
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SODA 1996: 323-332 - [c8]Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring. SWAT 1996: 41-52 - 1995
- [j1]Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick:
Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 24(1): 30-45 (1995) - [c7]Sanjeev Mahajan, Ramesh Hariharan:
Derandomizing Semidefinite Programming Based Approximation Algorithms. FOCS 1995: 162-169 - [c6]Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar:
Faster Enumeration of All Spanning Trees of a Directed Graph. WADS 1995: 428-439 - 1994
- [b1]Ramesh Hariharan:
Designing Pattern Matching Algorithms by Exploiting Structural Pattern Properties. New York University, USA, 1994 - [c5]Ramesh Hariharan, S. Muthukrishnan:
Optimal Parallel Algorithms for Prefix Matching. ICALP 1994: 203-214 - [c4]Ramesh Hariharan:
Optimal parallel suffix tree construction. STOC 1994: 290-299 - 1993
- [c3]Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter:
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. FOCS 1993: 248-258 - [c2]Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick:
Which Patterns are Hard to Find? ISTCS 1993: 59-68 - 1992
- [c1]Richard Cole, Ramesh Hariharan:
Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract). FOCS 1992: 600-609
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
