Ramesh Hariharan

According to our database, Ramesh Hariharan authored at least 54 papers between 1992 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2019

A General Framework for Graph Sparsification.

Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi

SIAM J. Comput., 2019

Genome Sequencing for Disease Diagnosis: The Confluence of Biology and Computing.

Ramesh Hariharan

Proceedings of the 26th IEEE International Conference on High Performance Computing, 2019

2016

Maximum Agreement Subtree (of 2 Binary Trees).

Ramesh Hariharan

Encyclopedia of Algorithms, 2016

2015

HiCOMB 2015 Keynote and Invited Talks.

Ramesh Hariharan, Ananth Kalyanaraman, Michela Taufer, Trilce Estrada, Pietro Cicotti, Pavan Balaji

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

2012

Next-Generation Sequencing of Human Mitochondrial Reference Genomes Uncovers High Heteroplasmy Frequency.

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

PLoS Comput. Biol., 2012

Data-Driven Biology and Computation.

Ramesh Hariharan

Proceedings of the Contemporary Computing - 5th International Conference, 2012

2011

MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple Molecules.

Ramesh Hariharan, Anand Janakiraman, Ramaswamy Nilakantan, Bhupender Singh, Sajith Varghese, Gregory A. Landrum, Ansgar Schuffenhauer

J. Chem. Inf. Model., 2011

2010

A Linear-time Algorithm for Sparsification of Unweighted Graphs

Ramesh Hariharan, Debmalya Panigrahi

CoRR, 2010

A General Framework for Graph Sparsification

Ramesh Hariharan, Debmalya Panigrahi

CoRR, 2010

2009

Randomized Algorithms for Large scale SVMs

Vinay Jethava, Krishnan Suresh, Chiranjib Bhattacharyya, Ramesh Hariharan

CoRR, 2009

Fast edge orientation for unweighted graphs.

Anand Bhalgat, Ramesh Hariharan

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Maximum Agreement Subtree (of 2 Binary Trees).

Ramesh Hariharan

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Faster Algorithms for Minimum Cycle Basis in Directed Graphs.

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn

SIAM J. Comput., 2008

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.

Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.

Ramesh Hariharan, Madhavan Mukund, V. Vinay

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.

Ramesh Hariharan, Madhavan Mukund, V. Vinay

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.

Surender Baswana, Ramesh Hariharan, Sandeep Sen

J. Algorithms, 2007

An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Efficient algorithms for computing all low <i>s-t</i> edge connectivities and related problems.

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A Randomized Algorithm for Large Scale Support Vector Learning.

Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariharan

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006

A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.

Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Dynamic LCA Queries on Trees.

Richard Cole, Ramesh Hariharan

SIAM J. Comput., 2005

2004

Parallel two dimensional witness computation.

Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park

Inf. Comput., 2004

Short-Cuts on Star, Source and Planar Unfoldings.

Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Faster Suffix Tree Construction with Missing Suffix Links.

Richard Cole, Ramesh Hariharan

SIAM J. Comput., 2003

Tree Pattern Matching to Subset Matching in Linear Time.

Richard Cole, Ramesh Hariharan

SIAM J. Comput., 2003

String matching in Õ(sqrt(n)+sqrt(m)) quantum time.

Ramesh Hariharan, V. Vinay

J. Discrete Algorithms, 2003

Overlap matching.

Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat

Inf. Comput., 2003

A fast algorithm for computing steiner edge connectivity.

Richard Cole, Ramesh Hariharan

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Maintaining all-pairs approximate shortest paths under deletion of edges.

Surender Baswana, Ramesh Hariharan, Sandeep Sen

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Approximate String Matching: A Simpler Faster Algorithm.

Richard Cole, Ramesh Hariharan

SIAM J. Comput., 2002

The restriction mapping problem revisited.

Gopal Pandurangan, Ramesh Hariharan

J. Comput. Syst. Sci., 2002

Verifying candidate matches in sparse and wildcard matching.

Richard Cole, Ramesh Hariharan

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Language Technology Solutions in Simputer: an Overview.

Kalika Bali, Ramesh Hariharan, Swami Manohar

Proceedings of the 2002 Language Engineering Conference (LEC 2002), 2002

2001

A faster implementation of the Goemans-Williamson clustering algorithm.

Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.

Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup

SIAM J. Comput., 2000

Efficient Expected-Case Algorithms for Planar Point Location.

Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan

Proceedings of the Algorithm Theory, 2000

1999

Tree Pattern Matching and Subset Matching in Deterministic <i>O</i>(<i>n</i> log³ <i>n</i>)-time.

Richard Cole, Ramesh Hariharan, Piotr Indyk

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.

Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter

SIAM J. Comput., 1998

1997

Tighter Upper Bounds on the Exact Complexity of String Matching.

Richard Cole, Ramesh Hariharan

SIAM J. Comput., 1997

Optimal Parallel Suffix Tree Construction.

Ramesh Hariharan

J. Comput. Syst. Sci., 1997

Tree Pattern Matching and Subset Matching in Randomized O(n log³m) Time.

Richard Cole, Ramesh Hariharan

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Optimal Parallel Construction of Minimal Suffix and Factor Automata.

Dany Breslauer, Ramesh Hariharan

Parallel Process. Lett., 1996

Approximate Hypergraph Coloring.

Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan

Nord. J. Comput., 1996

Approximate Hypergraph Coloring.

Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan

Proceedings of the Algorithm Theory, 1996

An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.

Richard Cole, Ramesh Hariharan

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Tighter Lower Bounds on the Exact Complexity of String Matching.

Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick

SIAM J. Comput., 1995

Faster Enumeration of All Spanning Trees of a Directed Graph.

Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Derandomizing Semidefinite Programming Based Approximation Algorithms.

Sanjeev Mahajan, Ramesh Hariharan

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Designing Pattern Matching Algorithms by Exploiting Structural Pattern Properties.

Ramesh Hariharan

PhD thesis, 1994

Optimal Parallel Algorithms for Prefix Matching.

Ramesh Hariharan, S. Muthukrishnan

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Which Patterns are Hard to Find?

Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions

Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract)

Richard Cole, Ramesh Hariharan

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992