| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2019)
Search Results: Keywords 'from:2019-10-25 to:2019-10-25'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2019-10-25 10:00 |
Hokkaido | Sapporo Campus, Hokkaido University | Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams Ryosuke Takizawa, Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Ichigaku Takigawa (RIKEN)  COMP2019-18 |
[more] | COMP2019-18 pp.1-10 |
| COMP | 2019-10-25 10:25 |
Hokkaido | Sapporo Campus, Hokkaido University | 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.) COMP2019-19 |
(To be available after the conference date) [more] | COMP2019-19 pp.11-18 |
| COMP | 2019-10-25 10:50 |
Hokkaido | Sapporo Campus, Hokkaido University | Simple Fold and Cut Problem for Line Segments Guoxin Hu (JAIST), Shin-ichi Nakano (Gunma University), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2019-20 |
We investigate a natural variant of the fold-and-cut problem. We are given a long paper strip P and n line segments draw... [more] | COMP2019-20 pp.19-25 |
| COMP | 2019-10-25 11:15 |
Hokkaido | Sapporo Campus, Hokkaido University | Robustness by simplification of a combinational circuit that constitutes a repetitive transition by using its output as its input Fuminori Okuya, Yoshihiro Kawahara (UTokyo) COMP2019-21 |
[more] | COMP2019-21 pp.27-34 |
| COMP | 2019-10-25 13:00 |
Hokkaido | Sapporo Campus, Hokkaido University | [Invited Talk]
Consistent Digital Curved Rays and Pseudoline Arrangements Takeshi Tokuyama (Kwansei Gakuin Univ.), Jinhee Chun, Kenya Kikuchi (Tohoku Univ.) COMP2019-22 |
[more] | COMP2019-22 pp.35-37 |
| COMP | 2019-10-25 14:15 |
Hokkaido | Sapporo Campus, Hokkaido University | Computational Complexity of Whitelist Constructing Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.) COMP2019-23 |
Packet classification is to classify packets arriving a network equipment according to the classification policy. It is ... [more] | COMP2019-23 pp.39-46 |
| COMP | 2019-10-25 14:40 |
Hokkaido | Sapporo Campus, Hokkaido University | 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.) COMP2019-24 |
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] | COMP2019-24 pp.47-52 |
| COMP | 2019-10-25 15:05 |
Hokkaido | Sapporo Campus, Hokkaido University | Computational Complexity of Circ1P Problem and its Algorithm Shogo Takeuchi, Takashi Harada (Kochi Univ. of Tech.) COMP2019-25 |
0-1 matrix satisfies Circular Ones Property (Circ1P) when 1 or 0 in each row can be continued by reordering the columns ... [more] | COMP2019-25 pp.53-56 |
| COMP | 2019-10-25 15:45 |
Hokkaido | Sapporo Campus, Hokkaido University | Minimal Unique Substrings in a Sliding Window Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2019-26 |
A substring $u$ of a string $T$ is called a minimal unique substring (MUS) of $T$ if $u$ occurs exactly once in $T$ and ... [more] | COMP2019-26 pp.57-62 |
| COMP | 2019-10-25 16:10 |
Hokkaido | Sapporo Campus, Hokkaido University | COMP2019-27 |
[more] | COMP2019-27 pp.63-70 |
| COMP | 2019-10-25 16:35 |
Hokkaido | Sapporo Campus, Hokkaido University | 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) COMP2019-28 |
Fine-grained quantum supremacy is a study of excluding possibilities of superpolynomial time classical simulations of qu... [more] | COMP2019-28 pp.71-78 |
[Return to Top Page]