Monograph

Aziz, H. and Paterson, M.S. (2008) Variation in weighted voting games. Technical Report. Department of Computer Science, Coventry, UK.

Aziz, H., Paterson, M.S. and Leech, D. (2007) Efficient algorithm for designing weighted voting games. Technical Report. Department of Computer Science, Coventry, UK.

Goldberg, L.A., Jerrum, M. and Paterson, M.S. (2001) The computational complexity of two-state spin systems. Technical Report. Department of Computer Science, Coventry, UK.

Goldberg, L.A., Kelk, S. and Paterson, M.S. (2001) The complexity of choosing an H-colouring (nearly) uniformly at random. Technical Report. Department of Computer Science, Coventry, UK.

Adler, M., Fitch, F., Goldberg, L.A. and Paterson, M.S. (2000) Tight size bounds for packet headers in narrow meshes. Technical Report. Department of Computer Science, Coventry, UK.

Goldberg, L.A., Jerrum, M., Kannan, S. and Paterson, M.S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. Technical Report. Department of Computer Science, Coventry, UK.

Cormode, G., Paterson, M.S., Sahinalp, S.C. and Vishkin, U. (1999) Communication complexity of document exchange. Technical Report. Department of Computer Science, Coventry, UK.

Goldberg, L.A., MacKenzie, P.D., Paterson, M.S. and Srinavasan, A. (1998) Contention Resolution with Constant Expected Delay. Technical Report. Department of Computer Science, Coventry, UK.

Khanna, S., Muthukrishnan, S. and Paterson, M.S. (1998) On approximating rectangle tiling and packing. Technical Report. Department of Computer Science, Coventry, UK.

Agarwala, R., Bafna, V., Farach, M., Paterson, M.S. and Thorup, M. (1997) On the approximability of numerical taxonomy (fitting distances by tree metrics). Technical Report. Department of Computer Science, Coventry, UK.

Goldberg, L.A., Paterson, M.S., Srinavasan, A. and Sweedyk, E. (1996) Better approximation guarantees for job-shop scheduling. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Srinavasan, A. (1995) Contention resolution with bounded delay. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Przytycka, T. (1995) On the complexity of string folding. Technical Report. Department of Computer Science, Coventry, UK.

Ravindran, S., Gibbons, A.M. and Paterson, M.S. (1995) Dense edge-disjoint embedding of complete binary trees in interconnection networks. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. (1993) Computer Science seminars 1992/93. Technical Report. Department of Computer Science, Coventry, UK.

Koizumi, H., Maruoka, A. and Paterson, M.S. (1993) Consistency of natural relations on sets. Technical Report. Department of Computer Science, Coventry, UK.

Fischer, M.J. and Paterson, M.S. (1992) Fishspear: a priority queue algorithm. Technical Report. Department of Computer Science, Coventry, UK.

Miltersen, P.B., Paterson, M.S. and Tarui, J. (1992) The asymptotic complexity of merging networks. Technical Report. Department of Computer Science, Coventry, UK.

Gibbons, A.M. and Paterson, M.S. (1992) Dense edge-disjoint embedding of binary trees in the mesh. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Zwick, U. (1992) Shallow multiplication circuits and wise financial investments. Technical Report. Department of Computer Science, Coventry, UK.

Zwick, U. and Paterson, M.S. (1991) The memory game. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Zwick, U. (1991) Shrinkage of de Morgan formulae under restriction. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Zwick, U. (1990) Shallow multiplication circuits. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S., Pippenger, N. and Zwick, U. (1990) Optimal carry save networks. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Yao, F.F. (1990) Optimal binary space partitions for orthogonal objects. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Zwick, U. (1990) Improved circuits and formulae for multiple addition, multiplication and symmetric Boolean functions. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Yao, F.F. (1989) Binary partitions with applications to hidden-surface removal and solid modelling. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. and Razborov, A.A. (1988) The set of minimal braids is co-NP-complete. Technical Report. Department of Computer Science, Coventry, UK.

McColl, W.F., Paterson, M.S. and Bowditch, B.H. (1988) Planar acyclic computation. Technical Report. Department of Computer Science, Coventry, UK.

Yao, F.F., Dobkin, D.P., Edelsbrunner, H. and Paterson, M.S. (1988) Partitioning space for range queries. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. (1987) Improved sorting networks with O(log n) depth. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. (1986) Universal chains and wiring layouts. Technical Report. Department of Computer Science, Coventry, UK.

Daykin, D.E., Daykin, J.W. and Paterson, M.S. (1983) On log concavity for order-preserving and order-non-reversing maps of partial orders. Technical Report. Department of Computer Science, Coventry, UK.

Munro, J.I. and Paterson, M.S. (1978) Selection and sorting with limited storage. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. (1976) New bounds for formula size. Technical Report. Department of Computer Science, Coventry, UK.

Valiant, L.G. and Paterson, M.S. (1975) Circuit size is nonlinear in depth. Technical Report. Department of Computer Science, Coventry, UK.

McColl, W.F. and Paterson, M.S. (1975) The depth of all Boolean functions. Technical Report. Department of Computer Science, Coventry, UK.

Schönhage, A., Paterson, M.S. and Pippenger, N. (1975) Finding the median. Technical Report. Department of Computer Science, Coventry, UK.

Paterson, M.S. (1974) Complexity of monotone networks for Boolean matrix product. Technical Report. Department of Computer Science, Coventry, UK.