| * | 2009 |
|---|
| 10 | EE | Andris Ambainis,
Kazuo Iwama,
Masaki Nakanishi,
Harumichi Nishimura,
Rudy Raymond,
Seiichiro Tani,
Shigeru Yamashita:
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size
CoRR abs/0908.2468: (2009) |
| 9 | EE | Harumichi Nishimura,
Rudy Raymond:
Quantum Random Access Coding.
IEICE Transactions 92-A(5): 1268-1275 (2009) |
| 2008 |
|---|
| 8 | EE | Kazuo Iwama,
Harumichi Nishimura,
Mike Paterson,
Rudy Raymond,
Shigeru Yamashita:
Polynomial-Time Construction of Linear Network Coding.
ICALP (1) 2008: 271-282 |
| 7 | EE | Andris Ambainis,
Kazuo Iwama,
Masaki Nakanishi,
Harumichi Nishimura,
Rudy Raymond,
Seiichiro Tani,
Shigeru Yamashita:
Quantum Query Complexity of Boolean Functions with Small On-Sets.
ISAAC 2008: 907-918 |
| 6 | EE | Ashley Montanaro,
Harumichi Nishimura,
Rudy Raymond:
Unbounded-Error Quantum Query Complexity.
ISAAC 2008: 919-930 |
| 2007 |
|---|
| 5 | EE | Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Unbounded-Error One-Way Classical and Quantum Communication Complexity.
ICALP 2007: 110-121 |
| 4 | EE | Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Unbounded-Error Classical and Quantum Communication Complexity.
ISAAC 2007: 100-111 |
| 3 | EE | Ryo Hirade,
Rudy Raymond,
Hiroyuki Okano:
Sensitivity analysis on causal events of WIP bubbles by a log-driven simulator.
Winter Simulation Conference 2007: 1747-1754 |
| 2 | EE | Andris Ambainis,
Kazuo Iwama,
Akinori Kawachi,
Rudy Raymond,
Shigeru Yamashita:
Improved algorithms for quantum identification of Boolean oracles.
Theor. Comput. Sci. 378(1): 41-53 (2007) |
| 2006 |
|---|
| 1 | EE | Masahito Hayashi,
Kazuo Iwama,
Harumichi Nishimura,
Rudy Raymond,
Shigeru Yamashita:
Quantum Network Coding.
Complexity of Boolean Functions 2006 |
