IEICE Technical Report

Online edition: ISSN 2432-6380

Volume 119, Number 340

Theoretical Foundations of Computing

Workshop Date : 2019-12-13 / Issue Date : 2019-12-06

[PREV] [NEXT]

[TOP] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2019-29
(See Japanese page.)
pp. 1 - 7

COMP2019-30
A Self-Stabilizing 1-maximal Independent Set Algorithm
Hideyuki Tanaka, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.), Ajoy K. Datta (UNLV)
pp. 9 - 16

COMP2019-31
Self-stabilizing graph exploration by a mobile agent with fast recovery from edge deletions
Yuki Hara, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.)
pp. 17 - 24

COMP2019-32
A Note on a Latch/Flip-flop Mixed High-level Synthesis
Keisuke Inoue (ICT)
pp. 25 - 30

COMP2019-33
An exact string matching algorithm based on the distances of q-gram occurrences
Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara (Tohoku Univ.)
pp. 31 - 38

COMP2019-34
Computational complexity of satisfiability problem with exact number of solutions
Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.)
pp. 39 - 43

COMP2019-35
[Invited Talk] Spectral Sparsification of Hypergraphs
Tasuku Soma (The Univ. of Tokyo), Yuichi Yoshida (NII)
p. 45

COMP2019-36
Computational Complexity of Relaxed Optimal Rule Ordering
Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.)
pp. 47 - 54

COMP2019-37
On a formula for Boolean expressions of Conjunctive normal form and computational complexity
Tomoya Machide (NII)
pp. 55 - 59

COMP2019-38
On Ambiguous Reasoning of Multiple Input Variables Combination by Utilizing Additive Results
Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.)
pp. 61 - 68

COMP2019-39
Reduction of number of signals on controlling reaction systems
Ryutaro Yako, Satoshi Kobayashi (UEC)
pp. 69 - 76

COMP2019-40
Improvement of complexity of control system of Regular Grammars with Unknown Behaviors
Nobuya Kimoto, Satoshi Kobayashi (UEC)
pp. 77 - 84

COMP2019-41
Limited Deterministic Automata and Pumping Lemma
Kosei Yoshida, Tomoyuki Yamakami (U of Fukui)
pp. 85 - 92

COMP2019-42
(See Japanese page.)
pp. 93 - 100

COMP2019-43
The Analysis of Anti-slide
Kento Kimura, Kazuyuki Amano, Tetsuya Araki (Gunma Univ.)
pp. 101 - 107

COMP2019-44
Depth Two Majority Circuits for Majority
Yasuhiro Ojima, Takuya Yokokawa, Kazuyuki Amano (Gunma Univ.)
pp. 109 - 115

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan