Sadakane's Homepage

W. K. Hon, K. Sadakane and W. K. Sung: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices, SIAM J. Comput. 38(6):2162--2178, 2009.
J. Larsson and K. Sadakane: Faster Suffix Sorting, Theoretical Computer Science, 387(3):258--272, 2007.
K. Sadakane: Compressed Suffix Trees with Full Functionality, Theory of Computing Systems, 41(4):589--607, 2007. pdf file
J. Jansson, K. Sadakane and W.-K. Sung: Ultra-succinct Representation of Ordered Trees, Proc. ACM-SIAM SODA, pp. 575--584, 2007.
Diego Arroyuelo, Gonzalo Navarro, and Kunihiko Sadakane: Reducing the space requirement of LZ-index, Proc. CPM, LNCS 4009, pp. 307--318, 2006.
K. Sadakane: Succinct Data Structures for Flexible Text Retrieval Systems, Journal of Discrete Algorithms, 5(1):12-22, 2007.
H.-L. Chan, W.-K. Hon, T.-W. Lam and K. Sadakane: Compressed Indexes for Dynamic Text Collections, ACM Transactions on Algorithms, Vol. 3, Issue 2, Article No. 21, May 2007.
W.-K. Hon, T.-W. Lam, K. Sadakane, W.-K. Sung and S. M. Yiu: A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays, Algorithmica, 48(1):23--36, 2007.
K. Sadakane and R. Grossi: Squeezing Succinct Data Structures into Entropy Bounds, Proc. ACM-SIAM SODA, pp. 1230--1239, 2006.
J. Chun, K. Sadakane and T. Tokuyama: Linear time algorithm for approximating a curve by a single-peaked curve, Algorithmica, 44(2):103--115, 2005.
J. Jansson, H.-K. Ng, K. Sadakane and W.-K. Sung: Rooted Maximum Agreement Supertrees, Algorithmica, 43(4):293--307, 2005.

Useful links

e-mail address : sada@csce.kyushu-u.ac.jp