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
Finding short right-hand-on-the-wall walks in graphs
TL;DR: A positive answer to the question whether it is for every undirected graph possible to assign the local orientations in such a way that the resulting perpetual traversal visits every node in O(n) moves is given.
Book ChapterDOI
An Online Algorithm for Finding the Longest Previous Factors
TL;DR: A novel algorithm for finding the longest factors in a text, for which the working space is proportional to the history text size, and which is online and exact, which can be directly used for data compression, pattern analysis, and data mining.
Book ChapterDOI
CRAM: compressed random access memory
TL;DR: The key observation that the empirical entropy of a string does not change much after a small change to the string, as well as the simple yet efficient method for maintaining an array of variable-length blocks under length modifications, may be useful for many other applications as well.
Journal ArticleDOI
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
TL;DR: A new technique for maintaining a dynamic trie T of size at most 2w nodes under the unit-cost RAM model with a fixed word size w is proposed, based on the idea of partitioning T into a set of linked small tries, each of which can be maintained efficiently.
Journal Article
Fast Algorithms for k-Word Proximity Search
Kunihiko Sadakane,Hiroshi Imai +1 more
TL;DR: Two algorithms for finding documents in which all given keywords appear in neighboring places are proposed, one based on plane-sweep algorithm and the other based on divide-and-conquer approach.