|
| Satoshi TAYU
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Characterization and Computation of Steiner Routing Based on Elmore's Delay Model
Satoshi TAYU Mineo KANEKO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/12/01
Vol. E85-A
No. 12
pp. 2764-2774
Type of Manuscript:
Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
Category: Timing Analysis
Keyword:
Elmore's delay, Steiner tree, net, binary tree, Manhattan distance, | | | Summary | Full Text:PDF | |
|
Scheduling Trees onto Hypercubes and Grids
Satoshi TAYU | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A
No. 5
pp. 1011-1019
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
task scheduling, tree, hypercube, grid, communication delay, | | | Summary | Full Text:PDF | |
|
Efficient Embeddings of Binary Trees with Bounded Proper Pathwidth into Paths and Grids
Satoshi TAYU Shuichi UENO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/01/25
Vol. E80-A
No. 1
pp. 183-193
Type of Manuscript:
PAPER
Category: Reliability and Fault Analysis
Keyword:
embedding, binary, trees, proper pathwidth, bandwidth, grids, , | | | Summary | Full Text:PDF | |
|
|