|
|
| 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, Oct 25, 2019 10:00 - 17:00 |
| Topics |
|
| Conference Place |
|
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, Oct 25 AM
10:00 - 17:00 |
| (1) |
10:00-10:25 |
Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams  COMP2019-18 |
Ryosuke Takizawa, Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Ichigaku Takigawa (RIKEN) |
| (2) |
10:25-10:50 |
Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number COMP2019-19 |
Kazuhiro Kurita (Hokkaido Univ.), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (Hokkaido Univ.) |
| (3) |
10:50-11:15 |
Simple Fold and Cut Problem for Line Segments COMP2019-20 |
Guoxin Hu (JAIST), Shin-ichi Nakano (Gunma University), Ryuhei Uehara (JAIST), Takeaki Uno (NII) |
| (4) |
11:15-11:40 |
Robustness by simplification of a combinational circuit that constitutes a repetitive transition by using its output as its input COMP2019-21 |
Fuminori Okuya, Yoshihiro Kawahara (UTokyo) |
| |
11:40-13:00 |
Lunch Break ( 80 min. ) |
| (5) |
13:00-14:00 |
[Invited Talk]
Consistent Digital Curved Rays and Pseudoline Arrangements COMP2019-22 |
Takeshi Tokuyama (Kwansei Gakuin Univ.), Jinhee Chun, Kenya Kikuchi (Tohoku Univ.) |
| |
14:00-14:15 |
Break ( 15 min. ) |
| (6) |
14:15-14:40 |
Computational Complexity of Whitelist Constructing COMP2019-23 |
Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.) |
| (7) |
14:40-15:05 |
A Rule Reordering Method via Deleting 0 Weights Rules COMP2019-24 |
Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech.), Tanaka Ken (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) |
| (8) |
15:05-15:30 |
Computational Complexity of Circ1P Problem and its Algorithm COMP2019-25 |
Shogo Takeuchi, Takashi Harada (Kochi Univ. of Tech.) |
| |
15:30-15:45 |
Break ( 15 min. ) |
| (9) |
15:45-16:10 |
Minimal Unique Substrings in a Sliding Window COMP2019-26 |
Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) |
| (10) |
16:10-16:35 |
COMP2019-27 |
|
| (11) |
16:35-17:00 |
Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths COMP2019-28 |
Ryu Hayakawa, Tomoyuki Morimae (YITP, Kyoto Univ.), Suguru Tamaki (School of Social Information Science, Univ. of Hyogo) |
| 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-08-19 18:04:31
|