Ramesh Hariharan Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

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

Colors in the list of coauthors

Copyright © Mon Mar 15 21:39:48 2010 by Michael Ley (ley@uni-trier.de)