Skip to main content Skip to navigation

Publications

View Publications

View Journals        View Books and Chapters        View Conferences        View Other

Journals


  • Aziz, Haris, Bachrach, Yoram, Elkind, Edith, Paterson, Michael S.. 2011. False-name manipulations in weighted voting games. Journal of Artificial Intelligence, Vol.40, pp. 57-93, View
  • Paterson, Michael S., Zwick, Uri. 2009. Overhang. American Mathematical Monthly, Vol.116 (No.1), pp. 19-44, View
  • Paterson, Michael S., Peres, Y., Thorup, Mikkel, Winkler, P., Zwick, Uri. 2009. Maximum overhang. American Mathematical Monthly, Vol.116 (No.9), pp. 765-787, View
  • Jurdzinski, Marcin, Paterson, Michael S., Zwick, Uri. 2008. A deterministic subexponential algorithm for solving parity games. SIAM Journal on Computing, Vol.38 (No.4), pp. 1519-1532, View
  • Dyer, Martin, Goldberg, Leslie Ann, Paterson, Michael S.. 2007. On counting homomorphisms to directed acyclic graphs. Journal of the ACM, Vol.54 (No.6), View
  • Goldberg, Leslie Ann, Jerrum, Mark, Paterson, Michael S.. 2003. The computational complexity of two-state spin systems. Random Structures & Algorithms, Volume 23 (Number 2), pp. 133-154, View
  • Goldberg, Leslie Ann, Paterson, Michael S., Srinivasan, Aravind, Sweedyk, Elizabeth. 2001. Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics, Volume 14 (Number 1), pp. 67-92, View
  • Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S., Srinivasan, Aravind. 2000. Contention resolution with constant expected delay. Journal of the ACM, Volume 47 (Number 6), pp. 1048-1096, View
  • Agarwala, Richa, Bafna, Vineet, Farach, Martin, Paterson, Michael S., Thorup, Mikkel. 1999. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing, Volume 28 (Number 3), pp. 1073-1085, View
  • Paterson, Michael S., Przytycka, Teresa. 1996. On the complexity of string folding. Discrete Applied Mathematics, Volume 71 (Number 1-3), pp. 217-230, View
  • Miltersen, Peter Bro, Paterson, Michael S., Tarui, Jun. 1996. The asymptotic complexity of merging networks. Journal of the ACM, Volume 43 (Number 1), pp. 147-165, View
  • Fischer, Michael J., Paterson, Michael S.. 1994. Fishspear : a priority queue algorithm. Journal of the ACM, Volume 41 (Number 1), pp. 3-30, View
  • Zwick, Uri, Paterson, Michael S.. 1993. The memory game. Theoretical Computer Science, Volume 110 (Number 1), pp. 169-196, View




Page 1 of 1