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-10-23 to:2020-10-23'

[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 2020-10-23
10:35
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
On a Complete Visibility for Autonomous Mobile Robots with Lights in Asynchronous scheduler on a Grid Plane
Yuno Ishida, Yonghwan Kim, Yoshiaki Katayama (NIT) COMP2020-11
Autonomous mobile robot system is a distributed system consisting of autonomous mobile computational entities
(called r... [more]
COMP2020-11
pp.1-8
COMP 2020-10-23
11:10
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Classical verification of quantum computing with the trusted center
Tomoyuki Morimae (Kyoto Univ.)
 [more]
COMP 2020-10-23
13:15
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
[Invited Talk] Index reduction for differential-algebraic equations with mixed matrices
Satoru Iwata, Taihei Oki (The Univ. of Tokyo), Mizuyo Takamatsu (Chuo Univ.) COMP2020-12
Differential-algebraic equations (DAEs) are widely used for the modeling of dynamical systems. The difficulty in numeric... [more] COMP2020-12
p.9
COMP 2020-10-23
14:30
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Mathematical Characterization and Computational Complexity of Anti-Slide Puzzles
Ko Minamisawa, Ryuhei Uehara (JAIST), Masao Hara (Tokai Univ.) COMP2020-13
For a given set of pieces, an anti-slide puzzle asks us to arrange the pieces so that none of the pieces can slide. In t... [more] COMP2020-13
pp.10-17
COMP 2020-10-23
15:05
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
The odd depth tree problem
Hiroshi Nishiyama (Kyushu Univ.) COMP2020-14
 [more] COMP2020-14
pp.18-25
COMP 2020-10-23
15:40
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Optimal online packet scheduling for 2-bounded delay buffer management with lookahead
Koji M. Kobayashi (UT) COMP2020-15
The bounded delay buffer management problem proposed by Kesselman et~al. (STOC 2001 and SIAM Journal on Computing 33(3),... [more] COMP2020-15
pp.26-32
COMP 2020-10-23
16:30
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
Kazuaki Yamazaki, Qian Mengze, Ryuhei Uehara (JAIST) COMP2020-16
 [more] COMP2020-16
pp.33-38
COMP 2020-10-23
17:05
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Polynomial Delay Enumeration for Steiner Problems
Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) COMP2020-17
Let $G = (V, E)$ be a undirected graph and let $W subseteq V$ be a set of terminals. A emph{Steiner subgraph} of $(G, W)... [more] COMP2020-17
pp.39-46
 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