Information and Systems-Theoretical Foundations of Computing(Date:2019/10/25)

Presentation
Minimal Unique Substrings in a Sliding Window

Takuya Mieno(Kyushu Univ.),  Yuto Nakashima(Kyushu Univ.),  Shunsuke Inenaga(Kyushu Univ.),  Hideo Bannai(Kyushu Univ.),  Masayuki Takeda(Kyushu Univ.),  

[Date]2019-10-25
[Paper #]COMP2019-26
Simple Fold and Cut Problem for Line Segments

Guoxin Hu(JAIST),  Shin-ichi Nakano(Gunma University),  Ryuhei Uehara(JAIST),  Takeaki Uno(NII),  

[Date]2019-10-25
[Paper #]COMP2019-20
Computational Complexity of Circ1P Problem and its Algorithm

Shogo Takeuchi(Kochi Univ. of Tech.),  Takashi Harada(Kochi Univ. of Tech.),  

[Date]2019-10-25
[Paper #]COMP2019-25
Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths

Ryu Hayakawa(YITP, Kyoto Univ.),  Tomoyuki Morimae(YITP, Kyoto Univ.),  Suguru Tamaki(School of Social Information Science, Univ. of Hyogo),  

[Date]2019-10-25
[Paper #]COMP2019-28
Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams

Ryosuke Takizawa(Hokkaido Univ.),  Takuya Kida(Hokkaido Univ.),  Hiroki Arimura(Hokkaido Univ.),  Ichigaku Takigawa(RIKEN),  

[Date]2019-10-25
[Paper #]COMP2019-18
[Invited Talk] Consistent Digital Curved Rays and Pseudoline Arrangements

Jinhee Chun(Tohoku Univ.),  Kenya Kikuchi(Tohoku Univ.),  Takeshi Tokuyama(Kwansei Gakuin Univ.),  

[Date]2019-10-25
[Paper #]COMP2019-22
Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number

Kazuhiro Kurita(Hokkaido Univ.),  Kunihiro Wasa(NII),  Hiroki Arimura(Hokkaido Univ.),  Takeaki Uno(NII),  

[Date]2019-10-25
[Paper #]COMP2019-19
Computational Complexity of Whitelist Constructing

Takashi Harada(Kochi Univ. of Tech.),  Ken Tanaka(Kanagawa Univ.),  

[Date]2019-10-25
[Paper #]COMP2019-23
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem

Yasuaki Kobayashi(Kyoto Univ.),  Kensuke Kojima(Kyoto Univ.),  Norihide Matsubara(Kyoto Univ.),  Taiga Sone(Kyoto Univ.),  Akihiro Yamamoto(Kyoto Univ.),  

[Date]2019-10-25
[Paper #]COMP2019-27
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.),  

[Date]2019-10-25
[Paper #]COMP2019-24
Robustness by simplification of a combinational circuit that constitutes a repetitive transition by using its output as its input

Fuminori Okuya(UTokyo),  Yoshihiro Kawahara(UTokyo),  

[Date]2019-10-25
[Paper #]COMP2019-21