===============================================
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:
Mon, Mar 8, 2021 09:45 - 18:00
PLACE:
Online
TOPICS:
----------------------------------------
Mon, Mar 8 AM (09:45 - 11:15)
----------------------------------------
(1) 09:45 - 10:15
On an Algorithm for minimizing the number of routers in Grid Networks among Three Points
Yusuke Sawada, Yonghwan Kim, Yoshiaki Katayama (Nitech)
(2) 10:15 - 10:45
On the gathering problem for fat robots on a grid with agreement on the origin and one-axis
Kazuki Takahashi, Yonghwan Kim, Yoshiaki Katayama (Nitech)
(3) 10:45 - 11:15
Team Assembling Problem by Kilobots
Tang Run, Yamauchi Yukiko (Kyushu Univ.), Sebastien Tixeuil (Sorbonne Univ.)
----- Break ( 15 min. ) -----
----------------------------------------
Mon, Mar 8 AM Invited Talk (PODC2020, SODA2021) (11:30 - 12:30)
----------------------------------------
(4) 11:30 - 12:30
[Invited Talk]
Tight Distributed Listing of Cliques
Keren Censor-Hillel (Technion), Yi-Jun Chang (ETH), François Le Gall (Nagoya Univ.), Dean Leitersdorf (Technion)
----- Lunch Break ( 60 min. ) -----
----------------------------------------
Mon, Mar 8 PM Invited Talk (FOCS2020) (13:30 - 14:30)
----------------------------------------
(5) 13:30 - 14:30
[Invited Talk]
Sample-efficient Hamiltonian learning of quantum many-body systems
Anurag Anshu (UC Berkley), Srinivasan Arunachalam (IBM), Tomotaka Kuwahara (RIKEN AIP), Mehdi Soleimanifar (MIT)
----- Break ( 15 min. ) -----
----------------------------------------
Mon, Mar 8 PM (14:45 - 16:15)
----------------------------------------
(6) 14:45 - 15:15
Classically Simulating Quantum Circuits with Local Depolarizing Noise
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani (NTT)
(7) 15:15 - 15:45
A hyper-heuristic for the maximum clique problem
Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC)
(8) 15:45 - 16:15
A further improved MCT algorithm for finding a maximum clique
Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC)
----- Break ( 15 min. ) -----
----------------------------------------
Mon, Mar 8 PM (16:30 - 18:00)
----------------------------------------
(9) 16:30 - 17:00
On the Existence of 4-regular Uniquely Hamiltonian Graphs
Ryota Sakamoto (UEC Tokyo)
(10) 17:00 - 17:30
A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem
Takumi Tatematsu, Toshihiro Fujito (TUT)
(11) 17:30 - 18:00
On generative capacity of controlled right linear grammars with unknown behaviors
Daihei Ise, Satoshi Kobayashi (UEC)
# Information for speakers
General Talk will have 25 minutes for presentation and 5 minutes for discussion.
# CONFERENCE ANNOUNCEMENT:
- Please register to join the meeting.
https://forms.gle/Y61MjGNgCHksjufKA
- Please pay the registration fee from the below link in "Registration fee".
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Fri, May 7, 2021 - Sat, May 8, 2021: Online [Tue, Mar 16]
# SECRETARY:
Fukuhito Ooshita
Nara Institute of Science and Technology
Address: Takayama 8916-5, Ikoma, Nara 630-0192, Japan
E-mail: f-oosiisist
Last modified: 2021-02-03 13:34:09
|
Notification: Mail addresses are partially hidden against SPAM.
|