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: 2020)

Search Results: Keywords 'from:2020-09-01 to:2020-09-01'

[Go to Official COMP Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2020-09-01
14:40
Online Online Complexity of Colored Token Shifting on Graphs
Sai Kwon Kham, Ryuhei Uehara (JAIST) COMP2020-6
Variations of reconfiguration problems are much of interest and important problems in theoretical computer science. The ... [more] COMP2020-6
pp.1-8
COMP, IPSJ-AL 2020-09-02
10:00
Online Online Procedure to Receive Linguistic Information -- To construct Common Human Intelligence --
Kumon Tokumaru (Writer) COMP2020-7
Humans are eusocial animal. Language is a communication tool inside community and a tool to generate and develop collect... [more] COMP2020-7
pp.9-16
COMP, IPSJ-AL 2020-09-02
10:30
Online Online Uniform Bipartition in Population Protocol Model over Arbitrary Communication Networks
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST), Sebastien Tixeuil (Sorbonne Universite) COMP2020-8
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide... [more] COMP2020-8
pp.17-24
COMP, IPSJ-AL 2020-09-02
11:00
Online Online Tree-Based Asynchronous Data Transmission with Delay for Healthcare Sensor Networks
Susumu Shibusawa (Ibaraki Univ.), Toshiya Watanabe (NIT, Gunma College) COMP2020-9
The ability to obtain health-related information at any time through the use of sensor network technology for healthcare... [more] COMP2020-9
pp.25-32
COMP, IPSJ-AL 2020-09-02
11:30
Online Online What Restrictions Naturally Allow Well-Known NP-Complete Problems to Yield NL-Completeness and the Linear Space Hypothesis?
Tomoyuki Yamakami (U of Fukui) COMP2020-10
Many practical combinatorial problems have been shown to be NP-complete or NP-hard. To cope with further real-life situa... [more] COMP2020-10
pp.33-40
 Results 1 - 5 of 5  /   
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