-
1
-
-
0003018743
-
Placement techniques
-
Englewood Cliffs, NJ: Prentice-Hall, M. A. Breuer, Ed., ch. 5, this chapter-contains extensive literature references in this field.
-
M. Hanan and J. M. Kurtzberg, “Placement techniques,” in Design Automation of Digital Systems, M. A. Breuer, Ed., Englewood Cliffs, NJ: Prentice-Hall, 1972, ch. 5, pp. 213-282; this chapter-contains extensive literature references in this field
-
(1972)
Design Automation of Digital Systems
, pp. 213-282
-
-
Hanan, M.1
Kurtzberg, J.M.2
-
2
-
-
38949153947
-
Random minimal trees
-
E. N. Gilbert, “Random minimal trees,” SIAM J. Appl. Math., vol. 13, pp. 376–387, 1965
-
(1965)
SIAM J. Appl. Math
, vol.13
, pp. 376-387
-
-
Gilbert, E.N.1
-
3
-
-
0000085660
-
Statistical properties of the placement of a graph
-
Mar
-
W. E. Donath, “Statistical properties of the placement of a graph,” SIAM J. Appl. Math., vol. 16, no. 2, pp. 376–387, Mar. 1968
-
(1968)
SIAM J. Appl. Math
, vol.16
, Issue.2
, pp. 376-387
-
-
Donath, W.E.1
-
4
-
-
0016102199
-
Equivalence of Memory to Random Logic
-
Sept. Stochastic model of the computer logic design process. T. J. Watson Res. Cent, Rep. RC 3136, Nov. 5. IBM, Yorktown Heights, NY.
-
Equivalence of Memory to Random Logic,” IBM J. Res. Develop., vol. 58, no. 5, pp. 401–407, Sept. 1974; “Stochastic model of the computer logic design process, IBM T. J. Watson Res. Cent., Yorktown Heights, NY Rep. RC 3136, Nov. 5, 1970
-
(1974)
IBM J. Res. Develop
, vol.58
, Issue.5
, pp. 401-407
-
-
-
5
-
-
0015622088
-
How big should a printed circuit board be?
-
May
-
I. Sutherland and D. Oestreicher, “How big should a printed circuit board be?” IEEE Trans. Comput., vol. C-22, pp, 537–542, May 1973
-
(1973)
IEEE Trans. Comput
, vol.C-22
, pp. 537-542
-
-
Sutherland, I.1
Oestreicher, D.2
-
6
-
-
0015206785
-
On a pin versus block relationship for partitions of logic graphs
-
Dec
-
B. S. Landman and R. L. Russo, “On a pin versus block relationship for partitions of logic graphs,” IEEE Trans. Comput., vol. C-20, pp. 1469–1479, Dec. 1971
-
(1971)
IEEE Trans. Comput
, vol.C-20
, pp. 1469-1479
-
-
Landman, B.S.1
Russo, R.L.2
-
7
-
-
0002006546
-
The Parceto-Levy law and the distribution of income, Information theory and psycholinquistics: A theory of word frequencies
-
P. F. Lazarsfeld and N. W. Henry, Eds. Cambridge, MA: MIT Press
-
B. Mandelbrot, “The Parceto-Levy law and the distribution of income,” Int. Econom. Rev., vol. I, p. 79, 1960; “Information theory and psycholinquistics: A theory of word frequencies,” in Readings in Mathematical Sciences, P. F. Lazarsfeld and N. W. Henry, Eds. Cambridge, MA: MIT Press, 1968, p. 350
-
(1960)
Int. Econom. Rev. Readings in Mathematical Sciences
, vol.I
, pp. 79-350
-
-
Mandelbrot, B.1
-
8
-
-
0015299641
-
On the tradeoff between logic performance and circuit to pin ratio for LSI
-
Feb
-
R. L. Russo, “On the tradeoff between logic performance and circuit to pin ratio for LSI,” IEEE Trans. Comput., vol. C-21, pp. 147–155, Feb. 1972
-
(1972)
IEEE Trans. Comput
, vol.C-21
, pp. 147-155
-
-
Russo, R.L.1
-
9
-
-
84937997939
-
Path lengths in combinational computer logic graphs
-
June 2. J. Watson Res. Center. Rep. RC 3383. Yorktown Heights, NY.
-
W. E. Donath and R. B. Hitchcock, “Path lengths in combinational computer logic graphs,” IBM T. J. Watson Res. Center, Yorktown Heights, NY, Rep. RC 3383, June 2, 1971
-
(1971)
IBM T
-
-
Donath, W.E.1
Hitchcock, R.B.2
|