|
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.) |
|
Conference Date |
Thu, Sep 15, 2022 10:30 - 14:40 |
Topics |
Theoretical Computer Science, etc. |
Conference Place |
Yagami Campus, Keio University + online |
Announcement |
This workshop will be held in conjunction with FIT2022 ( https://www.ipsj.or.jp/event/fit/fit2022/ ). Please take care about registration procedure. |
If you attend FIT2022, you can also attend this workshop. Please register for FIT2022 from the FIT2022 page. |
If you attend only this workshop and you are not a student, please execute the following two procedures. |
This workshop can be held virtually due to prevention of the spread of coronavirus infection.
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 FIT2022 page. This procedure is necessary to access Zoom. |
If you are a student, please register for FIT2022 from the FIT2022 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. |
Thu, Sep 15 AM 10:30 - 14:40 |
(1) COMP |
10:30-11:00 |
Randomized Counter-Based Algorithms for Frequency Estimation over Data Streams in O(log log N) space |
Naonori Kakimura (Keio U.), Riku Nitta (IBM Japan) |
(2) COMP |
11:00-11:30 |
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs |
Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) |
(3) COMP |
11:30-12:00 |
Discussion on New Definition of Individual Fairness for Two-sided Matching |
Toru Nakamura, Takamasa Isohara (KDDI Research) |
|
12:00-13:00 |
Lunch Break ( 60 min. ) |
|
13:00-13:10 |
Award Ceremony ( 10 min. ) |
(4) |
13:10-13:40 |
[AL] 離散化アプローチによる共通展開図の非存在性の証明
Elena Arseneva (St Petersburg State University), Erik D. Demaine (CSAIL, MIT), ○Tonan Kamata (JAIST), Ryuhei Uehara (JAIST) |
(5) |
13:40-14:10 |
[AL] UNOを用いた数独に対するゼロ知識証明について
○田中 滉大(東北大学),水木 敬明(東北大学) |
(6) |
14:10-14:40 |
[AL] ボードゲーム「ノッカノッカ」の一般化と解析
○池内 明伸(九州大学),山口 勇太郎(大阪大学) |
Announcement for Speakers |
General Talk | Each speech will have 25 minutes for presentation and 5 minutes for discussion. |
Contact Address and Latest Schedule Information |
IPSJ-AL |
Special Interest Group on Algorithms (IPSJ-AL) [Latest Schedule]
|
Contact Address |
|
COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
Contact Address |
COMP Secretaries
E-: comp-n |
Last modified: 2022-07-21 21:13:31
|