Information and Systems-Theoretical Foundations of Computing(Date:2019/12/13)

Presentation
Computational Complexity of Relaxed Optimal Rule Ordering

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

[Date]2019-12-13
[Paper #]COMP2019-36
On a formula for Boolean expressions of Conjunctive normal form and computational complexity

Tomoya Machide(NII),  

[Date]2019-12-13
[Paper #]COMP2019-37
A Note on a Latch/Flip-flop Mixed High-level Synthesis

Keisuke Inoue(ICT),  

[Date]2019-12-13
[Paper #]COMP2019-32
Reduction of number of signals on controlling reaction systems

Ryutaro Yako(UEC),  Satoshi Kobayashi(UEC),  

[Date]2019-12-13
[Paper #]COMP2019-39
Improvement of complexity of control system of Regular Grammars with Unknown Behaviors

Nobuya Kimoto(UEC),  Satoshi Kobayashi(UEC),  

[Date]2019-12-13
[Paper #]COMP2019-40
[Invited Talk] Spectral Sparsification of Hypergraphs

Tasuku Soma(The Univ. of Tokyo),  Yuichi Yoshida(NII),  

[Date]2019-12-13
[Paper #]COMP2019-35
分散スライシングを実現する省メモリ適応型プロトコル

,  ,  ,  ,  

[Date]2019-12-13
[Paper #]COMP2019-29
A Self-Stabilizing 1-maximal Independent Set Algorithm

Hideyuki Tanaka(Osaka Univ.),  Yuichi Sudo(Osaka Univ.),  Hirotsugu Kakugawa(Ryukoku Univ.),  Toshimitsu Masuzawa(Osaka Univ.),  Ajoy K. Datta(UNLV),  

[Date]2019-12-13
[Paper #]COMP2019-30
Self-stabilizing graph exploration by a mobile agent with fast recovery from edge deletions

Yuki Hara(Osaka Univ.),  Yuichi Sudo(Osaka Univ.),  Hirotsugu Kakugawa(Ryukoku Univ.),  Toshimitsu Masuzawa(Osaka Univ.),  

[Date]2019-12-13
[Paper #]COMP2019-31
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles

Takehiro Ito(Tohoku Univ),  Naonori Kakimura(Keio Univ),  Naoyuki Kamiyama(Kyushu Univ, JST PRESTO),  Yusuke Kobayashi(Kyoto Univ),  Yoshio Okamoto(UEC, RIKEN AIP),  

[Date]2019-12-13
[Paper #]COMP2019-42
An exact string matching algorithm based on the distances of q-gram occurrences

Satoshi Kobayashi(Tohoku Univ.),  Diptarama Hendrian(Tohoku Univ.),  Ryo Yoshinaka(Tohoku Univ.),  Ayumi Shinohara(Tohoku Univ.),  

[Date]2019-12-13
[Paper #]COMP2019-33
Depth Two Majority Circuits for Majority

Yasuhiro Ojima(Gunma Univ.),  Takuya Yokokawa(Gunma Univ.),  Kazuyuki Amano(Gunma Univ.),  

[Date]2019-12-13
[Paper #]COMP2019-44
The Analysis of Anti-slide

Kento Kimura(Gunma Univ.),  Kazuyuki Amano(Gunma Univ.),  Tetsuya Araki(Gunma Univ.),  

[Date]2019-12-13
[Paper #]COMP2019-43
Limited Deterministic Automata and Pumping Lemma

Kosei Yoshida(U of Fukui),  Tomoyuki Yamakami(U of Fukui),  

[Date]2019-12-13
[Paper #]COMP2019-41
Computational complexity of satisfiability problem with exact number of solutions

Hiromu Horiuchi(Mie Univ.),  Naoyuki Morimoto(Mie Univ.),  Toshiyuki Yamada(Mie Univ.),  Akinori Kawachi(Mie Univ.),  

[Date]2019-12-13
[Paper #]COMP2019-34
On Ambiguous Reasoning of Multiple Input Variables Combination by Utilizing Additive Results

Yoko Kamidoi(Hiroshima City Univ.),  Shin'ichi Wakabayashi(Hiroshima City Univ.),  

[Date]2019-12-13
[Paper #]COMP2019-38