( en | de | ru )

 

Disambiguation of "Hariharan, Ramesh"

Author of the publication

copydeleteadd this publication to your clipboard
String matching in Õ(sqrt(n)+sqrt(m)) quantum time.

, and . J. Discrete Algorithms, 1 (1): 103-110 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hariharan Easwaran

Bharath Hariharan

Ramesh Ummanni

Ramesh Boggula

Ramesh Sharma

 

Other publications of authors with the same name

Tighter Lower Bounds on the Exact Complexity of String Matching., , , and . SIAM J. Comput., 24 (1): 30-45 (1995)A faster implementation of the Goemans-Williamson clustering algorithm., , , and . SODA, page 17-25. ACM/SIAM, (2001)Genome Sequencing for Disease Diagnosis: The Confluence of Biology and Computing.. HiPC, page 183. IEEE, (2019)A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching., , , , and . SIAM J. Comput., 27 (3): 668-681 (1998)An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees., and . SODA, page 323-332. ACM/SIAM, (1996)Faster suffix tree construction with missing suffix links., and . STOC, page 407-415. ACM, (2000)Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time., and . STOC, page 66-75. ACM, (1997)2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science., , and . FSTTCS, volume 2 of LIPIcs, page 10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Faster Algorithms for Minimum Cycle Basis in Directed Graphs., , and . SIAM J. Comput., 38 (4): 1430-1447 (2008)Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths., , and . J. Algorithms, 62 (2): 74-92 (2007)