IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2019-03-18 / Issue Date : 2019-03-11

COMP2018-43
Range Mode Query and Solution Enumeration
Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo)
pp. 1 - 8

COMP2018-44
*
Sumiko Harasawa, Ryuhei Uehara (JAIST)
pp. 9 - 16

COMP2018-45
Implementation of Enumeration Algorithm of Connected Bipartite Permutation Graphs
Shinichi Ikeda, Ryuhei Uehara (JAIST)
pp. 17 - 23

COMP2018-46
(See Japanese page.)
pp. 25 - 31

COMP2018-47
A GPU-based Non-commutative Reduction and Its Applications to Operations for Difference Arrays
Atsushi Koike (NIT Ichinoseki), Kunihiko Sadakane (UTokyo)
pp. 33 - 40

COMP2018-48
[Invited Talk] The Diameter of Dense Random Regular Graphs
Nobutaka Shimizu (Univ. Tokyo/RIKEN AIP)
p. 41

COMP2018-49
[Invited Talk] Non-Black-Box Worst-Case to Average-Case Reductions within NP
Shuichi Hirahara (Univ. Tokyo)
p. 43

COMP2018-50
[Invited Talk] Cheeger Inequalities for Submodular Transformations
Yuichi Yoshida (NII)
p. 45

COMP2018-51
Move-optimal Randomized Partial Gathering of Anonymous Mobile Agents in Anonymous Unidirectional Rings
Norikazu Kawata (Osaka Univ.), Masahiro Shibata (KIT), Yuichi Sudo (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
pp. 47 - 54

COMP2018-52
On a Gathering by Seven Autonomous Mobile Robots in 2D Triangular Grid Plane
Masaki Oyabu, Yonghwan Kim, Yoshiaki Katayama (NIT)
pp. 55 - 62

COMP2018-53
On an Algorithm for Constructing a Strongly-Connected (2,2)-Directed Acyclic Graph in Biconnected Undirected Graph
Hiroki Aono, Yonghwan Kim, Yoshiaki Katayama (NIT)
pp. 63 - 70

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan