Ramesh Hariharan

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

Coauthor Index

1	Noga Alon	[10]
2	Amihood Amir	[23] [34]
3	Sunil Arya	[21]
4	Kalika Bali	[30]
5	Surender Baswana	[29] [36] [41]
6	Anand Bhalgat	[42] [47] [52]
7	Chiranjib Bhattacharyya (Chiru Bhattacharyya)	[44] [51]
8	Dany Breslauer	[9]
9	Vijay Chandru (Vijaya Chandru)	[38]
10	Siu-Wing Cheng	[21]
11	Richard Cole	[1] [2] [3] [6] [12] [13] [15] [17] [18] [19] [20] [22] [23] [24] [26] [28] [31] [32] [34] [35] [37] [39]
12	Maxime Crochemore	[3] [16]
13	Martin Farach-Colton (Martin Farach)	[20]
14	Zvi Galil	[3] [37]
15	Leszek Gasieniec	[3] [16]
16	Piotr Indyk	[18]
17	Vinay Jethava	[51]
18	Sanjiv Kapoor	[7]
19	Telikepalli Kavitha	[40] [42] [43] [45] [47]
20	Pierre Kelsen	[10] [11]
21	Narasimha M. Krishnakumar	[38]
22	Krishnan Kumar	[44]
23	Vijay Kumar	[7]
24	Moshe Lewenstein	[23] [24] [34]
25	Sanjeev Mahajan	[8] [10] [11]
26	Swami Manohar	[30]
27	Kurt Mehlhorn	[40] [45]
28	David M. Mount	[21]
29	Madhavan Mukund	[25] [48] [49] [50]
30	S. Muthukrishnan (S. Muthu Muthukrishnan)	[3] [5] [16] [37]
31	Gopal Pandurangan	[27]
32	Debmalya Panigrahi	[42] [43] [47]
33	Kunsoo Park	[3] [37]
34	Mike Paterson	[2] [6]
35	Ely Porat	[23] [24] [34]
36	Teresa M. Przytycka	[20]
37	Wojciech Rytter	[3] [16]
38	Sandeep Sen	[29] [36] [41]
39	Krishnan Suresh	[51]
40	Mikkel Thorup	[20]
41	V. Vinay	[25] [33] [48] [49] [50]
42	Uri Zwick	[2] [6]

Colors in the list of coauthors