| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2024)
Search Results: Keywords 'from:2024-05-08 to:2024-05-08'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2024-05-08 13:20 |
Kyoto | Kyoto University (Rakuyu-kaikan) | [Invited Talk]
Exploring Symbols and Discrete Structures Through Statistical Machine Learning Ichigaku Takigawa (Kyot Univ.)  COMP2024-1 |
[more] | COMP2024-1 p.1 |
| COMP, IPSJ-AL | 2024-05-08 14:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Physical Bucket Sort on Two Kind of Items Hitomi Kozaki, Atsuki Nagao (Ochanomizu Univ.) COMP2024-2 |
When physically emulating the bucket sort, it would be care that some costs are incurred when placing items into buckets... [more] | COMP2024-2 pp.2-6 |
| COMP, IPSJ-AL | 2024-05-08 15:05 |
Kyoto | Kyoto University (Rakuyu-kaikan) | An Algorithm for Finding the Condorcet Winner Die Ro Sho, Hatano Kohei (Kyushu Univ.), Kijima Shuji (Shiga Univ.), Takimoto Eiji (Kyushu Univ.) COMP2024-3 |
In general, a set of dice is intransitive, e.g., Efron’s dice. This paper investigates to find the strongest die under a... [more] | COMP2024-3 pp.7-8 |
| COMP, IPSJ-AL | 2024-05-09 10:45 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Depth-Three Circuits for Inner Product and Majority Functions Kazuyuki Amano (Gunma Univ.) COMP2024-4 |
A $Sigma_3^k$-circuit is a depth-three OR $circ$ AND $circ$ OR circuit in which each bottom gate has fan-in at most $k$.... [more] | COMP2024-4 p.9 |
| COMP, IPSJ-AL | 2024-05-09 11:05 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models Takashi Horiyama, Yasuaki Kobayashi (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Kazuhisa Seto, Ryu Suzuki (Hokkaido Univ.) COMP2024-5 |
Given an instance of combinatorial optimization problem $mathcal{A}$ with multiple optimal solutions, how can we efficie... [more] | COMP2024-5 pp.10-13 |
| COMP, IPSJ-AL | 2024-05-09 11:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Online Exploration of Rectilinear Polygons by Multiple Searchers Taro Abe, Yuya Higashikawa, Shuichi Miyazaki (Univ. of Hyogo) COMP2024-6 |
In this paper, we consider efficient exploration of unknown simple rectilinear polygons by multiple searchers. Searchers... [more] | COMP2024-6 pp.14-19 |
| COMP, IPSJ-AL | 2024-05-09 13:30 |
Kyoto | Kyoto University (Rakuyu-kaikan) | [Fellow Memorial Lecture]
Un chat pensant Hiro Ito (UEC) COMP2024-7 |
[more] | COMP2024-7 p.20 |
| COMP, IPSJ-AL | 2024-05-09 14:45 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Finding Blocking on ZDD with Hitting Set Takashi Harada, Shogo Takeuchi (Kochi Univ. of Tech.) COMP2024-8 |
[more] | COMP2024-8 pp.21-25 |
| COMP, IPSJ-AL | 2024-05-09 15:15 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Generating Signatures of a 2-CNF Shitora Kato, Kunihiro Wasa (Hosei Univ.) COMP2024-9 |
[more] | COMP2024-9 pp.26-30 |
[Return to Top Page]