IEEE Transactions on Electronic Computers von Bareiss, Erwin H.

Volltext

IEEE Transactions on Electronic Computers

Volltext

1967 Index IEEE Transactions on Electronic Computers Vol. EC-16 von Karplus, Walter J.

Volltext

1967 Index IEEE Transactions on Electronic Computers Vol. EC-16

Volltext

IEEE Transactions on Electronic Computers Annual Index 1966 Volume EC-15

Volltext

IEEE Transactions on Electronic Computers Annual Index 1965 Volume EC-14

Volltext

Karl S. Menger. Characterization and cardinality of universal functions. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 720–721 von Gilbert, Edgar N.

Volltext

C. S. Lorens. Invertible Boolean functions. IEEE transactions on electronic computers, vol. EC–13 (1964), pp. 529–541 von Stone, Harold S.

Volltext

Peter S. Landweber. Decision problems of phrase-structure grammars. IEEE transactions on electronic computers, vol. EC-13 (1964), pp. 354–362 von Kuroda, S.-Y.

Volltext

V. Kudielka and P. Oliva. Complete sets of functions of two and three binary variables. IEEE transactions on electronic computers, vol. EC-15 (1966), pp. 930–931 von Wernick, William

Volltext

H. H. LoomsJr. , and R. H. WymanJr. , On complete sets of logic primitives. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 173–174 von Enderton, H. B.

Volltext

H. H. LoomsJr., and R. H. WymanJr., On complete sets of logic primitives. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 173–174 von Enderton, H. B.

Volltext

Pierre Tison. Generalization of consensus theory and application to the minimization of Boolean functions. IEEE transactions on electronic computers, vol. EC-16 (1967), pp. 446–456 von Gimpel, James F.

Volltext

Angelo R. Meo. On the determination of the ps maximal implicants of a switching function. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 830–840 von Choudhury, A. K.

Volltext

Shen Lin and Tibor Rado. Computer studies of Turing machine problems. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 196–212. - Allen H. Brady. The conjectured highest scoring machines for Rado's Σ(k) for the value k = 4. IEEE transactions on electronic computers, vol. EC-15 (1966), pp. 802–803. - Milton W. Green. A lower bound on Rado's sigma function for binary Turing machines. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Prin von Enderton, H. B.

Volltext

Thomas H. MottJr., Determination of the ir redundant normal forms of a truth function by iterated consensus of the prime implicants. IRE transactions on electronic computers, vol. EC-9 (1960), pp. 245–252. - D. M. Y. Chang and T. H. MottJr., Computing irredundant normal forms from abbreviated presence functions. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 335–342 von Choudhury, A. K.

Volltext

A. K. Choudhury and M. S. Basu. On detection of group invariance or total symmetry of a Boolean function. Indian journal of physics, vol. 36 (1961), pp. 31–42; also Proceedings of the Indian Association for the Cultivation of Science , vol. 45 (1961), pp. 31–42. - C. L. Sheng. Detection of totally symmetric Boolean functions. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 924–926. - A. K. Choudhury and S. R. Das. Comment on “Detection of totally symmetric Boolean functions.”IE von Harrison, M. A.

Volltext

Michael A. Harrison. The number of transitivity sets of Boolean functions. Journal of the Society for Industrial and Applied Mathematics, t. 11 (1963), p. 806–828. - Michael A. Harrison. The number of equivalence classes of Boolean functions under groups containing negation. IEEE transactions on electronic computers, t. EC-12 (1963), p. 559–561. - Michael A. Harrison. On the number of classes of(n, k) switching networks. Journal of the Franklin Institute, t. 276 (1963), p. 313–327. - Michael A. von Kuntzmann, J.

Volltext

Michael A. Harrison. The number of transitivity sets of Boolean functions. Journal of the Society for Industrial and Applied Mathematics, t. 11 (1963), p. 806–828. - Michael A. Harrison. The number of equivalence classes of Boolean functions under groups containing negation. IEEE transactions on electronic computers, t. EC-12 (1963), p. 559–561. - Michael A. Harrison. On the number of classes of(n, k) switching networks. Journal of the Franklin Institute, t. 276 (1963), p. 313–327. - Michael A. von Kuntzmann, J.

Volltext

A New Compact SD2 Positive Integer Triangular Array Division Circuit von Santambrogio, M D, Stefanelli, R

Volltext