Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
IT 
20191126 15:10 
Kagoshima 
Kirishima Kokusai Hotel 
[Invited Talk]
Succinct Data Structures and Information Theory Kunihiko Sadakane (UTokyo) IT201933 
Succinct data structures can compress data into their entropy and support efficient queries. In this paper, we explain ... [more] 
IT201933 pp.714 
COMP 
20190318 09:30 
Tokyo 
The University of Tokyo 
Range Mode Query and Solution Enumeration Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo) COMP201843 
The range mode query problem is constructing a data structure from the given array of $n$ terms which can efficiently an... [more] 
COMP201843 pp.18 
COMP 
20190318 11:10 
Tokyo 
The University of Tokyo 
A GPUbased Noncommutative Reduction and Its Applications to Operations for Difference Arrays Atsushi Koike (NIT Ichinoseki), Kunihiko Sadakane (UTokyo) COMP201847 
Reduction is basic operation in parallel computing.It is generalization of summation, in which we can use any associativ... [more] 
COMP201847 pp.3340 
COMP 
20180305 15:30 
Osaka 
Osaka Prefecture Univ. 
Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Realworld Networks Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) COMP201751 
Betweenness centrality is one of the most significant and commonly used centralities which is a notion of measuring the ... [more] 
COMP201751 pp.3542 
COMP, ISEC 
20161222 10:30 
Hiroshima 
Hiroshima University 
[Invited Talk]
Theory and Practice of Succinct Data Structures Kunihiko Sadakane (Univ. of Tokyo) ISEC201682 COMP201643 
Succinct data structures are data structures that can compress data to the limit and perform search and other operations... [more] 
ISEC201682 COMP201643 p.71 
COMP 
20150423 15:25 
Miyagi 

Computational Complexity of Generalized Makespan Minimization Problem Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo) COMP20154 
We generalize the makespan minimization problem on unrelated parallel machines and formulate the generalized makespan mi... [more] 
COMP20154 pp.2125 
COMP, IPSJAL 
20130517 16:05 
Hokkaido 
Otaru University of Commerce 
On Complexities of Parallel Sort Algorithms on AGPU model Atsushi Koike, Kunihiko Sadakane, Hoa Vu (NII) COMP201313 
This paper is concerned with complexities of parallel sorting algorithms on AGPU model.
First, we analyze known sort al... [more] 
COMP201313 pp.7580 
COMP 
20130318 13:45 
Gifu 
Gifu University 
Compact and Fast Indices Based on ZeroSuppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shinichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP201256 
In many reallife problems, we are often faced with manipulating families of sets. Manipulation of largescale set famil... [more] 
COMP201256 pp.2330 
COMP 
20121031 16:45 
Miyagi 
Tohoku University 
A Novel Computation Model for GPU Atsushi Koike, Kunihiko Sadakane (NII) COMP201242 
We propose a novel computation model for GPU. Known parallel computation models such as the PRAM model are not appropria... [more] 
COMP201242 pp.5360 
COMP 
20120903 11:25 
Tokyo 
Hosei University 
Compressing de Bruijn Graphs Alexander Bowe (NII), Taku Onodera (Univ. of Tokyo), Kunihiko Sadakane (NII), Tetsuo Shibuya (Univ. of Tokyo) COMP201229 
We propose a new succinct de Bruijn graph representation.
If the de Bruijn graph of $k$mers in a DNA sequence of len... [more] 
COMP201229 pp.2532 
COMP 
20120316 10:35 
Tokyo 
Univ. of Tokyo 
A simple parallel computation algorithm for functions on trees Kunihiko Sadakane (NII) COMP201148 
We propose a simple parallel algorithm for computing a function defined on a
rooted tree with $n$ nodes. Namely, we w... [more] 
COMP201148 pp.915 
COMP 
20111021 15:50 
Miyagi 
Tohoku Univ. 
Memory Compression WingKin Sung (NUS), Kunihiko Sadakane (NII), Jesper Jansson (Ochanomizu U.) COMP201134 
This paper proposes a new dynamic datastructure
for \emph{compressed random access memory}.
A memory (or string) $T[1... [more] 
COMP201134 pp.3946 
COMP 
20110422 15:50 
Kyoto 
Kyoto University 
Online Prediction on Labeled Graphs Koji Kobayashi, Kunihiko Sadakane (NII) COMP20119 
[more] 
COMP20119 pp.6168 
COMP 
20090526 10:05 
Saitama 
Saitama Univ. 
A Tight Upper Bound on the Hitting and the Cover times of Metropolis Walks Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ) COMP200910 
andom walks on finite graphs are random token circulation on graphs. Random walks such that token moves to adjacent vert... [more] 
COMP200910 pp.912 
COMP 
20090417 14:40 
Kyoto 
Kyoto Univ. 
Dynamic Succinct Ordinal Trees Kunihiko Sadakane (Kyushu Univ.) COMP20096 
This paper proposes succinct data structures for dynamic ordinal trees.
Succinct data structures are the ones whose siz... [more] 
COMP20096 pp.3741 
COMP 
20081010 11:15 
Miyagi 
Tohoku Univ. 
A Simple Succinct Representation of Balanced Parentheses Sequences Kunihiko Sadakane (Kyushu U) COMP200838 
The balanced parentheses sequence (BP) is a representation of ordinal trees
which was extensively studied recently. An... [more] 
COMP200838 pp.3340 
COMP 
20080513 14:30 
Fukuoka 
Kyushu Sangyo University 
On Necessary Conditions of Linear Cover Time Random Walks Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyusyu Univ) COMP200812 
A random walk on a finite graph is a model that a token on a vertex repeatedly moves to an adjacent vertex randomly chos... [more] 
COMP200812 pp.3336 
COMP 
20080310 11:50 
Kanagawa 

Compressed Fulltext Indexes for DNA Sequences Kunihiko Sadakane (Kyushu U.) COMP200760 
A problem of processing largescale data is the amount of space to store data
and the size of data structures for effic... [more] 
COMP200760 pp.3337 
COMP 
20070920 13:15 
Aichi 

Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP200735 
Given a graph $G$ of $n$ vertices whose edge weights are
random variables and obey mutually
independent normal distri... [more] 
COMP200735 pp.2127 
COMP 
20070525 15:55 
Fukuoka 
Kyushu University 
Optimality and Algorithms for the Balanced Edge Cover Problem Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP200717 
For an undirected graph $G = (V, E)$, an edge cover is defined as a set of edges that covers all vertices of $V$. It is... [more] 
COMP200717 pp.3742 