-
1
-
-
12344289977
-
Optimal layout via Boolean satisfiability
-
S. Devadas, "Optimal layout via Boolean satisfiability," Int. J. Comput. Aided VLSI Design, no. 2, pp. 251-262, 1990.
-
(1990)
Int. J. Comput. Aided VLSI Design
, vol.2
, pp. 251-262
-
-
Devadas, S.1
-
2
-
-
0041919447
-
Board-level multiterminal net assignment for the partial crossbar architecture
-
June
-
X. Song, W. N. N. Hung, A. Mishchenko, M. Chrzanowska-Jeske, A. Kennings, and A. Coppola, "Board-level multiterminal net assignment for the partial crossbar architecture," IEEE Trans. VLSI Syst., vol. 11, pp. 511-514, June 2003.
-
(2003)
IEEE Trans. VLSI Syst.
, vol.11
, pp. 511-514
-
-
Song, X.1
Hung, W.N.N.2
Mishchenko, A.3
Chrzanowska-Jeske, M.4
Kennings, A.5
Coppola, A.6
-
3
-
-
12344318897
-
Segmented channel routability via satisfiability
-
Oct.
-
W. N. N. Hung, X. Song, E. M. Aboulhamid, A. Kennings, and A. Coppola, "Segmented channel routability via satisfiability," ACM Trans. Design Automation Electron. Syst., vol. 9, no. 4, pp. 517-528, Oct. 2004.
-
(2004)
ACM Trans. Design Automation Electron. Syst.
, vol.9
, Issue.4
, pp. 517-528
-
-
Hung, W.N.N.1
Song, X.2
Aboulhamid, E.M.3
Kennings, A.4
Coppola, A.5
-
4
-
-
0025543674
-
Algorithms for discrete function manipulation
-
A. Srinivasan, T. Kam, S. Malik, and R. Brayton, "Algorithms for discrete function manipulation," in Proc. Int. Conf. Computer-Aided Design, 1990, pp. 92-95.
-
(1990)
Proc. Int. Conf. Computer-aided Design
, pp. 92-95
-
-
Srinivasan, A.1
Kam, T.2
Malik, S.3
Brayton, R.4
-
5
-
-
0022076244
-
A greedy switch-box router
-
W. K. Luk, "A greedy switch-box router," Integration: The VLSI J., vol. 3, pp. 129-149, 1985.
-
(1985)
Integration: the VLSI J.
, vol.3
, pp. 129-149
-
-
Luk, W.K.1
-
6
-
-
0020301953
-
A new area router, the LRS algorithm
-
L. R. Smith, T. Saxe, J. Newkirk, and R. Mathews, "A new area router, the LRS algorithm," in Proc. IEEE Int. Conf. Circuits Computers, 1982, pp. 256-259.
-
(1982)
Proc. IEEE Int. Conf. Circuits Computers
, pp. 256-259
-
-
Smith, L.R.1
Saxe, T.2
Newkirk, J.3
Mathews, R.4
-
7
-
-
12344293160
-
A minimum-impact routing algorithm
-
K. J. Supowit, "A minimum-impact routing algorithm," in Proc. Design Automation Conf., 1982, pp. 104-112.
-
(1982)
Proc. Design Automation Conf.
, pp. 104-112
-
-
Supowit, K.J.1
-
8
-
-
85013873725
-
Conflict driven learning in a quantified Boolean satisfiability solver
-
San Jose, CA, Nov.
-
L. Zhang and S. Malik, "Conflict driven learning in a quantified Boolean satisfiability solver," in Proc. Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 2002.
-
(2002)
Proc. Int. Conf. Computer-aided Design
-
-
Zhang, L.1
Malik, S.2
-
9
-
-
0025531311
-
Three-dimensional routing for multilayer ceramic printed circuit boards
-
Nov.
-
A. Hanafusa, Y. Yamashita, and M. Yasuda, "Three-dimensional routing for multilayer ceramic printed circuit boards," in Proc. Int. Conf. Computer-Aided Design, Nov. 1990, pp. 386-389.
-
(1990)
Proc. Int. Conf. Computer-aided Design
, pp. 386-389
-
-
Hanafusa, A.1
Yamashita, Y.2
Yasuda, M.3
-
10
-
-
10944270342
-
Congestion estimation for 3-D circuit architectures
-
Dec.
-
L. Cheng, W. N. N. Hung, G. Yang, and X. Song, "Congestion estimation for 3-D circuit architectures," IEEE Trans. Circuits Syst. II, vol. 12, pp. 655-659, Dec. 2004.
-
(2004)
IEEE Trans. Circuits Syst. II
, vol.12
, pp. 655-659
-
-
Cheng, L.1
Hung, W.N.N.2
Yang, G.3
Song, X.4
-
11
-
-
0004392594
-
Optimal three-dimensional VLSI layout
-
F. Preparata, "Optimal three-dimensional VLSI layout," Math. Syst. Theory, vol. 16, pp. 1-8, 1983.
-
(1983)
Math. Syst. Theory
, vol.16
, pp. 1-8
-
-
Preparata, F.1
-
12
-
-
0029208379
-
Routing in a three-dimensional chip
-
Jan.
-
C. C. Tong and C. Wu, "Routing in a three-dimensional chip," IEEE Trans. Computers, vol. 44, pp. 106-117, Jan. 1995.
-
(1995)
IEEE Trans. Computers
, vol.44
, pp. 106-117
-
-
Tong, C.C.1
Wu, C.2
-
13
-
-
0029510886
-
Three dimensional field-programmable gate arrays
-
Austin, TX, Sept.
-
M. J. Alexander, J. P. Cohoon, J. L. Coleflesh, J. Kairo, and G. Robins, "Three dimensional field-programmable gate arrays," in Proc. IEEE Int. ASIC Conf, Austin, TX, Sept. 1995, pp. 253-256.
-
(1995)
Proc. IEEE Int. ASIC Conf
, pp. 253-256
-
-
Alexander, M.J.1
Cohoon, J.P.2
Coleflesh, J.L.3
Kairo, J.4
Robins, G.5
-
14
-
-
0034246195
-
3-D floorplanning: Simulated annealing and greedy placement methods for reconfigurable computing systems
-
Aug.
-
K. Bazargan, R. Kastner, and M. Sarrafzadeh, "3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems," J. Design Automation Embedded Syst., no. 5, pp. 329-338, Aug. 2000.
-
(2000)
J. Design Automation Embedded Syst.
, Issue.5
, pp. 329-338
-
-
Bazargan, K.1
Kastner, R.2
Sarrafzadeh, M.3
-
17
-
-
0022769976
-
Graph based algorithms for Boolian function manipulation
-
Aug.
-
R. E. Bryant, "Graph based algorithms for Boolian function manipulation," IEEE Trans. Computers, vol. C-35, pp. 677-691, Aug. 1986.
-
(1986)
IEEE Trans. Computers
, vol.C-35
, pp. 677-691
-
-
Bryant, R.E.1
-
18
-
-
0036684718
-
BDD minimization by scatter search
-
Aug.
-
W. N. N. Hung, X. Song, E. M. Aboulhamid, and M. A. Driscoll, "BDD minimization by scatter search," IEEE Trans. Computer-Aided Desisn, vol. 21, pp. 974-979, Aug. 2002.
-
(2002)
IEEE Trans. Computer-aided Desisn
, vol.21
, pp. 974-979
-
-
Hung, W.N.N.1
Song, X.2
Aboulhamid, E.M.3
Driscoll, M.A.4
|