IEICE Technical Committee Submission System
Advance Program
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 

===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
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.)

DATE:
Fri, Oct 25, 2019 10:00 - 17:00

PLACE:


TOPICS:


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

----- 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.)

----- 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.)

----- 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
(See Japanese page.)

(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)

# Information for speakers
General Talk will have 20 minutes for presentation and 5 minutes for discussion.


=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:

Fri, Dec 13, 2019: Ikaho Seminar House, Gunma University [Thu, Oct 10]

# SECRETARY:
Yota Otachi
Faculty of Advanced Science and Technology, Kumamoto University
Address: 2-39-1 Kurokami, Chuo-ku, Kumamoto, 860-8555, Japan
E-mail: otachi@cs.kumamoto-u.ac.jp


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.
 

[On-Site Price List of Paper Version of Proceedings (Technical Report)] (in Japanese)
 
[Presentation and Participation FAQ] (in Japanese)
 
[Cover and Index of IEICE Technical Report by Issue]
 

[Return to COMP Schedule Page]   /  
 
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [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