Information and Systems-Theoretical Foundations of Computing(Date:2024/03/14)

Presentation
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),  

[Date]2024-03-14
[Paper #]COMP2023-33
Time Analysis of Space Efficient Uniform Partitioning in Population Protocols

Pascal Sahner(NAIST/RWTH Aachen),  Ryota Eguchi(NAIST),  Fukuhito Ooshita(FUT),  Michiko Inoue(NAIST),  

[Date]2024-03-14
[Paper #]COMP2023-34
[Invited Talk] Gap Amplification for Reconfiguration Problems

Naoto Ohsaka(CyberAgent),  

[Date]2024-03-14
[Paper #]COMP2023-31
Masyu is Constant-Time Testable

Kotaro Kabutoishi(UEC),  Hiro Ito(UEC),  

[Date]2024-03-14
[Paper #]COMP2023-30
Proof of NP-completeness of Tasukuea

Chiho Fukunaga(Univ. of Shizuoka),  Seiya Okubo(Univ. of Shizuoka),  

[Date]2024-03-14
[Paper #]COMP2023-29
A consideration on the spannig polytope volume using the recurrence representation and its computation

Ei Ando(Senshu Univ.),  

[Date]2024-03-14
[Paper #]COMP2023-35
Reforming an Envy-Free Matching with Ties

Yuni Iwamasa(Kyoto Univ.),  Jun Kawahara(Kyoto Univ.),  Yuito Ueda(Kyoto Univ.),  

[Date]2024-03-14
[Paper #]COMP2023-32
Number of Solutions of Pentahex and Heptiamond Puzzles

Toshihiro Shirakawa(*),  

[Date]2024-03-14
[Paper #]COMP2023-28