Mike Paterson

Some recent publications

• Haris Aziz, Yoram Bachrach, Edith Elkind and Mike Paterson, False-name manipulations in weighted voting games, Journal of Artificial Intelligence Research, 40(1), 57-93 (2011),
  


• Mike Paterson, Yuval Peres, Peter Winkler, Mikkel Thorup and Uri Zwick, Maximum overhang, American Mathematical Monthly, 116(9), 765-787 (2009),
  


• Mike Paterson and Uri Zwick, Overhang, American Mathematical Monthly, 116(1), 19-44 (2009),
  


• Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond and Shigeru Yamashita, Polynomial-time construction of linear network coding, Automata, Languages and Programming, Lecture Notes in Computer Science 5125, 271-282 (2008), (DOI: 10.1007/978-3-540-70575-8_23)
  
  
• Martin Dyer, Leslie Ann Goldberg and Mike Paterson, On counting homomorphisms to directed acyclic graphs, J. ACM 54, 6, Article 27 (December 2007) http://doi.acm.org/10.1145/1314690.1314691
  
  
• Leslie Ann Goldberg, Markus Jalsenius, Russell Martin and Mike Paterson, Improved mixing bounds for the anti-ferromagnetic Potts Model on Z^2, LMS J. Comput. Math. 9 (2006) 1-20.


• Leslie Ann Goldberg, Russell Martin and Mike Paterson, Strong spatial mixing for lattice graphs with fewer colours, SICOMP, 35(2) 486-517 (2005). (Preliminary version FOCS 2004.)


• Michael Albert and Mike Paterson, Bounds for the growth rate of meander numbers, Journal of Combinatorial Theory, Series A, 112(2), 250-262 (2005),
  doi:1016/j.jcta.2005.02.006


• Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan and Mike Paterson, A bound on the capacity of backoff and acknowledgement-based protocols, SIAM J. Computing, 88 (2004) 313-331.