 | 2009 |
|---|
| 12 |       | Kaoru Kurosawa,
Kazuhiro Suzuki:
Almost Secure (1-Round, n-Channel) Message Transmission Scheme.
IEICE Transactions 92-A(1): 105-112 (2009) |
| 2008 |
|---|
| 11 | | Kaoru Kurosawa,
Kazuhiro Suzuki:
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme.
EUROCRYPT 2008: 324-340 |
| 10 | | Kazuhiro Suzuki,
Dongvu Tonien,
Kaoru Kurosawa,
Koji Toyota:
Birthday Paradox for Multi-Collisions.
IEICE Transactions 91-A(1): 39-45 (2008) |
| 2007 |
|---|
| 9 | | Kazuhiro Suzuki,
Kaoru Kurosawa:
How to Find Many Collisions of 3-Pass HAVAL.
IWSEC 2007: 428-443 |
| 8 | | Atsushi Kaneko,
Mikio Kano,
Kazuhiro Suzuki:
Spanning trees with leaf distance at least four.
Journal of Graph Theory 55(1): 83-90 (2007) |
| 2006 |
|---|
| 7 | | Kazuhiro Suzuki,
Dongvu Tonien,
Kaoru Kurosawa,
Koji Toyota:
Birthday Paradox for Multi-collisions.
ICISC 2006: 29-40 |
| 6 | | Atsushi Kaneko,
Kazuhiro Suzuki:
Packing two copies of a tree into its third power.
Discrete Mathematics 306(21): 2779-2785 (2006) |
| 5 | | Kazuhiro Suzuki:
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph.
Graphs and Combinatorics 22(2): 261-269 (2006) |
| 2005 |
|---|
| 4 | | Atsushi Kaneko,
Mikio Kano,
Kazuhiro Suzuki:
Partitioning complete multipartite graphs by monochromatic trees.
Journal of Graph Theory 48(2): 133-141 (2005) |
| 2004 |
|---|
| 3 |  | Kazuhiro Suzuki:
A Counterexample to a Conjecture on Packing Two Copies of a Tree into its Third Power.
Ars Comb. 73: (2004) |
| 2003 |
|---|
| 2 | | Michiko Inoue,
Kazuhiro Suzuki,
Hiroyuki Okamoto,
Hideo Fujiwara:
Test Synthesis for Datapaths Using Datapath-Controller Functions.
Asian Test Symposium 2003: 294-299 |
| 2002 |
|---|
| 1 | | Kazuhiro Suzuki:
On the Number of Intersections of Three Monochromatic Trees in the Plane.
JCDCG 2002: 261-272 |
