Online edition: ISSN 2432-6380
[TOP] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [Japanese] / [English]
COMP2019-18
Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams
Ryosuke Takizawa, Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Ichigaku Takigawa (RIKEN)
pp. 1 - 10
COMP2019-19
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.)
pp. 11 - 18
COMP2019-20
Simple Fold and Cut Problem for Line Segments
Guoxin Hu (JAIST), Shin-ichi Nakano (Gunma University), Ryuhei Uehara (JAIST), Takeaki Uno (NII)
pp. 19 - 25
COMP2019-21
Robustness by simplification of a combinational circuit that constitutes a repetitive transition by using its output as its input
Fuminori Okuya, Yoshihiro Kawahara (UTokyo)
pp. 27 - 34
COMP2019-22
[Invited Talk]
Consistent Digital Curved Rays and Pseudoline Arrangements
Takeshi Tokuyama (Kwansei Gakuin Univ.), Jinhee Chun, Kenya Kikuchi (Tohoku Univ.)
pp. 35 - 37
COMP2019-23
Computational Complexity of Whitelist Constructing
Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.)
pp. 39 - 46
COMP2019-24
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.)
pp. 47 - 52
COMP2019-25
Computational Complexity of Circ1P Problem and its Algorithm
Shogo Takeuchi, Takashi Harada (Kochi Univ. of Tech.)
pp. 53 - 56
COMP2019-26
Minimal Unique Substrings in a Sliding Window
Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
pp. 57 - 62
COMP2019-27
(See Japanese page.)
pp. 63 - 70
COMP2019-28
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)
pp. 71 - 78
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.