Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach (1992)
- Authors:
- USP affiliated authors: SONG, SIANG WUN - IME ; FERREIRA, AFONSO GALVAO - IME
- Unidade: IME
- Subjects: TEORIA DA COMPUTAÇÃO; SISTEMAS INTEGRADOS EM LARGA ESCALA
- Language: Inglês
- Imprenta:
-
ABNT
FERREIRA, Afonso Galvão e SONG, Siang Wun. Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach. . Lyon: Lip. . Acesso em: 23 abr. 2024. , 1992 -
APA
Ferreira, A. G., & Song, S. W. (1992). Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach. Lyon: Lip. -
NLM
Ferreira AG, Song SW. Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach. 1992 ;[citado 2024 abr. 23 ] -
Vancouver
Ferreira AG, Song SW. Achieving optimality for gate matrix layout and pla folding: a graph theoretic approach. 1992 ;[citado 2024 abr. 23 ] - Graph theoretic approach for pla area optimization
- Achieving optimality for gate matrix layout and pla folding: a graph theoretical approach
- Graph theoretic approach for pla area optimization
- Comunicacao em hipergrades e hipertoros usando barramentos
- Efficient parallel graph algoritms for coarse-grained multicomputers and BSP
- Broadcasting in bus interconnection networks
- Generating permutations on a VLSI suitable linear network
- Bus based parallel computers: a viable way for massive parallelism
- 2-list algorithm for the knapsack problem on a fpst20
- Parallel time / hardware tradloff t.H =0(2 pot.N/2) for the knapsack problem
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas