( en | de | ru )

 

Disambiguation of "Tayu, Satoshi"

Author of the publication

copydeleteadd this publication to your clipboard
3D scheduling based on code space exploration for dynamically reconfigurable systems.

, , and . ISCAS (5), page 465-468. IEEE, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Satoshi Ejima

Satoshi Okawa

Satoshi Otomo

Satoshi Murayama

Satoshi Nishida

 

Other publications of authors with the same name

Characterization and computation of Steiner wiring based on Elmore's delay model., and . APCCAS (2), page 335-340. IEEE, (2002)On the Fault Testing for Reversible Circuits., , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 812-821. Springer, (2007)Cost-Constrained Minimum-Delay Multicasting., , and . SOFSEM, volume 3381 of Lecture Notes in Computer Science, page 330-339. Springer, (2005)Scheduling Trees onto Hypercubes and Grids Is NP-complete.. COCOON, volume 1627 of Lecture Notes in Computer Science, page 251-260. Springer, (1999)Universal Test Sets for Reversible Circuits., , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 348-357. Springer, (2010)Weighted dominating sets and induced matchings in orthogonal ray graphs., , and . CoDIT, page 69-73. IEEE, (2014)Cost-Constrained Minimum-Delay Multicasting., , and . J. Interconnect. Networks, 9 (1/2): 141-155 (2008)Characterization and Computation of Steiner Routing Based on Elmore's Delay Model., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 85-A (12): 2764-2774 (2002)Scheduling Trees onto Hypercubes and Grids.. IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 85-A (5): 1011-1019 (2002)OBDD Representation of Intersection Graphs., , and . IEICE Trans. Inf. Syst., 98-D (4): 824-834 (2015)