The SCEAS System
| |||||||

## Search the dblp DataBase
Ramesh Hariharan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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**[Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:248-258 [Conf] - Richard Cole, Ramesh Hariharan
**Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:600-609 [Conf] - Sanjeev Mahajan, Ramesh Hariharan
**Derandomizing Semidefinite Programming Based Approximation Algorithms.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:162-169 [Conf] - Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar
**Short-Cuts on Star, Source and Planar Unfoldings.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2004, pp:174-185 [Conf] - Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
**A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:250-261 [Conf] - Ramesh Hariharan, S. Muthukrishnan
**Optimal Parallel Algorithms for Prefix Matching.**[Citation Graph (0, 0)][DBLP] ICALP, 1994, pp:203-214 [Conf] - Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
**Which Patterns are Hard to Find?**[Citation Graph (0, 0)][DBLP] ISTCS, 1993, pp:59-68 [Conf] - Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
**Overlap matching.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:279-288 [Conf] - Surender Baswana, Ramesh Hariharan, Sandeep Sen
**Maintaining all-pairs approximate shortest paths under deletion of edges.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:394-403 [Conf] - Richard Cole, Ramesh Hariharan
**An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.**[Citation Graph (0, 0)][DBLP] SODA, 1996, pp:323-332 [Conf] - Richard Cole, Ramesh Hariharan
**Approximate String Matching: A Simpler Faster Algorithm.**[Citation Graph (0, 0)][DBLP] SODA, 1998, pp:463-472 [Conf] - Richard Cole, Ramesh Hariharan
**Dynamic LCA Queries on Trees.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:235-244 [Conf] - Richard Cole, Ramesh Hariharan, Piotr Indyk
**Tree Pattern Matching and Subset Matching in Deterministic**[Citation Graph (0, 0)][DBLP]*O*(*n*log^{3}*n*)-time. SODA, 1999, pp:245-254 [Conf] - Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
**A faster implementation of the Goemans-Williamson clustering algorithm.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:17-25 [Conf] - Surender Baswana, Ramesh Hariharan, Sandeep Sen
**Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:117-123 [Conf] - Richard Cole, Ramesh Hariharan
**Faster suffix tree construction with missing suffix links.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:407-415 [Conf] - Richard Cole, Ramesh Hariharan
**Verifying candidate matches in sparse and wildcard matching.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:592-601 [Conf] - Richard Cole, Ramesh Hariharan
**A fast algorithm for computing steiner edge connectivity.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:167-176 [Conf] - Richard Cole, Ramesh Hariharan
**Tree Pattern Matching and Subset Matching in Randomized O(n log**[Citation Graph (0, 0)][DBLP]^{3}m) Time. STOC, 1997, pp:66-75 [Conf] - Ramesh Hariharan
**Optimal parallel suffix tree construction.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:290-299 [Conf] - Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan
**Efficient Expected-Case Algorithms for Planar Point Location.**[Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:353-366 [Conf] - Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
**Approximate Hypergraph Coloring.**[Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:41-52 [Conf] - Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar
**Faster Enumeration of All Spanning Trees of a Directed Graph.**[Citation Graph (0, 0)][DBLP] WADS, 1995, pp:428-439 [Conf] - Kalika Bali, Ramesh Hariharan, Swami Manohar
**Language Technology Solutions in Simputer: an Overview.**[Citation Graph (0, 0)][DBLP] Language Engineering Conference, 2002, pp:189- [Conf] - Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
**Overlap matching.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2003, v:181, n:1, pp:57-74 [Journal] - Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
**Parallel two dimensional witness computation.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2004, v:188, n:1, pp:20-67 [Journal] - Surender Baswana, Ramesh Hariharan, Sandeep Sen
**Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2007, v:62, n:2, pp:74-92 [Journal] - Ramesh Hariharan
**Optimal Parallel Suffix Tree Construction.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:55, n:1, pp:44-69 [Journal] - Gopal Pandurangan, Ramesh Hariharan
**The restriction mapping problem revisited.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:3, pp:526-544 [Journal] - Ramesh Hariharan, V. Vinay
**String matching in Õ(sqrt(n)+sqrt(m)) quantum time.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2003, v:1, n:1, pp:103-110 [Journal] - Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan
**Approximate Hypergraph Coloring.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1996, v:3, n:4, pp:425-439 [Journal] - Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
**An**[Citation Graph (0, 0)][DBLP]*O*(*n*log*n*) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput., 2000, v:30, n:5, pp:1385-1404 [Journal] - Richard Cole, Ramesh Hariharan
**Approximate String Matching: A Simpler Faster Algorithm.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:6, pp:1761-1782 [Journal] - Richard Cole, Ramesh Hariharan
**Tree Pattern Matching to Subset Matching in Linear Time.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:4, pp:1056-1066 [Journal] - Richard Cole, Ramesh Hariharan
**Faster Suffix Tree Construction with Missing Suffix Links.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:33, n:1, pp:26-42 [Journal] - Richard Cole, Ramesh Hariharan
**Dynamic LCA Queries on Trees.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:894-923 [Journal] - Richard Cole, Ramesh Hariharan
**Tighter Upper Bounds on the Exact Complexity of String Matching.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:3, pp:803-856 [Journal] - Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
**Tighter Lower Bounds on the Exact Complexity of String Matching.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:1, pp:30-45 [Journal] - Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
**A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:668-681 [Journal] - Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
**Efficient algorithms for computing all low**[Citation Graph (0, 0)][DBLP]*s-t*edge connectivities and related problems. SODA, 2007, pp:127-136 [Conf] - Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat
**An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:605-614 [Conf] **2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.**[Citation Graph (, )][DBLP]**2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.**[Citation Graph (, )][DBLP]**A Randomized Algorithm for Large Scale Support Vector Learning.**[Citation Graph (, )][DBLP]**Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.**[Citation Graph (, )][DBLP]**Fast edge orientation for unweighted graphs.**[Citation Graph (, )][DBLP]**Randomized Algorithms for Large scale SVMs**[Citation Graph (, )][DBLP]**A General Framework for Graph Sparsification**[Citation Graph (, )][DBLP]**A Linear-time Algorithm for Sparsification of Unweighted Graphs**[Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.010secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |