Michael S. Paterson

According to our database, Michael S. Paterson authored at least 7 papers between 1970 and 1991.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1991

Shallow multiplication circuits.

Michael S. Paterson, Uri Zwick

Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

1989

Secret Bit Transmission Using a Random Deal of Cards.

Michael J. Fischer, Michael S. Paterson, Charles Rackoff

Proceedings of the Distributed Computing And Cryptography, 1989

1984

On log concavity for order-preserving maps of partial orders.

David E. Daykin, Jacqueline W. Daykin, Michael S. Paterson

Discret. Math., 1984

1976

Completely Autoreducible Degrees.

Carl G. Jockusch Jr., Michael S. Paterson

Math. Log. Q., 1976

1972

Decision problems in computational models.

Michael S. Paterson

Proceedings of ACM Conference on Proving Assertions About Programs, 1972

Efficient Iterations for Algebraic Numbers.

Michael S. Paterson

Proceedings of a symposium on the Complexity of Computer Computations, 1972

1970

Comparative schematology.

Michael S. Paterson, Carl E. Hewitt

Proceedings of the Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, 1970