O(n)-time standard cell placement algorithm using constrained multi-stage graph model

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 1194
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCho, H.G.-
dc.contributor.authorKyung, Chong-Min-
dc.date.accessioned2013-03-14T04:05:19Z-
dc.date.available2013-03-14T04:05:19Z-
dc.date.created2012-02-06-
dc.date.issued1988-06-
dc.identifier.citation1988 IEEE International Symposium on Circuits and Systems, Proceedings, v.2, no., pp.1687 - 1690-
dc.identifier.issn0271-4310-
dc.identifier.urihttp://hdl.handle.net/10203/105077-
dc.languageENG-
dc.publisherIEEE-
dc.titleO(n)-time standard cell placement algorithm using constrained multi-stage graph model-
dc.typeConference-
dc.identifier.scopusid2-s2.0-0024124303-
dc.type.rimsCONF-
dc.citation.volume2-
dc.citation.beginningpage1687-
dc.citation.endingpage1690-
dc.citation.publicationname1988 IEEE International Symposium on Circuits and Systems, Proceedings-
dc.identifier.conferencecountryFinland-
dc.identifier.conferencecountryFinland-
dc.contributor.localauthorKyung, Chong-Min-
dc.contributor.nonIdAuthorCho, H.G.-
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0