IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Theoretical Foundations of Computing (COMP)  (Searched in: 2023)

Search Results: Keywords 'from:2024-03-14 to:2024-03-14'

[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 8 of 8  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2024-03-14
Tokyo The University of Electro-Communications Number of Solutions of Pentahex and Heptiamond Puzzles
Toshihiro Shirakawa COMP2023-28
Packing puzzles, also known as plastic puzzles, have been considered difficult to calculate the total number of solution... [more] COMP2023-28
COMP 2024-03-14
Tokyo The University of Electro-Communications Proof of NP-completeness of Tasukuea
Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka) COMP2023-29
In this study, we prove that the existence determination of a solution is NP-complete problem for Tasukuea, a kind of co... [more] COMP2023-29
COMP 2024-03-14
Tokyo The University of Electro-Communications Masyu is Constant-Time Testable
Kotaro Kabutoishi, Hiro Ito (UEC) COMP2023-30
In this presentation, we provide a constant-time tester, or a tester for short, for a board puzzle “Masyu.”
This puzzle... [more]
COMP 2024-03-14
Tokyo The University of Electro-Communications [Invited Talk] Gap Amplification for Reconfiguration Problems
Naoto Ohsaka (CyberAgent) COMP2023-31
Combinatorial reconfiguration is an emerging field of theoretical computer science that studies the reachability between... [more] COMP2023-31
COMP 2024-03-14
Tokyo The University of Electro-Communications Reforming an Envy-Free Matching with Ties
Yuni Iwamasa, Jun Kawahara, Yuito Ueda (Kyoto Univ.) COMP2023-32
An envy-free matching is a type of matching between agents and items such that each agent have a preference order for th... [more] COMP2023-32
COMP 2024-03-14
Tokyo The University of Electro-Communications 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) COMP2023-33
 [more] COMP2023-33
COMP 2024-03-14
Tokyo The University of Electro-Communications Time Analysis of Space Efficient Uniform Partitioning in Population Protocols
Pascal Sahner (NAIST/RWTH Aachen), Ryota Eguchi (NAIST), Fukuhito Ooshita (FUT), Michiko Inoue (NAIST) COMP2023-34
Population protocols are a theoretical model for modeling a set of units with low computational capabilities - so called... [more] COMP2023-34
COMP 2024-03-14
Tokyo The University of Electro-Communications A consideration on the spannig polytope volume using the recurrence representation and its computation
Ei Ando (Senshu Univ.) COMP2023-35
In this paper, we consider the volume of the spanning tree polytope and
we can compute its volume exactly in polynomi... [more]
 Results 1 - 8 of 8  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

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