2009 | ||
---|---|---|
50 | EE | Anand Bhalgat, Ramesh Hariharan: Fast edge orientation for unweighted graphs. SODA 2009: 265-272 |
2008 | ||
49 | 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 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 | |
48 | EE | Ramesh Hariharan, Madhavan Mukund, V. Vinay: 2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008 |
47 | EE | Ramesh Hariharan, Madhavan Mukund, V. Vinay: 2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008 |
46 | EE | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464 |
45 | EE | Ramesh Hariharan: Maximum Agreement Subtree (of 2 Binary Trees). Encyclopedia of Algorithms 2008 |
44 | EE | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: Faster Algorithms for Minimum Cycle Basis in Directed Graphs. SIAM J. Comput. 38(4): 1430-1447 (2008) |
2007 | ||
43 | EE | Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariharan: A Randomized Algorithm for Large Scale Support Vector Learning. NIPS 2007 |
42 | EE | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi: Efficient algorithms for computing all low s-t edge connectivities and related problems. SODA 2007: 127-136 |
41 | EE | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614 |
40 | EE | 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) |
2006 | ||
39 | EE | Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. ICALP (1) 2006: 250-261 |
2005 | ||
38 | EE | Richard Cole, Ramesh Hariharan: Dynamic LCA Queries on Trees. SIAM J. Comput. 34(4): 894-923 (2005) |
2004 | ||
37 | EE | Vijay Chandru, Ramesh Hariharan, Narasimha M. Krishnakumar: Short-Cuts on Star, Source and Planar Unfoldings. FSTTCS 2004: 174-185 |
36 | EE | Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park: Parallel two dimensional witness computation. Inf. Comput. 188(1): 20-67 (2004) |
2003 | ||
35 | EE | Surender Baswana, Ramesh Hariharan, Sandeep Sen: Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403 |
34 | EE | Richard Cole, Ramesh Hariharan: A fast algorithm for computing steiner edge connectivity. STOC 2003: 167-176 |
33 | EE | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003) |
32 | EE | Ramesh Hariharan, V. Vinay: String matching in Õ(sqrt(n)+sqrt(m)) quantum time. J. Discrete Algorithms 1(1): 103-110 (2003) |
31 | EE | Richard Cole, Ramesh Hariharan: Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32(4): 1056-1066 (2003) |
30 | EE | Richard Cole, Ramesh Hariharan: Faster Suffix Tree Construction with Missing Suffix Links. SIAM J. Comput. 33(1): 26-42 (2003) |
2002 | ||
29 | EE | Kalika Bali, Ramesh Hariharan, Swami Manohar: Language Technology Solutions in Simputer: an Overview. Language Engineering Conference 2002: 189 |
28 | EE | Surender Baswana, Ramesh Hariharan, Sandeep Sen: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123 |
27 | EE | Richard Cole, Ramesh Hariharan: Verifying candidate matches in sparse and wildcard matching. STOC 2002: 592-601 |
26 | EE | Gopal Pandurangan, Ramesh Hariharan: The restriction mapping problem revisited. J. Comput. Syst. Sci. 65(3): 526-544 (2002) |
25 | EE | Richard Cole, Ramesh Hariharan: Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. 31(6): 1761-1782 (2002) |
2001 | ||
24 | 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 Springer 2001 | |
23 | EE | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 |
22 | EE | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288 |
2000 | ||
21 | EE | Richard Cole, Ramesh Hariharan: Faster suffix tree construction with missing suffix links. STOC 2000: 407-415 |
20 | EE | Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh Hariharan: Efficient Expected-Case Algorithms for Planar Point Location. SWAT 2000: 353-366 |
19 | EE | 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) |
1999 | ||
18 | EE | Richard Cole, Ramesh Hariharan: Dynamic LCA Queries on Trees. SODA 1999: 235-244 |
17 | EE | Richard Cole, Ramesh Hariharan, Piotr Indyk: Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254 |
1998 | ||
16 | Richard Cole, Ramesh Hariharan: Approximate String Matching: A Simpler Faster Algorithm. SODA 1998: 463-472 | |
15 | 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) | |
1997 | ||
14 | EE | Richard Cole, Ramesh Hariharan: Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time. STOC 1997: 66-75 |
13 | Ramesh Hariharan: Optimal Parallel Suffix Tree Construction. J. Comput. Syst. Sci. 55(1): 44-69 (1997) | |
12 | Richard Cole, Ramesh Hariharan: Tighter Upper Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 26(3): 803-856 (1997) | |
1996 | ||
11 | Richard Cole, Ramesh Hariharan: An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SODA 1996: 323-332 | |
10 | Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan: Approximate Hypergraph Coloring. SWAT 1996: 41-52 | |
9 | Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan: Approximate Hypergraph Coloring. Nord. J. Comput. 3(4): 425-439 (1996) | |
1995 | ||
8 | Sanjeev Mahajan, Ramesh Hariharan: Derandomizing Semidefinite Programming Based Approximation Algorithms. FOCS 1995: 162-169 | |
7 | Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar: Faster Enumeration of All Spanning Trees of a Directed Graph. WADS 1995: 428-439 | |
6 | 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) | |
1994 | ||
5 | Ramesh Hariharan, S. Muthukrishnan: Optimal Parallel Algorithms for Prefix Matching. ICALP 1994: 203-214 | |
4 | EE | Ramesh Hariharan: Optimal parallel suffix tree construction. STOC 1994: 290-299 |
1993 | ||
3 | 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 | |
2 | Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick: Which Patterns are Hard to Find? ISTCS 1993: 59-68 | |
1992 | ||
1 | Richard Cole, Ramesh Hariharan: Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) FOCS 1992: 600-609 |