| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Toshimitsu Masuzawa (Osaka Univ.) Vice Chair: Hirotaka Ono (Nagoya Univ) Secretary: Fukuhito Ooshita (NAIST), Ei Ando (Senshu Univ.) Assistant: Yota Otachi (Nagoya Univ) DATE: Fri, Oct 23, 2020 10:00 - 17:40 PLACE: B101, Graduate School of Information Science and Technology, Osaka University + Online(Yamadaoka 1-5, Suita-shi, 565-0871 Japan. https://www.ist.osaka-u.ac.jp/english/access/. Prof. Toshimitsu Masuzawa) TOPICS: ---------------------------------------- Fri, Oct 23 AM (10:00 - 11:45) ---------------------------------------- (1) 10:00 - 10:35 Algorithms for uniform deployment of mobile agents in dynamic rings Masahiro Shibata（Kyutech）・〇Yuichi Sudo（Osaka Univ.）・Junya Nakamura（Toyohashi Tech）・Yonghwan Kim（NITech） (2) 10:35 - 11:10 On a Complete Visibility for Autonomous Mobile Robots with Lights in Asynchronous scheduler on a Grid Plane Yuno Ishida, Yonghwan Kim, Yoshiaki Katayama (NIT) (3) 11:10 - 11:45 Classical verification of quantum computing with the trusted center Tomoyuki Morimae (Kyoto Univ.) ----- Lunch Break ( 90 min. ) ----- ---------------------------------------- Fri, Oct 23 PM (13:15 - 14:15) ---------------------------------------- (4) 13:15 - 14:15 [Invited Talk] Index reduction for differential-algebraic equations with mixed matrices Satoru Iwata, Taihei Oki (The Univ. of Tokyo), Mizuyo Takamatsu (Chuo Univ.) ----- Break ( 15 min. ) ----- ---------------------------------------- Fri, Oct 23 PM (14:30 - 17:40) ---------------------------------------- (5) 14:30 - 15:05 Mathematical Characterization and Computational Complexity of Anti-Slide Puzzles Ko Minamisawa, Ryuhei Uehara (JAIST), Masao Hara (Tokai Univ.) (6) 15:05 - 15:40 The odd depth tree problem Hiroshi Nishiyama (Kyushu Univ.) (7) 15:40 - 16:15 Optimal online packet scheduling for 2-bounded delay buffer management with lookahead Koji M. Kobayashi (UT) ----- Break ( 15 min. ) ----- (8) 16:30 - 17:05 Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs Kazuaki Yamazaki, Qian Mengze, Ryuhei Uehara (JAIST) (9) 17:05 - 17:40 Polynomial Delay Enumeration for Steiner Problems Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) # Information for speakers General Talk will have 30 minutes for presentation and 5 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Fri, Dec 4, 2020: Online [Fri, Oct 16] # SECRETARY: Fukuhito Ooshita Nara Institute of Science and Technology Address: Takayama 8916-5, Ikoma, Nara 630-0192, Japan E-mail: f-oosi   is  ist Last modified: 2020-11-06 16:10:29 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]