Name
Abstract | ||
|---|---|---|
[UC,BNR] formulate a linear layout problem for static CMOS gates and give partial solutions of the problem. [O] reformulates the problem in two ways for dynamic CMOS cells and gives partial solutions. We give complete solutions to both problems formulated by [O] by giving linear algorithms. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1007/3-540-16766-8_11 | Aegean Workshop on Computing |
Keywords | Field | DocType |
linear algorithms,cmos layout problem,cmos layout problems,linear algorithm | Path (graph theory),Computer science,Decomposition tree,Linear algorithm,Algorithm,CMOS | Conference |
ISBN | Citations | PageRank |
0-387-16766-8 | 7 | 3.84 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R Mueller | 1 | 7 | 3.84 |
| T. Lengauer | 2 | 110 | 15.00 |