Comparative schematology. - Michael S. Paterson; Carl E. Hewitt (Project MAC Conference on Concurrent Systems and Parallel Computation, 1970)

Efficient Iterations for Algebraic Numbers. - Michael S. Paterson (Complexity of Computer Computations, 1972)

Decision problems in computational models. - Michael S. Paterson (Proving Assertions About Programs, 1972)

Completely Autoreducible Degrees. - Carl G. Jockusch Jr.; Michael S. Paterson (Math. Log. Q., 1976)

On log concavity for order-preserving maps of partial orders. - David E. Daykin; Jacqueline W. Daykin; Michael S. Paterson (Discret. Math., 1984)

Secret Bit Transmission Using a Random Deal of Cards. - Michael J. Fischer; Michael S. Paterson; Charles Rackoff (Distributed Computing And Cryptography, 1989)

Shallow multiplication circuits. - Michael S. Paterson; Uri Zwick (IEEE Symposium on Computer Arithmetic, 1991)