A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/dac/HuLA09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/dac/HuLA09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Charles_J._Alpert
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Shiyan_Hu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Zhuo_Li_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1629911.1630026
>
foaf:
homepage
<
https://doi.org/10.1145/1629911.1630026
>
dc:
identifier
DBLP conf/dac/HuLA09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1629911.1630026
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Charles_J._Alpert
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Shiyan_Hu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Zhuo_Li_0001
>
swrc:
pages
424-429
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/dac/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/dac/HuLA09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/dac/HuLA09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/dac/dac2009.html#HuLA09
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1629911.1630026
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/dac
>
dc:
subject
NP-complete, buffer insertion, cost minimization, dynamic programming, fully polynomial time approximation scheme
(xsd:string)
dc:
title
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document