-
1
-
-
0040346764
-
Computational geometry algorithms
-
T. Ohtsuki ed.), Elsvier Science Pub.
-
T. Asano, M. Sato and T. Ohtsuki, " Computational geometry algorithms", in Layout Design and Verification (T. Ohtsuki ed.), Elsvier Science Pub., pp. 295-347, 1986.
-
(1986)
Layout Design and Verification
, pp. 295-347
-
-
Asano, T.1
Sato, M.2
Ohtsuki, T.3
-
2
-
-
85113833676
-
Performance-driven compaction problem with symmetry constraints
-
May
-
E. Felt, E. Malavasi, E. Charbon, R. Totaro and A. Sangiovanni-Vincentelli, "Performance-driven compaction problem with symmetry constraints," Proceedings of IEEE Custom Integrated Circuits Conference, pp. 1731-1735, May 1992.
-
(1992)
Proceedings of IEEE Custom Integrated Circuits Conference
, pp. 1731-1735
-
-
Felt, E.1
Malavasi, E.2
Charbon, E.3
Totaro, R.4
Sangiovanni-Vincentelli, A.5
-
3
-
-
0005256455
-
Finding the connected components and a maximum clique of an intersecting graph of rectangles in the plane
-
H. Imai and T. Asano, "Finding the connected components and a maximum clique of an intersecting graph of rectangles in the plane," Journal of Algorithms, vol. 4, pp. 310-323, 1983.
-
(1983)
Journal of Algorithms
, vol.4
, pp. 310-323
-
-
Imai, H.1
Asano, T.2
-
5
-
-
0022060134
-
Priority search trees
-
May
-
M. Mc Creight, "Priority search trees," SIAM Journal on Computing, vol. 14, no.2, pp. 257-276, May 1985.
-
(1985)
SIAM Journal on Computing
, vol.14
, Issue.2
, pp. 257-276
-
-
Mc Creight, M.1
-
6
-
-
0024902637
-
An efficient algorithm for layout compaction problem with symmetry constraints
-
Nov
-
R. Okuda, T. Sato, H. Onedera and K. Tamaru, "An efficient algorithm for layout compaction problem with symmetry constraints," Proc. IEEE/ACM International Conference on ComputerAidedDesign, pp. 148-151, Nov. 1989.
-
(1989)
Proc. IEEE/ACM International Conference on ComputerAidedDesign
, pp. 148-151
-
-
Okuda, R.1
Sato, T.2
Onedera, H.3
Tamaru, K.4
-
7
-
-
0021120760
-
Corner stitching: A data-structuring technique for VLSI layout tools
-
January
-
J. K. Ousterhout, "Corner stitching: A data-structuring technique for VLSI layout tools," IEEE Transactions on Computer Aided-Design of integrated Circuits and Systems, vol. CAD-3, no.1, pp. 87-100, January 1984.
-
(1984)
IEEE Transactions on Computer Aided-Design of Integrated Circuits and Systems
, vol.CAD-3
, Issue.1
, pp. 87-100
-
-
Ousterhout, J.K.1
-
8
-
-
0024174582
-
Stick diagram extraction program: Skeleton
-
T. Sato, N. Ohba, H. Watanabe and S. Saito, "Stick diagram extraction program: SKELETON," Proceedings of IEEE/ACM International Conference on Computer Aided Design, pp. 318-321,1988.
-
(1988)
Proceedings of IEEE/ACM International Conference on Computer Aided Design
, pp. 318-321
-
-
Sato, T.1
Ohba, N.2
Watanabe, H.3
Saito, S.4
-
10
-
-
0030216357
-
Automatic layout recycling based on layout description and linear programming
-
August
-
Y. Shigshiro, T. Nagata, I. Shirakawa, I. Arungsrisangohai and H. Takahashi, "Automatic layout recycling based on layout description and linear programming," IEEE Transactions on Computer Aided-Design of Integrated Circuits and Systems, vol. 15, no. 8, pp. 959-967, August 1996.
-
(1996)
IEEE Transactions on Computer Aided-Design of Integrated Circuits and Systems
, vol.15
, Issue.8
, pp. 959-967
-
-
Shigshiro, Y.1
Nagata, T.2
Shirakawa, I.3
Arungsrisangohai, I.4
Takahashi, H.5
-
11
-
-
0016495233
-
Efficient of a good but not linear set union algorithm
-
R. E. Tarjan "Efficient of a good but not linear set union algorithm," Journal of ACM, 22, pp. 215-225, 1975.
-
(1975)
Journal of ACM
, vol.22
, pp. 215-225
-
-
Tarjan, R.E.1
|