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
Dynamic neighborhood searches for thermodynamically designing DNA sequence
TL;DR: Techniques to reduce time-consuming evaluations of MFE are introduced, by which the proposed dynamic neighborhood search strategy become applicable to the thermodynamical constraints in practice.
Journal ArticleDOI
Quantum Computation in Computational Geometry
TL;DR: Some output-sensitive convex-hull algorithms and the ellipsoid algorithm for solving a general dimensional convex programming problem can be accelerated by using the quantum model.
Book ChapterDOI
More efficient periodic traversal in anonymous undirected graphs
Jurek Czyzowicz,Stefan Dobrev,Leszek Gąsieniec,David Ilcinkas,Jesper Jansson,Ralf Klasing,Ioannis Lignos,Russell Martin,Kunihiko Sadakane,Wing-Kin Sung +9 more
TL;DR: The first non-trivial lower bound is given on the period length for the oblivious case, and a period of length at most $4\frac{1}{3}n$ for oblivious agents and 3.5n for agents with constant memory is shown.
Book ChapterDOI
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
TL;DR: A compressed version of the dynamic trie data structure is proposed which is not only space efficient, but also allows pattern searching in o(|P|) time and leaf insertion/ deletion in O(log n) time, where |P| is the length of the pattern and n is the size of the trie.
Book ChapterDOI
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem
TL;DR: This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to efficient manipulation of Boolean functions by O BDD and graph theory.