Ramesh Hariharan

Publication Activity (10 Years)

Years Active: 1992-2019
Publications (10 Years): 2

Top Topics

Poster Presentation

Genome Sequencing

Top Venues

IPDPS Workshops

PLoS Comput. Biol.

Publications

Ramesh Hariharan
Genome Sequencing for Disease Diagnosis: The Confluence of Biology and Computing. HiPC (2019)
Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi
A General Framework for Graph Sparsification. SIAM J. Comput. 48 (4) (2019)
Ramesh Hariharan, Ananth Kalyanaraman, Michela Taufer, Trilce Estrada, Pietro Cicotti, Pavan Balaji
HiCOMB 2015 Keynote and Invited Talks. IPDPS Workshops (2015)
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)
Ramesh Hariharan
Data-Driven Biology and Computation. IC3 (2012)
Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi
A general framework for graph sparsification. STOC (2011)
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) (2011)
Ramesh Hariharan, Debmalya Panigrahi
A General Framework for Graph Sparsification CoRR (2010)
Ramesh Hariharan, Debmalya Panigrahi
A Linear-time Algorithm for Sparsification of Unweighted Graphs CoRR (2010)
Vinay Jethava, Krishnan Suresh, Chiranjib Bhattacharyya, Ramesh Hariharan
Randomized Algorithms for Large scale SVMs CoRR (2009)
Anand Bhalgat, Ramesh Hariharan
Fast edge orientation for unweighted graphs. SODA (2009)
Ramesh Hariharan, Madhavan Mukund, V. Vinay
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS (2008)
Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA (2008)
Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38 (4) (2008)
Ramesh Hariharan, Madhavan Mukund, V. Vinay
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS (2008)
Surender Baswana, Ramesh Hariharan, Sandeep Sen
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62 (2) (2007)
Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC (2007)
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariharan
A Randomized Algorithm for Large Scale Support Vector Learning. NIPS (2007)
Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
edge connectivities and related problems. SODA (2007)
Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) (2006)
Richard Cole, Ramesh Hariharan
Dynamic LCA Queries on Trees. SIAM J. Comput. 34 (4) (2005)
Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar
Short-Cuts on Star, Source and Planar Unfoldings. FSTTCS (2004)
Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
Parallel two dimensional witness computation. Inf. Comput. 188 (1) (2004)
Richard Cole, Ramesh Hariharan
A fast algorithm for computing steiner edge connectivity. STOC (2003)
Richard Cole, Ramesh Hariharan
Faster Suffix Tree Construction with Missing Suffix Links. SIAM J. Comput. 33 (1) (2003)
Richard Cole, Ramesh Hariharan
Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32 (4) (2003)
Ramesh Hariharan, V. Vinay
String matching in Õ(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1 (1) (2003)
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Overlap matching. Inf. Comput. 181 (1) (2003)
Surender Baswana, Ramesh Hariharan, Sandeep Sen
Maintaining all-pairs approximate shortest paths under deletion of edges. SODA (2003)
Surender Baswana, Ramesh Hariharan, Sandeep Sen
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC (2002)
Richard Cole, Ramesh Hariharan
Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. 31 (6) (2002)
Kalika Bali, Ramesh Hariharan, Swami Manohar
Language Technology Solutions in Simputer: an Overview. Language Engineering Conference (2002)
Gopal Pandurangan, Ramesh Hariharan
The restriction mapping problem revisited. J. Comput. Syst. Sci. 65 (3) (2002)
Richard Cole, Ramesh Hariharan
Verifying candidate matches in sparse and wildcard matching. STOC (2002)
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Overlap matching. SODA (2001)
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
A faster implementation of the Goemans-Williamson clustering algorithm. SODA (2001)
Richard Cole, Ramesh Hariharan
Faster suffix tree construction with missing suffix links. STOC (2000)
Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30 (5) (2000)
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan
Efficient Expected-Case Algorithms for Planar Point Location. SWAT (2000)
Richard Cole, Ramesh Hariharan, Piotr Indyk
)-time. SODA (1999)
Richard Cole, Ramesh Hariharan
Dynamic LCA Queries on Trees. SODA (1999)
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) (1998)
Richard Cole, Ramesh Hariharan
Approximate String Matching: A Simpler Faster Algorithm. SODA (1998)
Ramesh Hariharan
Optimal Parallel Suffix Tree Construction. J. Comput. Syst. Sci. 55 (1) (1997)
Richard Cole, Ramesh Hariharan
m) Time. STOC (1997)
Richard Cole, Ramesh Hariharan
Tighter Upper Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 26 (3) (1997)
Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
Approximate Hypergraph Coloring. Nord. J. Comput. 3 (4) (1996)
Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
Approximate Hypergraph Coloring. SWAT (1996)
Richard Cole, Ramesh Hariharan
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SODA (1996)
Dany Breslauer, Ramesh Hariharan
Optimal Parallel Construction of Minimal Suffix and Factor Automata. Parallel Process. Lett. 6 (1) (1996)
Sanjeev Mahajan, Ramesh Hariharan
Derandomizing Semidefinite Programming Based Approximation Algorithms. FOCS (1995)
Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar
Faster Enumeration of All Spanning Trees of a Directed Graph. WADS (1995)
Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 24 (1) (1995)
Ramesh Hariharan
Optimal parallel suffix tree construction. STOC (1994)
Ramesh Hariharan, S. Muthukrishnan
Optimal Parallel Algorithms for Prefix Matching. ICALP (1994)
Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
Which Patterns are Hard to Find? ISTCS (1993)
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)
Richard Cole, Ramesh Hariharan
Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) FOCS (1992)