Online edition: ISSN 2432-6380
[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]
COMP2021-21
On the average shortest path length of Host-Switch graphs with diameter 4
Daiki Shimizu, Yosuke Kikuchi (NIT, Tsuyama College)
pp. 1 - 8
COMP2021-22
Complexity of reconfiguration of regular induced subgraphs
Hiroshi Eto, Takehiro Ito (Tohoku Univ), Yasuaki Kobayashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech)
pp. 9 - 10
COMP2021-23
Token Sliding on Directed Graphs
Takehiro Ito (Tohoku Univ), Yuni Iwamasa, Yasuaki Kobayashi (Kyoto Univ), Yu Nakahata (NAIST), Masahiro Takahashi (Kyoto Univ), Yota Otachi (Nagoya Univ), Kunihiro Wasa (Toyohashi Tech)
pp. 11 - 18
COMP2021-24
[Short Paper]
A recommendation algorithm based on data polish
Shu Kumanogo, Mitsuo Motoki (Kanazawa Inst. of Tech.)
pp. 19 - 22
COMP2021-25
[Invited Talk]
Improved robustness of quantum supremacy for random circuit sampling
Yasuhiro Kondo, Ryuhei Mori (Tokyo Tech), Ramis Movassagh (IBM)
p. 23
COMP2021-26
Computational Power of Shallow Quantum Circuits with Fan-out Gates
Ryoga Araki, Akinori Kawachi (Mie Univ.), Francois Le Gall, Ansis Rosmanis (Nagoya Univ.)
pp. 24 - 29
COMP2021-27
On a Self-Stabilizing Algorithm for k-Flag Problem with Crash Failures
Yuta Yokoyama, Yonghwan Kim, Yoshiaki Katayama (Nitech)
pp. 30 - 37
COMP2021-28
(See Japanese page.)
pp. 38 - 39
COMP2021-29
Lower bounds for the total stopping time of 3x+ 1iterates revisited
Kazuyuki Amano (Gunma Univ.)
pp. 40 - 43
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.