IEICE Technical Report

Online edition: ISSN 2432-6380

Volume 123, Number 444

Theoretical Foundations of Computing

Workshop Date : 2024-03-14 / Issue Date : 2024-03-07

[PREV] [NEXT]

[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2023-28
Number of Solutions of Pentahex and Heptiamond Puzzles
Toshihiro Shirakawa
pp. 1 - 5

COMP2023-29
Proof of NP-completeness of Tasukuea
Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka)
pp. 6 - 13

COMP2023-30
Masyu is Constant-Time Testable
Kotaro Kabutoishi, Hiro Ito (UEC)
pp. 14 - 21

COMP2023-31
[Invited Talk] Gap Amplification for Reconfiguration Problems
Naoto Ohsaka (CyberAgent)
p. 22

COMP2023-32
Reforming an Envy-Free Matching with Ties
Yuni Iwamasa, Jun Kawahara, Yuito Ueda (Kyoto Univ.)
pp. 23 - 30

COMP2023-33
A proof of recurrence of a random walk on a growing network by a coupling technique
Shuma Kumamoto (Kyushu U), Shuji Kijima (Shiga U), Tomoyuki Shirai (Kyushu U)
pp. 31 - 33

COMP2023-34
Time Analysis of Space Efficient Uniform Partitioning in Population Protocols
Pascal Sahner (NAIST/RWTH Aachen), Ryota Eguchi (NAIST), Fukuhito Ooshita (FUT), Michiko Inoue (NAIST)
pp. 34 - 41

COMP2023-35
A consideration on the spannig polytope volume using the recurrence representation and its computation
Ei Ando (Senshu Univ.)
pp. 42 - 49

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