| 2006 |
|---|
| 9 | EE | Takashi Hirayama,
M. Takahashi,
Yasuaki Nishitani:
Simplification of Exclusive-or Sum-of-Products Expressions Through Function Transformation.
APCCAS 2006: 1480-1483 |
| 8 | EE | Takashi Hirayama,
Yasuaki Nishitani:
Efficient Search Methods for Obtaining Exact Minimum AND-EXOR Expressions.
DELTA 2006: 137-142 |
| 2002 |
|---|
| 7 | EE | Takashi Hirayama,
Yasuaki Nishitani,
T. Sato:
A faster algorithm of minimizing AND-EXOR expressions.
APCCAS (2) 2002: 293-298 |
| 1999 |
|---|
| 6 | EE | Yoshihide Igarashi,
Yasuaki Nishitani:
Speedup of Lockout-Free Mutual Exclusion Algorithms.
ISPAN 1999: 172-177 |
| 5 | | Yoshihide Igarashi,
Yasuaki Nishitani:
Speedup of the n-Process Mutual Exclusion Algorithm.
Parallel Processing Letters 9(4): 475-485 (1999) |
| 1996 |
|---|
| 4 | EE | Koji Obokata,
Yasuaki Nishitani,
Yoshihide Igarashi:
A Probably Optimal Embedding of Hyper-Rings in Hypercubes.
Inf. Process. Lett. 58(3): 117-122 (1996) |
| 1995 |
|---|
| 3 | | Yukihiro Hamada,
Aohan Mei,
Yasuaki Nishitani,
Yoshihide Igarashi:
Embeddings of Hyper-Rings in Hypercubes.
ISAAC 1995: 312-321 |
| 1982 |
|---|
| 2 | | T. Ito,
Yasuaki Nishitani:
On Universality of Concurrent Expressions with Synchronization Primitives.
Theor. Comput. Sci. 19: 105-115 (1982) |
| 1981 |
|---|
| 1 | | Yasuaki Nishitani,
Namio Honda:
The Firing Squad Synchronization Problem for Graphs.
Theor. Comput. Sci. 14: 39-61 (1981) |
