この文書の現在のバージョンと選択したバージョンの差分を表示します。
両方とも前のリビジョン 前のリビジョン | |||
publicationlist [2020/07/28 12:03] cs |
publicationlist [2020/08/17 08:42] cs |
||
---|---|---|---|
ライン 1: | ライン 1: | ||
===== Journal Papers ===== | ===== Journal Papers ===== | ||
+ | - Daisuke Takafuji, Koji Nakano and Yasuaki Ito, Efficient Parallel Implementations to Compute the Diameter of a Graph, Concurrency and Computation: Practice and Experience, to appear.([[http://dx.doi.org/10.1002/cpe.5963|Link]]) | ||
- Takuma Wada, Naoki Matsumura, Ryota Yasudo, Koji Nakano, Yasuaki Ito, Efficient implementations of Bloom filter using block RAMs and DSP slices on the FPGA, Concurrency and Computation: Practice and Experience, to appear. ([[https://doi.org/10.1002/cpe.5475|Link]]) | - Takuma Wada, Naoki Matsumura, Ryota Yasudo, Koji Nakano, Yasuaki Ito, Efficient implementations of Bloom filter using block RAMs and DSP slices on the FPGA, Concurrency and Computation: Practice and Experience, to appear. ([[https://doi.org/10.1002/cpe.5475|Link]]) | ||
- Kohei Yamashita, Yasuaki Ito, Koji Nakano, Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU, Concurrency and Computation: Practice and Experience, Vol. 31, No. 19, e4947, September, 2019. ([[https://doi.org/10.1002/cpe.4947|Link]]) | - Kohei Yamashita, Yasuaki Ito, Koji Nakano, Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU, Concurrency and Computation: Practice and Experience, Vol. 31, No. 19, e4947, September, 2019. ([[https://doi.org/10.1002/cpe.4947|Link]]) |