K
Kunihiko Sadakane
Researcher at University of Tokyo
Publications - 189
Citations - 13039
Kunihiko Sadakane is an academic researcher from University of Tokyo. The author has contributed to research in topics: Time complexity & Compressed suffix array. The author has an hindex of 41, co-authored 180 publications receiving 9314 citations. Previous affiliations of Kunihiko Sadakane include National Institute of Informatics & National University of Singapore.
Papers
More filters
Book ChapterDOI
Fast relative lempel-ziv self-index for similar sequences
TL;DR: This work describes a new data structure that supports fast pattern searching and describes a basic compression scheme called relative Lempel-Ziv compression, which gives a good compression ratio when every string in S is similar to R, but does not provide any pattern searching functionality.
Journal Article
Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting
Kunihiko Sadakane,Hiroshi Imai +1 more
TL;DR: Two new algorithms for improving the speed of the LZ77 compression are proposed, based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting, which is suitable for small dictionaries and for large dictionaries.
Journal ArticleDOI
Combinatorics and algorithms for low-discrepancy, roundings of a real sequence
TL;DR: An optimal method is given to construct a compact graph to represent the set of global roundings satisfying a weaker discrepancy condition and it is shown that the number of such roundings is at most n + 1.
Proceedings ArticleDOI
Space-Time Trade-offs for Stack-Based Algorithms
TL;DR: This paper introduces the compressed stack technique, a method that allows to transform algorithms whose space bottleneck is a stack into memory-constrained algorithms, and gives a trade-off between the size of the workspace and running time.
Journal ArticleDOI
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
TL;DR: It is shown that the Lempel–Ziv-77 factorization of a text of length n on an integer alphabet of sizeσ can be computed in 𝕂 on time with either £(1+ϵ)nlgn+On bits (for a constant $$ϵ>0) of working space (including the space for the output, but not the text).