Monday, January 18

Session 17
Strings and Trees

9:00 AM-10:40 AM
Room: Liberty A
Chair: Dan Gusfield, University of California, Davis

9:00-9:17 Distinguished String Selection Problems
J. Kevin Lanctot and Ming Li, University of Waterloo, Canada; Bin Ma, City University of Hong Kong, China; Shaojiu Wang, New Pasteur Merieux Connaught, Toronto, Canada; and Louxin Zhang, National University of Singapore, Singapore
9:20-9:37 Efficient Approximation Algorithms for the Hamming Center Problem
Leszek Gasieniec, University of Liverpool, United Kindom; Jesper Jansson and Andrzej Lingas, Lund University, Sweden
9:40-9:57 An Analysis of the Burrows-Wheeler Transform
Giovanni Manzini, Università del Piemonte Orientale, Alessandria, Italy
10:00-10:17 Tree Pattern Matching and Subset Matching in Deterministic O(n log 3 n)-Time
Richard Cole, Courant Institute of Mathematical Sciences, New York University; Ramesh Hariharan, Indian Institute of Science, Bangalore, India; and Piotr Indyk, Stanford University
10:20-10:37 Parameterized Diff
Brenda S. Baker, Bell Laboratories, Lucent Technologies

SODA'99 Home


Program Updates

Author Index




tjf, 9/12/98, MMD, 11/2/98