| 2008 |
|---|
| 13 | EE | Kenji Sugiyama,
Yuichi Kaji:
On the Minimum Weight of Simple Full-Length Array LDPC Codes.
IEICE Transactions 91-A(6): 1502-1508 (2008) |
| 12 | EE | Hisashi Mohri,
Ritsuko Matsumoto,
Yuichi Kaji:
Key Predistribution Schemes for Sensor Networks Using Finite Plane Geometry.
IEICE Transactions 91-D(5): 1416-1423 (2008) |
| 2007 |
|---|
| 11 | EE | Satoshi Arima,
Takuji Tachibana,
Yuichi Kaji,
Shoji Kasahara:
FEC-Based Reliable Transmission for Multiple Bursts in OBS Networks.
IEICE Transactions 90-B(12): 3541-3551 (2007) |
| 2006 |
|---|
| 10 | EE | Yuichi Kaji:
Encoding LDPC Codes Using the Triangular Factorization.
IEICE Transactions 89-A(10): 2510-2518 (2006) |
| 2005 |
|---|
| 9 | EE | Ryo Nojima,
Yuichi Kaji:
Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method.
IEICE Transactions 88-A(1): 189-194 (2005) |
| 8 | EE | Ryo Nojima,
Yuichi Kaji:
Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption.
IEICE Transactions 88-A(2): 568-574 (2005) |
| 2002 |
|---|
| 7 | EE | Hiroyuki Seki,
Toshinori Takai,
Youhei Fujinaka,
Yuichi Kaji:
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.
RTA 2002: 98-113 |
| 2001 |
|---|
| 6 | EE | Tadao Kasami,
Hitoshi Tokushige,
Yuichi Kaji:
Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms.
AAECC 2001: 333-342 |
| 2000 |
|---|
| 5 | | Toshinori Takai,
Yuichi Kaji,
Hiroyuki Seki:
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability.
RTA 2000: 246-260 |
| 1997 |
|---|
| 4 | | Yuichi Kaji,
Toru Fujiwara,
Tadao Kasami:
Solving a Unification Problem under Constrained Substitutions Using Tree Automata.
J. Symb. Comput. 23(1): 79-117 (1997) |
| 1994 |
|---|
| 3 | | Yuichi Kaji,
Toru Fujiwara,
Tadao Kasami:
Solving a Unification Problem under Constrained Substitutions Using Tree Automata.
FSTTCS 1994: 276-287 |
| 2 | | Yuichi Kaji,
Ryuchi Nakanishi,
Hiroyuki Seki,
Tadao Kasami:
The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars.
Computational Intelligence 10: 440-452 (1994) |
| 1993 |
|---|
| 1 | | Hiroyuki Seki,
Ryuichi Nakanishi,
Yuichi Kaji,
Sachiko Ando,
Tadao Kasami:
Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars.
ACL 1993: 130-139 |
