IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2021-05-07 - 2021-05-08 / Issue Date : 2021-04-30

COMP2021-1
On Learning from Average-Case Errorless Computing
Mikito Nanashima (Tokyo Tech)
pp. 1 - 8

COMP2021-2
An Improvement of the Biased-PPSZ Algorithm for the 3SAT Problem
Osamu Watanabe, Tong Qin (Tokyo Tech)
pp. 9 - 16

COMP2021-3
Exploration of dynamic graphs by the minimum number of agents
Shunsuke Iitsuka (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
pp. 17 - 22

COMP2021-4
A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition
Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
pp. 23 - 30

COMP2021-5
Procedures to Receive Linguistic Information (2) -- The Importance of Low Noise Emvironment --
Kumon Tokumaru (Writer)
pp. 31 - 38

COMP2021-6
An Extension of Cartesian Tree Matching Based-on Subsequences
Takeshi Kai, Kenta Mitsuyoshi, Isamu Furuya, Hiroki Arimura (Hokkaido Univ.)
pp. 39 - 45

COMP2021-7
Experimental analysis of a classical algorithm spoofing linear cross-entropy benchmarking
Kensuke Suzuki, Akinori Kawachi (Mie Univ.)
pp. 46 - 53

COMP2021-8
[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.)
p. 54

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan