Jun Sakiyama

According to our database, Jun Sakiyama authored at least 4 papers between 2003 and 2004.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2004

A systematic approach for analyzing fast addition algorithms using counter tree diagrams.

Naofumi Homma, Jun Sakiyama, Taihei Wakamatsu, Takafumi Aoki, Tatsuo Higuchi

Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

2003

Counter Tree Diagrams: A Unified Representation of Fast Addition Algorithms.

Jun Sakiyama, Takafumi Aoki, Tatsuo Higuchi

J. Multiple Valued Log. Soft Comput., 2003

Counter Tree Diagrams: A Unified Framework for Analyzing Fast Addition Algorithms.

Jun Sakiyama, Naofumi Homma, Takafumi Aoki, Tatsuo Higuchi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Counter Tree Diagrams for Design and Analysis of Fast Addition Algorithms.

Jun Sakiyama, Takafumi Aoki, Tatsuo Higuchi

Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003