| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| 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.) |
(To be available after the conference date) [more] | |
| COMP | 2022-10-26 11:15 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs Tomu Makita (Seikei Univ.), Atsuki Nagao (Ochanomizu Univ.), Tatsuki Okada (Seikei Univ.), Kazuhisa Seto (Hokkaido Univ.), Junichi Teruyama (Univ. of Hyogo)  COMP2022-14 |
[more] | COMP2022-14 pp.2-6 |
| COMP | 2018-10-26 11:15 |
Kyoto | Kyoto University | Atsuki Nagao (Ochanomizu Univ.), Sora Matsuzaki, Etsuji Tomita, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2018-23 |
We enhance MCT (an algorithm for the maximum clique problem; presented by authors in FAW 2016, LNCS 9711, pp.215-226, 20... [more] | COMP2018-23 pp.17-24 |
| ISEC, COMP | 2017-12-22 15:05 |
Kochi | Eikokuji Campus, Kochi University of Technology | Physical Bucket Sort with Restricted take Operations Atsuki Nagao, Wei Wu (Seikei Univ.), Hiro Ito (UEC) ISEC2017-90 COMP2017-44 |
[more] | ISEC2017-90 COMP2017-44 pp.119-122 |
| COMP | 2017-08-18 16:30 |
Aomori | K_3 edge cover problem in a wide sense Kyohei Chiba, Remy Belmonte, Hiro Ito (UEC), Atsuki Nagao (Seikei Univ.) COMP2017-19 |
[more] | COMP2017-19 pp.47-55 |
|
| COMP | 2016-10-21 13:30 |
Miyagi | Tohoku University | Physical Bucket Sort with Two Kinds of Items Atsuki Nagao, Shuhei Yoshizawa, Hiro Ito (UEC) COMP2016-26 |
Bucket sort is one of the most famous sorting algorithms, and it runs in time $O(k+n)$, where $k$ is the number of bucke... [more] | COMP2016-26 pp.23-27 |
| COMP | 2016-04-22 14:30 |
Nara | Physical Bucket Sort John Iacono (NY Univ.), Hiro Ito, Atsuki Nagao, Junji Nishino (UEC), David Rappaport (Queen's Univ.) COMP2016-5 |
Bucket sort is one of the most famous sorting algorithm, which runs in O(k + n)-time where k is the number of buckets an... [more] | COMP2016-5 pp.29-34 |
|
| COMP | 2013-12-21 11:25 |
Okinawa | Okinawa Industry Support Center | Efficient Algorithms for Sorting $k$-Sets in Bins Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.) COMP2013-52 |
We give efficient algorithms for Sorting $k$-Sets in Bins. The Sorting $k$-Sets in Bins problem can be described as f... [more] |
COMP2013-52 pp.81-85 |
| AI | 2010-02-23 10:00 |
Kyoto | Kyoto Univ. Yoshida Campus | Development of Multilingual BBS with Contents Pointer Masanobu Ishimatsu, Toshiyuki Takasaki, Atsuki Nagao, Toru Ishida (Kyoto Univ.) AI2009-34 |
Communities using machine translation mediated communication tools sometimes experience difficulties in specifying the c... [more] | AI2009-34 pp.25-30 |
[Return to Top Page]