An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/aspdac/DechuSC04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/aspdac/DechuSC04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Chris_C._N._Chu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sampath_Dechu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Zion_Cien_Shen
>
foaf:
homepage
<
http://dx.doi.org/doi.ieeecomputersociety.org%2F10.1109%2FASPDAC.2004.44
>
foaf:
homepage
<
https://doi.ieeecomputersociety.org/10.1109/ASPDAC.2004.44
>
dc:
identifier
DBLP conf/aspdac/DechuSC04
(xsd:string)
dc:
identifier
DOI doi.ieeecomputersociety.org%2F10.1109%2FASPDAC.2004.44
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
rdfs:
label
An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Chris_C._N._Chu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sampath_Dechu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Zion_Cien_Shen
>
swrc:
pages
361-366
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/aspdac/2004
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/aspdac/DechuSC04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/aspdac/DechuSC04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/aspdac/aspdac2004.html#DechuSC04
>
rdfs:
seeAlso
<
https://doi.ieeecomputersociety.org/10.1109/ASPDAC.2004.44
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/aspdac
>
dc:
title
An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document