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) [schedule] [select]
Chair Toshimitsu Masuzawa (Osaka Univ.)
Vice Chair Hirotaka Ono (Nagoya Univ)
Secretary Fukuhito Ooshita (NAIST), Ei Ando (Senshu Univ.)
Assistant Yota Otachi (Nagoya Univ)

Special Interest Group on Algorithms (IPSJ-AL) [schedule] [select]

Conference Date Tue, Sep 1, 2020 10:30 - 17:00
Wed, Sep 2, 2020 10:00 - 12:00
Conference Place Online 
Announcement This workshop will be held in conjunction with FIT2020 ( ). Please take care about registration procedure.
If you attend FIT2020, you can also attend this workshop. Please register for FIT2020 from the FIT2020 page.
If you attend only this workshop and you are not a student, please execute the following two procedures.
1. Register for the workshop from this system. The registration fee is 2000JPY for members and 3000JPY for non-members. If you have made an annual registration, you do not have to do this procedure.
2. Register for "the workshop only" from the FIT2020 page. This procedure is necessary to access Zoom.
If you are a student, please register for FIT2020 from the FIT2020 page. The registration fee is free.
Registration Fee This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on COMP.

Tue, Sep 1 AM 
10:30 - 12:00
(1) 10:30-11:00 データストリームに対する頻出アイテム系列発見のための省メモリアルゴリズム
鳥谷部 直弥(北海道大学),○喜田 拓也(北海学園大学)
(2) 11:00-11:30 [AL] Sorting by Five Prefix Reversals
Tetsuya Araki (Gunma University), Takashi Horiyama (Hokkaido University), Shin-ichi Nakano (Gunma University), Yoshio Okamoto (The University of Electro-Communications), Yota Otachi (Nagoya University), Ryuhei Uehara (Japan Advanced Institute of Science and Technology), Takeaki Uno (National Institute of Informatics), ○Katsuhisa Yamanaka (Iwate University)
(3) 11:30-12:00 二次元メディアングラフ上での区間クエリ問題
○隈部 壮(東京大学)
Tue, Sep 1 PM 
13:10 - 17:00
(4) 13:10-14:10 [COMP][Invited Talk] Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
○Takuro Fukunaga(Chuo Univ.)
(5) 14:10-14:40 Minmax regret 1-sink problem with parametric weights Yuki Tokuni (Kwansei Gakuin Univ.), Naoki Katoh, 〇Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo)
14:40-15:10 Complexity of Colored Token Shifting on Graphs Sai Kwon Kham, Ryuhei Uehara (JAIST)
  15:10-15:30 Break ( 20 min. )
(7) 15:30-16:00 [AL] A Unified Approach for Designing Succinct Navigational Oracles for Families of Intersection Graphs on Circle
Hueseyin Acan (Drexel University, United States), Sankardeep Charkraborty (National Institute of Informatics, Japan), Seungbum Jo (Chungbuk National University, South Korea), ○Kei Nakashima, Kunihiko Sadakane (The University of Tokyo, Japan), Srinivasa Rao Satti (Seoul National University, South Korea)
(8) 16:00-16:30 Efficient enumeration of minimal multiway cuts
○Kazuhiro Kurita (Hokkaido University), Yasuaki Kobayashi (Kyoto University)
(9) 16:30-17:00 A computation method of minimum-comparison sorting network using BDD
○Kensuke Onishi (Tokai University), Takeaki Uno (National Institute of Informatics)
Wed, Sep 2 AM 
10:00 - 12:00
10:00-10:30 Procedure to Receive Linguistic Information
-- To construct Common Human Intelligence --
Kumon Tokumaru (Writer)
10:30-11:00 Uniform Bipartition in Population Protocol Model over Arbitrary Communication Networks Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST), Sebastien Tixeuil (Sorbonne Universite)
11:00-11:30 Tree-Based Asynchronous Data Transmission with Delay for Healthcare Sensor Networks Susumu Shibusawa (Ibaraki Univ.), Toshiya Watanabe (NIT, Gunma College)
11:30-12:00 What Restrictions Naturally Allow Well-Known NP-Complete Problems to Yield NL-Completeness and the Linear Space Hypothesis? Tomoyuki Yamakami (U of Fukui)

Announcement for Speakers
General TalkEach speech will have 25 minutes for presentation and 5 minutes for discussion.

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address Fukuhito Ooshita
Nara Institute of Science and Technology
Address: Takayama 8916-5, Ikoma, Nara 630-0192, Japan
E-: f-oosiisist 
IPSJ-AL Special Interest Group on Algorithms (IPSJ-AL)   [Latest Schedule]
Contact Address  

Last modified: 2020-08-11 19:12:30

Notification: Mail addresses are partially hidden against SPAM.

[Download Paper's Information (in Japanese)] <-- Press download button after click here.

[Presentation and Participation FAQ] (in Japanese)
[Cover and Index of IEICE Technical Report by Issue]

[Return to COMP Schedule Page]   /   [Return to IPSJ-AL Schedule Page]   /  
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 

[Return to Top Page]

[Return to IEICE Web Page]

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