Information and Systems-Theoretical Foundations of Computing(Date:2021/12/03)

Presentation
On the average shortest path length of Host-Switch graphs with diameter 4

Daiki Shimizu(NIT, Tsuyama College),  Yosuke Kikuchi(NIT, Tsuyama College),  

[Date]2021-12-03
[Paper #]COMP2021-21
[Short Paper] A recommendation algorithm based on data polish

Shu Kumanogo(Kanazawa Inst. of Tech.),  Mitsuo Motoki(Kanazawa Inst. of Tech.),  

[Date]2021-12-03
[Paper #]COMP2021-24
Token Sliding on Directed Graphs

Takehiro Ito(Tohoku Univ),  Yuni Iwamasa(Kyoto Univ),  Yasuaki Kobayashi(Kyoto Univ),  Yu Nakahata(NAIST),  Masahiro Takahashi(Kyoto Univ),  Yota Otachi(Nagoya Univ),  Kunihiro Wasa(Toyohashi Tech),  

[Date]2021-12-03
[Paper #]COMP2021-23
Computational Power of Shallow Quantum Circuits with Fan-out Gates

Ryoga Araki(Mie Univ.),  Akinori Kawachi(Mie Univ.),  Francois Le Gall(Nagoya Univ.),  Ansis Rosmanis(Nagoya Univ.),  

[Date]2021-12-03
[Paper #]COMP2021-26
On a Self-Stabilizing Algorithm for k-Flag Problem with Crash Failures

Yuta Yokoyama(Nitech),  Yonghwan Kim(Nitech),  Yoshiaki Katayama(Nitech),  

[Date]2021-12-03
[Paper #]COMP2021-27
Complexity of reconfiguration of regular induced subgraphs

Hiroshi Eto(Tohoku Univ),  Takehiro Ito(Tohoku Univ),  Yasuaki Kobayashi(Kyoto Univ),  Yota Otachi(Nagoya Univ),  Kunihiro Wasa(Toyohashi Tech),  

[Date]2021-12-03
[Paper #]COMP2021-22
省領域な lexicographic parse 構築アルゴリズム

,  

[Date]2021-12-03
[Paper #]COMP2021-28
Lower bounds for the total stopping time of 3x+ 1iterates revisited

Kazuyuki Amano(Gunma Univ.),  

[Date]2021-12-03
[Paper #]COMP2021-29
[Invited Talk] Improved robustness of quantum supremacy for random circuit sampling

Yasuhiro Kondo(Tokyo Tech),  Ryuhei Mori(Tokyo Tech),  Ramis Movassagh(IBM),  

[Date]2021-12-03
[Paper #]COMP2021-25