|
 | Up a level |
Baswana, Surender and Kavitha, Telikepalli (2010) Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. In: SIAM Journal on Computing, 39 (7). pp. 2865-2896.
Abraham, David J and Irving, Robert W and Kavitha, Telikepalli and Mehlhorn, Kurt (2007) Popular Matchings. In: SIAM Journal on Computing, 37 (4). pp. 1030-1045.
Cole, Richard and Hariharan, Ramesh (2005) Dynamic LCA Queries on Trees. In: SIAM Journal on Computing, 34 (4). pp. 894-923.
Cole, Richard and Hariharan, Ramesh (2003) Faster Suffix Tree Construction with Missing Suffix Links. In: SIAM Journal on Computing, 33 (1). pp. 26-42.
Cole, Richard and Hariharan, Ramesh (2003) Tree Pattern Matching to Subset Matching in Linear Time. In: SIAM Journal on Computing, 32 (4). pp. 1056-1066.
Kumar, Anil VS and Ramesh, H (2003) Covering Rectilinear Polygons with Axis-Parallel Rectangles. In: SIAM Journal on Computing, 32 (6). pp. 1509-1541.
Cole, Richard and Hariharan, Ramesh (2000) Approximate String Matching: A Simpler Faster Algorithm. In: SIAM Journal on Computing, 31 (6). pp. 1761-1782.
Cole, Richard and Farach-Colton, Martin and Hariharan, Ramesh and Przytycka, Teresa and Thorup, Mikkel (2000) An O (n log n) algorithm for the maximum agreement subtree problem for binary trees. In: SIAM Journal on Computing, 30 (5). pp. 1385-1404.
Cole, Richard and Hariharan, Ramesh (1997) Tighter upper bounds on the exact complexity of string matching. In: SIAM Journal on Computing, 26 (3). pp. 803-856.
Buchsbaum, Adam L and Sundar, Rajamani and Tarjan, Robert E (1995) Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues. In: SIAM Journal on Computing, 24 (6). pp. 1190-1206.
