===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Toshihiro Fujito (Toyohashi Univ. of Tech.) Vice Chair: Shinichi Nakano (Gunma Univ.)
Secretary: Suguru Tamaki (Kyoto Univ.), Yota Otachi (Kumamoto Univ)
Assistant: Kazuhisa Seto (Seikei Univ.)
===============================================
Special Interest Group on Algorithms (IPSJ-AL)
DATE:
Fri, May 10, 2019 13:30 - 17:35
Sat, May 11, 2019 10:40 - 17:05
PLACE:
Kusunoki-kaikan, Kurokami North Campus, Kumamoto University(Kurokami 2-39-1, Chuo-ku, Kumamoto, 860-8555 Japan. Yota Otachi)
TOPICS:
----------------------------------------
Fri, May 10 (13:30 - 17:35)
----------------------------------------
(1) 13:30 - 14:30
[招待講演]初等中等教育における情報科学教育の現状と課題
○谷 聖一 (日本大学)
(2) 14:30 - 14:35
[表彰式] 情報処理学会コンピュータサイエンス領域功績賞
----- Break ( 15 min. ) -----
(3) 14:50 - 15:15
のりのり, 変形版へやわけのゼロ知識証明に対する物理プロトコル
○迫田 賢宜, 小野 廣隆 (名古屋大学)
(4)/COMP 15:15 - 15:40
Research on Similar Hole Puzzle: Hardness and Efficient Algorithm
Takashi Himoto, Ryuhei Uehara (JAIST)
(5)/COMP 15:40 - 16:05
On the Complexity of Lattice Puzzle:
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST)
----- Break ( 15 min. ) -----
(6) 16:20 - 16:45
Separate Chaining Meets Compact Hashing
○クップル ドミニク (九州大学 / 日本学術振興会)
(7) 16:45 - 17:10
データストリームのための頻出部分文字列発見アルゴリズム
○鳥谷部 直弥, 古谷 勇, 喜田 拓也 (北海道大学)
(8) 17:10 - 17:35
パラメタ化文字列に対する線形サイズ接尾辞トライ
○中島 克仁, ヘンリアン ディプタラマ, 吉仲 亮, 篠原 歩 (東北大学)
----------------------------------------
Sat, May 11 (10:40 - 17:05)
----------------------------------------
(9)/COMP 10:40 - 11:05
Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams
Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.)
(10)/COMP 11:05 - 11:30
Improved Quantum Multicollision-Finding Algorithm
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT)
(11)/COMP 11:30 - 11:55
Rational proofs for quantum computing
Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.)
----- Lunch ( 95 min. ) -----
(12)/COMP 13:30 - 14:30
[Invited Talk]
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space
Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.)
----- Break ( 15 min. ) -----
(13) 14:45 - 15:10
モバイルビザンチン故障の封じ込めと合意形成
○半澤 陽, 山内 由紀子 (九州大学)
(14)/COMP 15:10 - 15:35
Ring Exploration Algorithms for Myopic Luminous Robots with Larger Visibility
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue (NAIST)
----- Break ( 15 min. ) -----
(15)/COMP 15:50 - 16:15
(See Japanese page.)
(16) 16:15 - 16:40
C5フリー正則グラフの最大誘導マッチング問題に対する近似アルゴリズム
朝廣 雄一 (九州産業大学), Guohui Lin (University of Alberta), 柳 植竜, ○宮野 英次 (九州工業大学)
(17)/COMP 16:40 - 17:05
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender (Utrecht Univ.), Tesshu Hanaka (Chuo Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Yoshio Okamoto (UEC), Yota Otachi (Kumamoto Univ.), Tom C. van der Zanden (Utrecht Univ.)
# Information for speakers
General Talk will have 20 minutes for presentation and 5 minutes for discussion.
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# SECRETARY:
Suguru Tamaki
School of Informatics, Kyoto University
Address: Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
E-mail: kisk-u
=== Special Interest Group on Algorithms (IPSJ-AL) ===
Last modified: 2019-04-09 13:25:14
|
Notification: Mail addresses are partially hidden against SPAM.
|