IEICE Technical Committee Submission System
Advance Program
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top  Go Back   / [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


Technical Committee on Theoretical Foundations of Computing (COMP) [schedule] [select]
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  
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 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 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 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 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
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 Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.)
(7) 14:40-15:05 A Rule Reordering Method via Deleting 0 Weights Rules 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 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 Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
(10) 16:10-16:35
(11) 16:35-17:00 Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths Ryu Hayakawa, Tomoyuki Morimae (YITP, Kyoto Univ.), Suguru Tamaki (School of Social Information Science, Univ. of Hyogo)

Announcement for Speakers
General TalkEach 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--mail: o-u 


Last modified: 2019-08-19 18:04:31


Notification: Mail addresses are partially hidden against SPAM.

[Download Paper's Information (in Japanese)] <-- Press download button after click here.
 
[Cover and Index of IEICE Technical Report by Issue]
 

[Presentation and Participation FAQ] (in Japanese)
 

[Return to COMP Schedule Page]   /  
 
 Go Top  Go Back   / [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


[Return to Top Page]

[Return to IEICE Web Page]


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