| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2018)
Search Results: Keywords 'from:2019-03-18 to:2019-03-18'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2019-03-18 09:30 |
Tokyo | The University of Tokyo | Range Mode Query and Solution Enumeration Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo)  COMP2018-43 |
The range mode query problem is constructing a data structure from the given array of $n$ terms which can efficiently an... [more] | COMP2018-43 pp.1-8 |
| COMP | 2019-03-18 09:55 |
Tokyo | The University of Tokyo | * Sumiko Harasawa, Ryuhei Uehara (JAIST) COMP2018-44 |
(To be available after the conference date) [more] | COMP2018-44 pp.9-16 |
| COMP | 2019-03-18 10:15 |
Tokyo | The University of Tokyo | Implementation of Enumeration Algorithm of Connected Bipartite Permutation Graphs Shinichi Ikeda, Ryuhei Uehara (JAIST) COMP2018-45 |
[more] | COMP2018-45 pp.17-23 |
| COMP | 2019-03-18 10:45 |
Tokyo | The University of Tokyo | COMP2018-46 |
The problem of Hamiltonian path between specified vertices is one of the classic NP-complete problems. It is also known ... [more] | COMP2018-46 pp.25-31 |
| COMP | 2019-03-18 11:10 |
Tokyo | The University of Tokyo | A GPU-based Non-commutative Reduction and Its Applications to Operations for Difference Arrays Atsushi Koike (NIT Ichinoseki), Kunihiko Sadakane (UTokyo) COMP2018-47 |
Reduction is basic operation in parallel computing.It is generalization of summation, in which we can use any associativ... [more] | COMP2018-47 pp.33-40 |
| COMP | 2019-03-18 11:45 |
Tokyo | The University of Tokyo | [Invited Talk]
The Diameter of Dense Random Regular Graphs Nobutaka Shimizu (Univ. Tokyo/RIKEN AIP) COMP2018-48 |
For fixed $n$ and $d$, we consider a graph with minimum diameter among all $d$-regular graphs on $n$ vertices. This p... [more] |
COMP2018-48 p.41 |
| COMP | 2019-03-18 13:45 |
Tokyo | The University of Tokyo | [Invited Talk]
Non-Black-Box Worst-Case to Average-Case Reductions within NP Shuichi Hirahara (Univ. Tokyo) COMP2018-49 |
There are significant obstacles to establishing an equivalence between the worst-case and average-case hardness of NP: S... [more] | COMP2018-49 p.43 |
| COMP | 2019-03-18 15:00 |
Tokyo | The University of Tokyo | [Invited Talk]
Cheeger Inequalities for Submodular Transformations Yuichi Yoshida (NII) COMP2018-50 |
The Cheeger inequality for undirected graphs, which relates the conductance of an undirected graph and the second smalle... [more] | COMP2018-50 p.45 |
| COMP | 2019-03-18 16:15 |
Tokyo | The University of Tokyo | Move-optimal Randomized Partial Gathering of Anonymous Mobile Agents in Anonymous Unidirectional Rings Norikazu Kawata (Osaka Univ.), Masahiro Shibata (KIT), Yuichi Sudo (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-51 |
(To be available after the conference date) [more] | COMP2018-51 pp.47-54 |
| COMP | 2019-03-18 16:40 |
Tokyo | The University of Tokyo | On a Gathering by Seven Autonomous Mobile Robots in 2D Triangular Grid Plane Masaki Oyabu, Yonghwan Kim, Yoshiaki Katayama (NIT) COMP2018-52 |
In this paper, we propose a distributed algorithm to solve a gathering problem for autonomous mobile robots in a triangu... [more] | COMP2018-52 pp.55-62 |
| COMP | 2019-03-18 17:05 |
Tokyo | The University of Tokyo | On an Algorithm for Constructing a Strongly-Connected (2,2)-Directed Acyclic Graph in Biconnected Undirected Graph Hiroki Aono, Yonghwan Kim, Yoshiaki Katayama (NIT) COMP2018-53 |
($s,t$)-DAG is an directed acyclic graph(DAG) that can be constructed by directing all edges on given biconnected undire... [more] | COMP2018-53 pp.63-70 |
| COMP | 2019-03-18 17:30 |
Tokyo | The University of Tokyo | Lower Bounds and Satisfiability Algorithms for Bounded Width Circuits Hiroki Morizumi (Shimane Univ.) |
[more] | |
[Return to Top Page]