| 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-12-13 to:2019-12-13'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2019-12-13 09:00 |
Gunma | Ikaho Seminar House, Gunma University |  COMP2019-29 |
The goal of the distributed slicing problem is to partition the nodes of a network into $k$ groups depending on the glo... [more] | COMP2019-29 pp.1-7 |
| COMP | 2019-12-13 09:25 |
Gunma | Ikaho Seminar House, Gunma University | 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) COMP2019-30 |
We consider the 1-maximal independent set (1-MIS) problem: given a connected graph $G=(V,E)$, our goal is to find an 1-m... [more] | COMP2019-30 pp.9-16 |
| COMP | 2019-12-13 09:50 |
Gunma | Ikaho Seminar House, Gunma University | 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.) COMP2019-31 |
[more] | COMP2019-31 pp.17-24 |
| COMP | 2019-12-13 10:25 |
Gunma | Ikaho Seminar House, Gunma University | A Note on a Latch/Flip-flop Mixed High-level Synthesis Keisuke Inoue (ICT) COMP2019-32 |
[more] | COMP2019-32 pp.25-30 |
| COMP | 2019-12-13 10:50 |
Gunma | Ikaho Seminar House, Gunma University | An exact string matching algorithm based on the distances of q-gram occurrences Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara (Tohoku Univ.) COMP2019-33 |
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the exact string matching problem is a task to find all ... [more] | COMP2019-33 pp.31-38 |
| COMP | 2019-12-13 11:15 |
Gunma | Ikaho Seminar House, Gunma University | Computational complexity of satisfiability problem with exact number of solutions Hiromu Horiuchi, Naoyuki Morimoto, Toshiyuki Yamada, Akinori Kawachi (Mie Univ.) COMP2019-34 |
Valiant and Vazirani proved the isolation lemma for SAT to show a polynomial-time randomized reduction from SAT to Uniqu... [more] | COMP2019-34 pp.39-43 |
| COMP | 2019-12-13 13:00 |
Gunma | Ikaho Seminar House, Gunma University | [Invited Talk]
Spectral Sparsification of Hypergraphs Tasuku Soma (The Univ. of Tokyo), Yuichi Yoshida (NII) COMP2019-35 |
For an undirected/directed hypergraph G = (V, E), its Laplacian LG : ℝv → ℝv is defined such that its “quadratic form” x... [more] | COMP2019-35 p.45 |
| COMP | 2019-12-13 14:10 |
Gunma | Ikaho Seminar House, Gunma University | Computational Complexity of Relaxed Optimal Rule Ordering Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-36 |
The packet classification aims to determine the behavior of the incoming packets of network devices. The linear search c... [more] | COMP2019-36 pp.47-54 |
| COMP | 2019-12-13 14:35 |
Gunma | Ikaho Seminar House, Gunma University | On a formula for Boolean expressions of Conjunctive normal form and computational complexity Tomoya Machide (NII) COMP2019-37 |
An Boolean expression in conjunctive normal form, abbreviated as CNF, is used as a canonical normal form in Boolean logi... [more] | COMP2019-37 pp.55-59 |
| COMP | 2019-12-13 15:00 |
Gunma | Ikaho Seminar House, Gunma University | On Ambiguous Reasoning of Multiple Input Variables Combination by Utilizing Additive Results Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) COMP2019-38 |
[more] | COMP2019-38 pp.61-68 |
| COMP | 2019-12-13 15:35 |
Gunma | Ikaho Seminar House, Gunma University | Reduction of number of signals on controlling reaction systems Ryutaro Yako, Satoshi Kobayashi (UEC) COMP2019-39 |
We proposed a mathematical framework in which we can choose arbitrary boolean function to be computed by controlling rea... [more] | COMP2019-39 pp.69-76 |
| COMP | 2019-12-13 16:00 |
Gunma | Ikaho Seminar House, Gunma University | Improvement of complexity of control system of Regular Grammars with Unknown Behaviors Nobuya Kimoto, Satoshi Kobayashi (UEC) COMP2019-40 |
It has been required to construct universal system for generating target DNA nano-structure by controlling it with exter... [more] | COMP2019-40 pp.77-84 |
| COMP | 2019-12-13 16:25 |
Gunma | Ikaho Seminar House, Gunma University | Limited Deterministic Automata and Pumping Lemma Kosei Yoshida, Tomoyuki Yamakami (U of Fukui) COMP2019-41 |
This pape, introduced a pumping lemma for languages recognizable by limited deterministic automata. We use this lemma to... [more] | COMP2019-41 pp.85-92 |
| COMP | 2019-12-13 17:00 |
Gunma | Ikaho Seminar House, Gunma University | COMP2019-42 |
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] | COMP2019-42 pp.93-100 |
| COMP | 2019-12-13 17:25 |
Gunma | Ikaho Seminar House, Gunma University | The Analysis of Anti-slide Kento Kimura, Kazuyuki Amano, Tetsuya Araki (Gunma Univ.) COMP2019-43 |
Let $n$ be a positive integer. Given an $ntimes ntimes n$ box and a number of pieces of some specified shape, we consi... [more] |
COMP2019-43 pp.101-107 |
| COMP | 2019-12-13 17:50 |
Gunma | Ikaho Seminar House, Gunma University | Depth Two Majority Circuits for Majority Yasuhiro Ojima, Takuya Yokokawa, Kazuyuki Amano (Gunma Univ.) COMP2019-44 |
Let $MAJ_n$ denote the Boolean majority function of $n$ input variables. In this paper, we study the construction of de... [more] |
COMP2019-44 pp.109-115 |
[Return to Top Page]