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
Journal ArticleDOI
Entropy estimation with suffix arrays
TL;DR: An algorithm for estimating the entropy of a string using the suffix array is given, based on a new combinatorial property of the longest common prefix array of astring.
Posted Content
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
TL;DR: In this paper, succinct encodings of series-parallel, block-cactus, and 3-leaf power graphs with optimal query support were proposed for the RAM model with logarithmic word size.
Book ChapterDOI
Engineering Hybrid DenseZDDs
TL;DR: This paper engineers a practical implementation of Hybrid DenseZDDs, a compression algorithm to compress the size of static and dynamic ZDDs and shows results on the frequent itemset mining problem that show the algorithm uses 33i¾ź% of memory compared with a standard ZDD at the cost of 40i½ŷ% increase in running time.
Proceedings ArticleDOI
The Capocelli Prize
N. Abedini,Sunil P. Khatri,P. Hanus,Georg Chalkidis,Yuval Kochman,Dongsheng Bi,Michael W. Hoffman,Khalid Sayood,Lav R. Varshney,Emin Martinian,Gregory W. Wornell,Ram Zamir,Narayana Santhanam,Daniel K. Blandford,Qian Zhao,Edwin S. Hong,Kunihiko Sadakane,Matthias Ruhl,Hannes Hartenstein,Earl Levine,Suzanne Bunton +20 more
TL;DR: This paper presents a treatment of Scalar Quantization For Relative Error using an SAT-Based Scheme to Determine Optimal Fix-free Codes.
Journal Article
Forest search : A paradigm for faster exploration of scale-free networks
TL;DR: A new exploration paradigm called forest search particularly designed for scale-free networks is proposed, and its superiority over random walk based search algorithms is demonstrated by conducting simulations.