Aziz, Haris, Bachrach, Yoram, Elkind, Edith and Paterson, Mike. (2011) False-name manipulations in weighted voting games. Journal of Artificial Intelligence, Vol.40 . pp. 57-93. ISSN 1076-9757

Paterson, Michael S., Peres, Y. (Yuval), Thorup, Mikkel, Winkler, P. (Peter), 1946- and Zwick, Uri, 1961-. (2009) Maximum overhang. American Mathematical Monthly, Vol.116 (No.9). pp. 765-787. ISSN 0002-9890

Paterson, Michael S. and Zwick, Uri, 1961-. (2009) Overhang. American Mathematical Monthly, Vol.116 (No.1). pp. 19-44. ISSN 0002-9890

Aziz, Haris, Lachish, Oded, Paterson, Michael S. and Savani, Rahul (2009) Power indices in spanning connectivity games. In: 5th International Conference on Algorithmic Aspects in Information and Management, San Francisco, CA, June 15-17, 2009. Published in: Lecture Notes in Computer Science, Vol.5564 pp. 55-67.

Aziz, Haris and Paterson, Michael S. (2008) Classification of computationally tractable weighted voting games. In: World Congress on Engineering 2008, Imperial Coll London, London, England, Jul 02-04, 2008. Published in: World Congress on Engineering : WCE 2008 : 2-4 July, 2008, Imperial College London, London, U.K., Vol.1-2 pp. 129-134.

Paterson, Mike, Peres, Yuval, Thorup, Mikkel, Winkler, Peter and Zwick, Uri (2008) Maximum overhang. In: 19th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, Jan 20-22, 2008. Published in: Proceedings of the 19th Annual ACM - SIAM Symposium on Discrete Algorithms pp. 756-765.

Iwama, Kazuo, Nishimura, Harumichi, Paterson, Mike, Raymond, Rudy and Yamashita, Shigeru (2008) Polynomial-time construction of linear network coding. In: ICALP 2008: 35th International Colloquium on Automata, Languages and Programming , Reykjavik, Iceland, 6 - 13 Jul 2008 . Published in: Lecture Notes in Computer Science, Vol.5125 pp. 271-282.

Jurdzinski, Marcin, Paterson, Michael S. and Zwick, Uri, 1961-. (2008) A deterministic subexponential algorithm for solving parity games. SIAM Journal on Computing, Vol.38 (No.4). pp. 1519-1532. ISSN 0097-5397

Dyer, Martin, Goldberg, Leslie Ann and Paterson, Mike. (2007) On counting homomorphisms to directed acyclic graphs. Journal of the ACM, Vol.54 (No.6). Article: 27. ISSN 0004-5411

Aziz, Haris, Paterson, Michael S. and Leech, Dennis (2007) Combinatorial and computational aspects of multiple weighted voting games. Working Paper. Coventry: University of Warwick, Department of Economics. (Warwick economic research papers.

Paterson, Mike and Zwick, Uri (2006) Overhang. In: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, JAN, 2006. Published in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 231-240.

Jurdzinski, Marcin, Paterson, Mike and Zwick, Uri (2006) A deterministic subexponential algorithm for solving parity games. In: 17th ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, Jan 2006. Published in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 117-123.

Paterson, Michael S. (1976) New bounds for formula size. Coventry, UK: Department of Computer Science..

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

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

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