|
|
| Chair |
|
Toshihiro Fujito (Toyohashi Univ. of Tech.) |
| Vice Chair |
|
Shinichi Nakano (Gunma Univ.) |
| Secretary |
|
Yota Otachi (Kumamoto Univ), Suguru Tamaki (Univ. of Hyogo) |
| Assistant |
|
Kazuhisa Seto (Seikei Univ.) |
|
| Conference Date |
Fri, Dec 13, 2019 09:00 - 18:10 |
| Topics |
|
| Conference Place |
Ikaho-kenshujo, Gunma University |
| Address |
Ikaho 14-1, Ikaho-machi, Shibukawa-shi, Gunma, 377-0102 Japan |
| Transportation Guide |
http://www.nakano-lab.cs.gunma-u.ac.jp/~nakano/Ikaho1912/ |
Contact
Person |
Shin-ichi Nakano |
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) |
| Registration Fee |
This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on COMP. |
Fri, Dec 13
09:00 - 18:10 |
| (1) |
09:00-09:25 |
 COMP2019-29 |
|
| (2) |
09:25-09:50 |
A Self-Stabilizing 1-maximal Independent Set Algorithm COMP2019-30 |
Hideyuki Tanaka, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.), Ajoy K. Datta (UNLV) |
| (3) |
09:50-10:15 |
Self-stabilizing graph exploration by a mobile agent with fast recovery from edge deletions COMP2019-31 |
Yuki Hara, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.) |
| |
10:15-10:25 |
Break ( 10 min. ) |
| (4) |
10:25-10:50 |
A Note on a Latch/Flip-flop Mixed High-level Synthesis COMP2019-32 |
Keisuke Inoue (ICT) |
| (5) |
10:50-11:15 |
An exact string matching algorithm based on the distances of q-gram occurrences COMP2019-33 |
Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara (Tohoku Univ.) |
| (6) |
11:15-11:40 |
Computational complexity of satisfiability problem with exact number of solutions COMP2019-34 |
Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.) |
| |
11:40-13:00 |
Lunch ( 80 min. ) |
| (7) |
13:00-14:00 |
[Invited Talk]
Spectral Sparsification of Hypergraphs COMP2019-35 |
Tasuku Soma (The Univ. of Tokyo), Yuichi Yoshida (NII) |
| |
14:00-14:10 |
Break ( 10 min. ) |
| (8) |
14:10-14:35 |
Computational Complexity of Relaxed Optimal Rule Ordering COMP2019-36 |
Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) |
| (9) |
14:35-15:00 |
On a formula for Boolean expressions of Conjunctive normal form and computational complexity COMP2019-37 |
Tomoya Machide (NII) |
| (10) |
15:00-15:25 |
On Ambiguous Reasoning of Multiple Input Variables Combination by Utilizing Additive Results COMP2019-38 |
Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) |
| |
15:25-15:35 |
Break ( 10 min. ) |
| (11) |
15:35-16:00 |
Reduction of number of signals on controlling reaction systems COMP2019-39 |
Ryutaro Yako, Satoshi Kobayashi (UEC) |
| (12) |
16:00-16:25 |
Improvement of complexity of control system of Regular Grammars with Unknown Behaviors COMP2019-40 |
Nobuya Kimoto, Satoshi Kobayashi (UEC) |
| (13) |
16:25-16:50 |
Limited Deterministic Automata and Pumping Lemma COMP2019-41 |
Kosei Yoshida, Tomoyuki Yamakami (U of Fukui) |
| |
16:50-17:00 |
Break ( 10 min. ) |
| (14) |
17:00-17:25 |
COMP2019-42 |
|
| (15) |
17:25-17:50 |
The Analysis of Anti-slide COMP2019-43 |
Kento Kimura, Kazuyuki Amano, Tetsuya Araki (Gunma Univ.) |
| (16) |
17:50-18:10 |
Depth Two Majority Circuits for Majority COMP2019-44 |
Yasuhiro Ojima, Takuya Yokokawa, Kazuyuki Amano (Gunma Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 20 minutes for presentation and 5 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Yota Otachi
Faculty of Advanced Science and Technology, Kumamoto University
Address: 2-39-1 Kurokami, Chuo-ku, Kumamoto, 860-8555, Japan
E- : o         -u |
Last modified: 2019-11-14 10:49:42
|