| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi |
A general framework for graph sparsification.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Debmalya Panigrahi |
A Linear-time Algorithm for Sparsification of Unweighted Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ramesh Hariharan, Debmalya Panigrahi |
A General Framework for Graph Sparsification |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vinay Jethava, Krishnan Suresh, Chiranjib Bhattacharyya, Ramesh Hariharan |
Randomized Algorithms for Large scale SVMs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anand Bhalgat, Ramesh Hariharan |
Fast edge orientation for unweighted graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
Faster Algorithms for Minimum Cycle Basis in Directed Graphs. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan |
Maximum Agreement Subtree (of 2 Binary Trees). |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Madhavan Mukund, V. Vinay |
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Madhavan Mukund, V. Vinay |
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. |
FSTTCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ramesh Hariharan, Madhavan Mukund, V. Vinay (eds.) |
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India |
FSTTCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Efficient algorithms for computing all low s-t edge connectivities and related problems. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
| 1 | Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariharan |
A Randomized Algorithm for Large Scale Support Vector Learning. |
NIPS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Dynamic LCA Queries on Trees. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park |
Parallel two dimensional witness computation. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar |
Short-Cuts on Star, Source and Planar Unfoldings. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
Overlap matching. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Faster Suffix Tree Construction with Missing Suffix Links. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Tree Pattern Matching to Subset Matching in Linear Time. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, V. Vinay |
String matching in Õ(sqrt(n)+sqrt(m)) quantum time. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Maintaining all-pairs approximate shortest paths under deletion of edges. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
A fast algorithm for computing steiner edge connectivity. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
cactus trees, edge-connectivity, Steiner points |
| 1 | Gopal Pandurangan, Ramesh Hariharan |
The restriction mapping problem revisited. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Approximate String Matching: A Simpler Faster Algorithm. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalika Bali, Ramesh Hariharan, Swami Manohar |
Language Technology Solutions in Simputer: an Overview. |
Language Engineering Conference |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
| 1 | Richard Cole, Ramesh Hariharan |
Verifying candidate matches in sparse and wildcard matching. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
A faster implementation of the Goemans-Williamson clustering algorithm. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
Overlap matching. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Madhavan Mukund, V. Vinay (eds.) |
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings |
FSTTCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan |
Efficient Expected-Case Algorithms for Planar Point Location. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Faster suffix tree construction with missing suffix links. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan, Piotr Indyk |
Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Dynamic LCA Queries on Trees. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter |
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Approximate String Matching: A Simpler Faster Algorithm. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan |
Optimal Parallel Suffix Tree Construction. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Tighter Upper Bounds on the Exact Complexity of String Matching. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dany Breslauer, Ramesh Hariharan |
Optimal Parallel Construction of Minimal Suffix and Factor Automata. |
Parallel Processing Letters |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan |
Approximate Hypergraph Coloring. |
Nord. J. Comput. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan |
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan |
Approximate Hypergraph Coloring. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick |
Tighter Lower Bounds on the Exact Complexity of String Matching. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar |
Faster Enumeration of All Spanning Trees of a Directed Graph. |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Mahajan, Ramesh Hariharan |
Derandomizing Semidefinite Programming Based Approximation Algorithms. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
semidefinite programming based approximation algorithms, Max k-Cut, Max-Dicut, Max-Bisection, k Vertex Coloring, polynomial time randomized algorithms, polynomial time deterministic algorithms, computational complexity, randomized algorithms, semidefinite programming, programming theory, NP-Complete problems, deterministic algorithms, Independent Set, randomised algorithms, Max-Cut, Max-Sat |
| 1 | Ramesh Hariharan, S. Muthukrishnan |
Optimal Parallel Algorithms for Prefix Matching. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Hariharan |
Optimal parallel suffix tree construction. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick |
Which Patterns are Hard to Find? |
ISTCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
optimally fast parallel algorithms, parallel CRCW PRAM algorithms, constant-time text search algorithm, probabilistic string-matching algorithm, pattern matching, preprocessing, time bound, Las-Vegas algorithm |
| 1 | Richard Cole, Ramesh Hariharan |
Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
exact complexity, character comparisons, online algorithm, string matching |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")