| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2021)
Search Results: Keywords 'from:2021-05-07 to:2021-05-07'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2021-05-07 14:50 |
Online | Online | On Learning from Average-Case Errorless Computing Mikito Nanashima (Tokyo Tech)  COMP2021-1 |
[more] | COMP2021-1 pp.1-8 |
| COMP, IPSJ-AL | 2021-05-07 15:20 |
Online | Online | An Improvement of the Biased-PPSZ Algorithm for the 3SAT Problem Osamu Watanabe, Tong Qin (Tokyo Tech) COMP2021-2 |
Hansen, Kaplan, Zamir and Zwick (STOC 2019) introduced a systematic way to use ``bias'' for predicting an assignment to... [more] |
COMP2021-2 pp.9-16 |
| COMP, IPSJ-AL | 2021-05-07 16:40 |
Online | Online | Exploration of dynamic graphs by the minimum number of agents Shunsuke Iitsuka (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-3 |
We consider the collaborative exploration of dynamic graphs by multiple agents, where dynamic graphs are defined as the ... [more] | COMP2021-3 pp.17-22 |
| COMP, IPSJ-AL | 2021-05-07 17:10 |
Online | Online | A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-4 |
We consider the 1-minimal independent dominating set (1-MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] | COMP2021-4 pp.23-30 |
| COMP, IPSJ-AL | 2021-05-08 10:30 |
Online | Online | Procedures to Receive Linguistic Information (2)
-- The Importance of Low Noise Emvironment -- Kumon Tokumaru (Writer) COMP2021-5 |
Search engines enable us to obtain “voluminous linguistic information with uncertain reliability”. With it, we can enhan... [more] | COMP2021-5 pp.31-38 |
| COMP, IPSJ-AL | 2021-05-08 11:00 |
Online | Online | An Extension of Cartesian Tree Matching Based-on Subsequences Takeshi Kai, Kenta Mitsuyoshi, Isamu Furuya, Hiroki Arimura (Hokkaido Univ.) COMP2021-6 |
In this paper, we consider the Cartesian tree matching problem, originally introduced by Park et al. in 2019. Despite of... [more] | COMP2021-6 pp.39-45 |
| COMP, IPSJ-AL | 2021-05-08 11:30 |
Online | Online | Experimental analysis of a classical algorithm spoofing linear cross-entropy benchmarking Kensuke Suzuki, Akinori Kawachi (Mie Univ.) COMP2021-7 |
Quantum computers are expected to be exponentially faster than classical computers in a specific computational task (qua... [more] | COMP2021-7 pp.46-53 |
| COMP, IPSJ-AL | 2021-05-08 13:30 |
Online | Online | [Invited Talk]
Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shin-ichi Minato (Kyoto Univ.) COMP2021-8 |
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] | COMP2021-8 p.54 |
[Return to Top Page]