Items where Author is "Cole, Richard"

Article

Cole, Richard ; Hariharan, Ramesh (2005) Dynamic LCA queries on trees SIAM Journal on Computing, 34 (4). pp. 894-923. ISSN 0097-5397

Cole, Richard ; Galil, Zvi ; Hariharan, Ramesh ; Muthukrishnan, S. ; Park, Kunsoo (2004) Parallel two dimensional witness computation Information and Computation, 188 (1). pp. 20-67. ISSN 0890-5401

Cole, Richard ; Hariharan, Ramesh (2003) Faster suffix tree construction with missing suffix links SIAM Journal on Computing, 33 (1). pp. 26-42. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh (2003) Tree pattern matching to subset matching in linear time SIAM Journal on Computing, 32 (4). pp. 1056-1066. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh (2002) Approximate string matching: a simpler faster algorithm SIAM Journal on Computing, 31 (6). pp. 1761-1782. ISSN 0097-5397

Cole, Richard ; Farach-Colton, Martin ; Hariharan, Ramesh ; Przytycka, Teresa ; Thorup, Mikkel (2000) An On(log n) algorithm for the maximum agreement subtree problem for binary trees SIAM Journal on Computing, 30 (5). pp. 1385-1404. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh (1997) Tighter upper bounds on the exact complexity of string matching SIAM Journal on Computing, 26 (3). pp. 803-856. ISSN 0097-5397

Cole, Richard ; Hariharan, Ramesh ; Paterson, Mike ; Zwick, Uri (1995) Tighter lower bounds on the exact complexity of string matching SIAM Journal on Computing, 24 (1). pp. 30-45. ISSN 0097-5397

Conference or Workshop Item

Cole, Richard ; Hariharan, Ramesh (2003) A fast algorithm for computing steiner edge connectivity In: STOC '03 Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, June 09-11, 2003, San Diego, CA, USA.

Cole, Richard ; Hariharan, Ramesh (2002) Verifying candidate matches in sparse and wildcard matching In: Proceeding STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada.

Cole, Richard ; Hariharan, Ramesh ; Lewenstein, Moshe ; Porat, Ely (2001) A faster implementation of the Goemans-Williamson clustering algorithm In: SODA '01 Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, January 07-09, 2001, Washington, D.C., USA.

Cole, Richard ; Hariharan, Ramesh ; Indyk, Piotr (1999) Tree pattern matching and subset matching in deterministic O(n log3 n)-time In: SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, January 17-19, 1999, Baltimore, Maryland, USA.