The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Masayuki Terai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Masayuki Terai, Kazuhiro Takahashi, Koji Sato
    A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint. [Citation Graph (0, 0)][DBLP]
    DAC, 1990, pp:96-102 [Conf]
  2. Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato
    Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1994, pp:428-431 [Conf]
  3. Masayuki Terai, Kazuhiro Takahashi, Kazuo Nakajima, Koji Sato
    A New Model for Over-The-Cell Channel Routing with Three Layers. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1991, pp:432-435 [Conf]
  4. Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato
    Min-cut placement with global objective functions for large scale sea-of-gates arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1995, v:14, n:4, pp:434-446 [Journal]
  5. Masayuki Terai
    A Method of Improving the Terminal Assignment in the Channel Routing for Gate Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1985, v:4, n:3, pp:329-336 [Journal]
  6. Masayuki Terai, Kazuo Nakajima, Kazuhiro Takahashi, Koji Sato
    A new approach to over-the-cell channel routing with three layers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1994, v:13, n:2, pp:187-200 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002