Information and Systems-Theoretical Foundations of Computing(Date:2021/05/07)

Presentation
On Learning from Average-Case Errorless Computing

Mikito Nanashima(Tokyo Tech),  

[Date]2021-05-07
[Paper #]COMP2021-1
Exploration of dynamic graphs by the minimum number of agents

Shunsuke Iitsuka(Osaka Univ.),  Yuichi Sudo(Hosei Univ.),  Taisuke Izumi(Osaka Univ.),  Toshimitsu Masuzawa(Osaka Univ.),  

[Date]2021-05-07
[Paper #]COMP2021-3
A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition

Yuto Taniuchi(Osaka Univ.),  Yuichi Sudo(Hosei Univ.),  Taisuke Izumi(Osaka Univ.),  Toshimitsu Masuzawa(Osaka Univ.),  

[Date]2021-05-07
[Paper #]COMP2021-4
An Improvement of the Biased-PPSZ Algorithm for the 3SAT Problem

Osamu Watanabe(Tokyo Tech),  Tong Qin(Tokyo Tech),  

[Date]2021-05-07
[Paper #]COMP2021-2
An Extension of Cartesian Tree Matching Based-on Subsequences

Takeshi Kai(Hokkaido Univ.),  Kenta Mitsuyoshi(Hokkaido Univ.),  Isamu Furuya(Hokkaido Univ.),  Hiroki Arimura(Hokkaido Univ.),  

[Date]2021-05-08
[Paper #]COMP2021-6
Experimental analysis of a classical algorithm spoofing linear cross-entropy benchmarking

Kensuke Suzuki(Mie Univ.),  Akinori Kawachi(Mie Univ.),  

[Date]2021-05-08
[Paper #]COMP2021-7
[Invited Talk] Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project

Shin-ichi Minato(Kyoto Univ.),  

[Date]2021-05-08
[Paper #]COMP2021-8
Procedures to Receive Linguistic Information (2)

Kumon Tokumaru(Writer),  

[Date]2021-05-08
[Paper #]COMP2021-5