CSDL - IEEE Transactions on Computers

IEEE Transactions on Computers - Table of contents (PDF)

pp. c1-877-c

IEEE Computer Group (PDF)

pp. c2

Incremental Curve Generation (PDF)

P.E. Danielsson, IEEE

pp. 783-793

A Preprocessing High-Speed Memory System (Abstract)

D.J. Kuck, IEEE

pp. 793-802

PDF

HTML

A Novel Rotate and Shift Circuit Using Bidirectional Gates (Abstract)

W.R. Nordquist, IEEE

W.N. Toy

pp. 802-808

PDF

HTML

Serial Binary-to-Decimal and Decimal-to-Binary Conversion (Abstract)

V.T. Rhyne, IEEE

pp. 808-812

PDF

HTML

Design Criteria for a Generator of Repeatable Non-Poisson Sequences of Pseudorandom Pulses (Abstract)

D.G. Maritsas

M.G. Hartley

pp. 812-817

PDF

HTML

Enumeration of Threshold Functions of Eight Variables (Abstract)

S. Muroga, IEEE

T. Tsuboi

C.R. Baugh

pp. 818-825

PDF

HTML

An Optimal Discriminant Plane (Abstract)

J.W. Sammon, IEEE

pp. 826-829

PDF

HTML

State-Variable Techniques for Digital Simulation of Bandpass Systems (PDF)

J.V. Wait, IEEE

pp. 830-831

Interconnection of High-Speed Logic Circuits (Abstract)

T. Janisz, IEEE

R.C. Martin

pp. 831-837

PDF

HTML

Bypass Switching for Cellular Cascades (Abstract)

W.H. Kautz, IEEE

pp. 837-839

PDF

HTML

Buffer Length for Erlang Input and Constant Removal Rate (Abstract)

D.G. Maritsas

M.G. Hartley

pp. 839-843

PDF

HTML

Sorting Implicit Outputs in Digital Simulation (Abstract)

M.L. Stein, University of Minnesota

E.J. Mundstock

pp. 844-847

PDF

HTML

A Fast Digital Computer Method for Recursive Estimation of the Mean (Abstract)

R.C. White, Dept. of Elec. Engrg. University of Arizona

pp. 847-850

PDF

HTML

Comment on "Computation of the Fast Walsh-Fourier Transform" (PDF)

K.W. Henderson, Stanford Linear Accelerator Center1 Stanford University

pp. 850-851

Hybrid Solution of Partial Differential Equations (Abstract)

H.S. Witsenhausen, Bell Telephone Labs., Inc.

pp. 851

PDF

HTML

Correction to "Pictorial Output with a Line Printer"¹(415) 851 (PDF)

pp. 851

Contributors (PDF)

pp. 852-853

B70-4 Theory of Scheduling (PDF)

H.S. Stone, Stanford University

pp. 854-855

B70-5 Theories of Abstract Automata (PDF)

C. De Renna e Souza, Information Sciences Program University of Hawaii

pp. 855-857

R70-32 Tessellation Automata (PDF)

E.G. Wagner, IBM Corporation T. J. Watson Research Center

pp. 857-858

R70-33 Fuzzy Events Realized by Finite Probabilistic Automata (PDF)

A. Paz, Technion

pp. 858

R70-34 Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic (PDF)

J.D. Bargainer, University of Houston

pp. 858

R70-35 Classes of Automata and Transitive Closure (PDF)

D. Tsichritzis, Dept. of Computer Sci. University of Toronto

pp. 858-859

R70-36 Maximin Automata (PDF)

S. Hedetniemi, Dept. of Computer Sci. University of Iowa

pp. 859

R70-37 Extensions of Asynchronous Circuits and the Delay Problem I. Good Extensions and the Delay Problem of the First Kind (PDF)

J.H. Shelly, IBM Sys. Develop. Div.

pp. 859

R70-38 The Time Required for Group Multiplication (PDF)

K.N. Levitt, Stanford Research Institute

pp. 859-860

Information for Authors (PDF)

pp. 877