| 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 | 2012-04-27 10:35 |
Osaka | Osaka Prefecture University (Osaka) | Reconstructing Strings from Substrings with Quantum Queries Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.)  COMP2012-2 |
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string fro... [more] |
COMP2012-2 pp.7-14 |
| COMP | 2010-04-22 11:10 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus (Shiga) | Averaging Techniques for Competitive Auctions Takayuki Ichiba (Nomura Research Institute), Kazuo Iwama (Kyoto Univ.) COMP2010-3 |
[more] | COMP2010-3 pp.17-24 |
| COMP | 2009-10-16 15:25 |
Miyagi | Tohoku University (Miyagi) | An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2009-37 |
In the stable marriage problem that allows incomplete preference lists, all stable matchings for a given instance have ... [more] |
COMP2009-37 pp.35-40 |
| COMP | 2009-05-26 11:15 |
Saitama | Saitama Univ. (Saitama) | Designing Quantum Game Strategies from Quantum Communication Protocols Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Pref. Univ.), Rudy Raymond (IBM Japan) COMP2009-12 |
In their recent paper, Cleve , Slofstra, Unger and Upadhyay showed that the $CHSH^{\oplus{n}}$, a natural extension of t... [more] | COMP2009-12 pp.21-28 |
| COMP | 2008-03-10 09:30 |
Kanagawa | (Kanagawa) | Approximation Algorithms for the Sex-Equal Stable Marriage Problem Hiroki Yanagisawa (IBM), Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2007-55 |
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any i... [more] |
COMP2007-55 pp.1-8 |
| COMP | 2007-10-16 10:40 |
Miyagi | Tohoku Univ. (Miyagi) | NP-Completeness of the Stable Roommates Problem with Triple Rooms Kazuya Okamoto, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2007-41 |
[more] | COMP2007-41 pp.1-6 |
| COMP | 2007-09-20 15:15 |
Aichi | (Aichi) | The Complexity of the Hajos Calculus on Planar Graphs Yoichi Hanatani (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Kazuo Iwama, Suguru Tamaki (Kyoto Univ.) COMP2007-38 |
The planar Haj\'os calculus is the Haj\'os calculus with the restriction that all the graphs that appear in the constr... [more] |
COMP2007-38 pp.43-50 |
| COMP | 2007-06-29 09:25 |
Hokkaido | Hokkaido University (Hokkaido) | Linear Time Enumeration of Isolated Bicliques with Part Size Proportion Bounded by Constants Hiromitsu Miyagawa, Hiro Ito, Kazuo Iwama (Kyoto Univ.) COMP2007-19 |
Problems for finding a maximum bipartite clique and enumerating maximal bipartite cliques for graphs are difficult. Alth... [more] | COMP2007-19 pp.9-16 |
| COMP | 2006-12-04 16:35 |
Aichi | Nagoya University (Aichi) | 1.875-approximation algorithm for the stable marriage problem Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
[more] | COMP2006-48 pp.49-56 |
| R | 2006-06-23 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Tokyo) | Ｅｆｆｅｃｔ Ｅｖａｌｕａｔｉｏｎ for Hazardous Event Rate by SFF in IEC 61508 Kazuo Iwama (kaiyou university), Tsuneharu Simodaira (InterRisk Research Inst. & Consulting), Yoshinobu Sato, Koichi Suyama (Tokyo Univ. of Marine Science and Technology) |
[more] | R2006-15 pp.1-6 |
| COMP | 2006-06-23 11:10 |
Saitama | Saitama Univ. (Saitama) | Reductions for Monotone Boolean Circuits Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.) |
The large class, say {\it NLOG}, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of $O(n\log... [more] | COMP2006-19 pp.15-19 |
| COMP | 2006-05-24 14:10 |
Fukuoka | Kyushu Institute of Technology (Fukuoka) | (4,1)-Quantum Random Access Coding Does Not Exist Masahito Hayashi (JST), Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis, Nayak, Ta-shma and Vazirani in ACM Symp. on The... [more] |
COMP2006-14 pp.33-38 |
| COMP | 2006-03-23 09:00 |
Tokyo | The University of Electro-Communications (Tokyo) | Increasing the Success Probability of PPSZ-type Satisfiability Testing Kazuo Iwama, Suguru Tamaki (Kyoto Univ.) |
Recently, [Iwama, Tamaki, SODA04] gave a new worst-case upper bound for 3SAT by modifying the PPSZ-type algorithm in ... [more] |
COMP2005-63 pp.1-6 |
| COMP | 2006-03-23 13:10 |
Tokyo | The University of Electro-Communications (Tokyo) | [Fellow Memorial Lecture]
Invited Talk as a New Fellow Kazuo Iwama (Kyoto Univ.) |
[more] | |
| COMP | 2005-12-22 13:00 |
Tokushima | The University of Tokushima (Tokushima) | Transmitting classical information on the quantum network efficiently Kazuo Iwama, Harumichi Nishimura, Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
The question in this paper is whether the quantum random access (QRA) coding, given by Ambainis et al., on the {\it netw... [more] | COMP2005-51 pp.15-20 |
| COMP | 2005-12-22 16:25 |
Tokushima | The University of Tokushima (Tokushima) | Max-Stretch Reduction for Tree Spanners Kazuo Iwama (Kyoto Univ.), Andrzej Lingas (Lund Univ.), Masaki Okita (Kyoto Univ.) |
A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ whose max-stretch is $t$, i.e., the distance between ... [more] |
COMP2005-56 pp.49-55 |
| R, SSS | 2005-12-16 13:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Tokyo) | * Kazuo Iwama (TUMST), Tsuneharu Simodaira (InterRisk Research Inst. & Consulting), Yoshinobu Sato, Koichi Suyama (TUMST) |
IEC 61508 regulates requirements for the purpose of achievement of functional safety. This is translated into Japanese a... [more] | R2005-47 SSS2005-26 pp.1-4 |
| R, SSS | 2005-12-16 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Tokyo) | -- Kazuo Iwama (TUMST), Tsuneharu Simodaira (InterRisk Research Inst. & Consulting), Yoshinobu Sato, Koichi Suyama (TUMST) |
Unavailability of the redundant system with one repair team has been calcurated by meanas of Markov analysis in general.... [more] | R2005-48 SSS2005-27 pp.5-10 |
| COMP | 2005-10-19 09:35 |
Miyagi | Tohoku Univ. (Miyagi) | Automated Competitive Analysis of Online Problems Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.) |
In this paper we study the 2-Bin Exchangeable Online Knapsack Problem (2EOK) which is an extension of the 2-Bin Removab... [more] |
COMP2005-45 pp.7-12 |
| COMP | 2005-05-20 15:30 |
Fukuoka | Kyushu Univ. (Fukuoka) | Improving a local search approximation algorithm for the stable marriage problem Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowe... [more] | COMP2005-15 pp.45-51 |
[Return to Top Page]