Technical report
Author(s)
Bibliographic Information
Technical report
Digital Systems Laboratory
Princeton University
Search this Book/Journal
Note
Published in 1967-: Princeton University. Computer Sciences Laboratory
-
41
- Simple deterministic languages
-
A.J. Korenjak and J.E. Hopcroft
Princeton University 1966 Technical report / Digital Systems Laboratory no. 51
Available at 1 libraries
-
42
- Introduction to the theory of speed independent asynchronous switching circuits
-
A.D. Hall
Princeton University 1966 Technical report / Digital Systems Laboratory no. 50
Available at 1 libraries
-
43
- The synthesis of three-level logic networks
-
Antonio Grasselli and James F. Gimpel
Princeton University 1966 Technical report / Digital Systems Laboratory no. 49
Available at 1 libraries
-
44
- Finite memory span covers of incompletely specified sequential networks
-
Antonio Grasselli
Princeton University 1965 Technical report / Digital Systems Laboratory no. 48
Available at 1 libraries
-
45
- Error propagation and definite decoding of recurrent codes
-
J.P. Robinson
Princeton University 1965 Technical report / Digital Systems Laboratory no. 47
Available at 2 libraries
-
46
- Binary encoding of analog signals for noisy channels
-
A.J. Bernstein, K. Steiglitz, J.E. Hopcroft
Princeton University 1965 Technical report / Digital Systems Laboratory no. 46
Available at 1 libraries
-
47
- Near optimal single synchronization error correcting code
-
J.D. Ullman
Princeton University 1965 Technical report / Digital Systems Laboratory no. 45
Available at 1 libraries
-
48
- On the capabilities of codes to correct synchronization errors
-
J.D. Ullman
Princeton University 1965 Technical report / Digital Systems Laboratory no. 44
Available at 1 libraries
-
49
- Self orthogonal codes
-
J.P. Robinson and A.J. Bernstein
Princeton University 1965 Technical report / Digital Systems Laboratory no. 43
Available at 1 libraries
-
50
- A conjectured minimax theorem for directed graphs
-
Daniel H. Younger
Princeton University 1965 Technical report / Digital Systems Laboratory no. 42
Available at 1 libraries
-
51
- An upper bound on the minimum distance of a convolutional code
-
J.P. Robinson
Princeton University 1965 Technical report / Digital Systems Laboratory no. 41
Available at 1 libraries
-
52
- A reduction technique for prime implicant tables
-
James F. Gimpel
Princeton University 1964 Technical report / Digital Systems Laboratory no. 40
Available at 1 libraries
-
53
- Implication techniques for Boolean functions
-
R.S. Gaines
Princeton University 1964 Technical report / Digital Systems Laboratory no. 39
Available at 1 libraries
-
54
- On the minimum stage realization of switching functions using logic gates with limited fan-in
-
G.L. Hicks and E.B. Eichelberger
Princeton University 1964 Technical report / Digital Systems Laboratory no. 38
Available at 1 libraries
-
55
- Reducing variable dependency in combinational circuits
-
A.J. Bernstein
Princeton University 1964 Technical report / Digital Systems Laboratory no. 37
Available at 1 libraries
-
56
- On determination of the irredundant covers of a prime implicant table
-
Amarendra Mukhopadhyay
Princeton University 1964 Technical report / Digital Systems Laboratory no. 36
Available at 1 libraries
-
57
- A method of producing a Boolean function having an arbitrarily prescribed prime implicant table
-
J.F. Gimpel
Princeton Universtiy 1964 Technical report / Digital Systems Laboratory no. 35
Available at 1 libraries
-
58
- Logical design theory of NOR gate networks with no complemented inputs
-
by E.J. McCluskey
Princeton University 1963 Technical report / Digital Systems Laboratory no. 34
Available at 1 libraries
-
59
- Symbol manipulation by recursion
-
Herbert Schorr
Princeton University 1962 Technical report / Digital Systems Laboratory no. 31
Available at 1 libraries
-
60
- Canonical regular expressions and minimal state graphs for definite events
-
J.A. Brzozowski
Princeton University 1962 Technical report / Digital Systems Laboratory no. 22
Available at 2 libraries