| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | / | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Hiroyuki Uno (Osaka Metropolitan Univ.) Vice Chair: Shuji Kijima (Shiga Univ.) Secretary: Kunihiro Wasa (Hosei Univ.), Yu Yokoi (NII) Assistant: Ei Ando (Senshu Univ.) DATE: Tue, Dec 6, 2022 09:30 - 17:20 PLACE: Media Hall, Ehime University(3 Bunkyo-cho, Matsuyama-shi, Ehime, Japan.) TOPICS: Theoretical Computer Science, etc ---------------------------------------- Tue, Dec 6 AM (09:30 - 17:20) ---------------------------------------- (1) 09:30 - 09:55 Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.) (2) 09:55 - 10:20 (See Japanese page.) (3) 10:20 - 10:45 A Common Generalization of Budget Games and Congestion Games Fuga Kiyosue (SCSK), Kenjiro Takazawa (Hosei Univ.) ----- Break ( 15 min. ) ----- (4) 11:00 - 11:25 Average space complexity of tent expansions around the golden ratio Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) (5) 11:25 - 11:50 Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) (6) 11:50 - 12:15 (See Japanese page.) ----- Lunch Break ( 90 min. ) ----- (7) 13:45 - 14:45 [Invited Talk] Coordination of Multiple game AI in Two-player Board Games Shogo Takeuchi (Kochi Univ. of Tech.) ----- Break ( 15 min. ) ----- (8) 15:00 - 15:25 A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) (9) 15:25 - 15:50 (See Japanese page.) ----- Break ( 15 min. ) ----- (10) 16:05 - 16:30 The Computational Complexity of Majority Function : A Survey Kazuhisa Seto (Hokkaido Univ.) (11) 16:30 - 16:55 Sequentially Swapping Tokens: Further on Graph Classes Hironori Kiya (Kyushu Univ.), Yuto Okada, Hirotaka Ono, Yota Otachi (Nagoya Univ.) (12) 16:55 - 17:20 Isomorphism Elimination by Repetitive Representative-Extraction with Fragments of Automorphisms Kouhei Takahashi, Kazuhisa Seto, Takashi Horiyama (Hokkaido 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) === # FUTURE SCHEDULE: Thu, Mar 2, 2023: Ochanomizu University [Tue, Jan 17], Topics: Theoretical Computer Science, etc # SECRETARY: COMP Secretaries E-mail: comp-  n    Last modified: 2022-10-20 22:49:45 |
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 | / | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]