Skip to main content Skip to navigation

Publications

View Publications

View Journals        View Books and Chapters        View Conferences        View Other

Other


  • Aziz, Haris, Paterson, Michael S.. 2008, Variation in weighted voting games, University of Warwick. Department of Computer Science, Report, View
  • Aziz, Haris, Paterson, Michael S., Leech, Dennis. 2007, Combinatorial and computational aspects of multiple weighted voting games, University of Warwick, Department of Economics, Working or Discussion paper, View
  • Aziz, H., Paterson, Michael S., Leech, Dennis. 2007, Efficient algorithm for designing weighted voting games, University of Warwick. Department of Computer Science, Report, View
  • Goldberg, Leslie Ann, Jerrum, Mark, Paterson, Michael S.. 2001, The computational complexity of two-state spin systems, University of Warwick. Department of Computer Science, Report, View
  • Ravindran, Somasundaram, Gibbons, Alan (Alan M.), Paterson, Michael S.. 2000, Dense edge-disjoint embedding of complete binary trees in interconnection networks. Theoretical Computer Science, Elsevier Science BV, pp. 325-342, Journal Item, View
  • Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath, Paterson, Michael S.. 2000, A bound on the capacity of backoff and acknowledgement-based protocols, University of Warwick. Department of Computer Science, Report, View
  • Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann, Paterson, Michael S.. 2000, Tight size bounds for packet headers in narrow meshes, University of Warwick. Department of Computer Science, Report, View
  • Cormode, Graham, Paterson, Michael S., Sahinalp, Suleyman Cenk, Vishkin, Uzi. 1999, Communication complexity of document exchange, University of Warwick. Department of Computer Science, Report, View
  • Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S., Srinavasan, Aravind. 1998, Contention resolution with constant expected delay, University of Warwick. Department of Computer Science, Report, View
  • Khanna, Sanjeev, Muthukrishnan, S., Paterson, Michael S.. 1998, On approximating rectangle tiling and packing, University of Warwick. Department of Computer Science, Report, View
  • Agarwala, Richa, Bafna, Vineet, Farach, Martin, Paterson, Michael S., Thorup, Mikkel. 1997, On the approximability of numerical taxonomy (fitting distances by tree metrics), University of Warwick. Department of Computer Science, Report, View
  • Goldberg, Leslie Ann, Paterson, Michael S., Srinavasan, Aravind, Sweedyk, Elizabeth. 1996, Better approximation guarantees for job-shop scheduling, University of Warwick. Department of Computer Science, Report, View
  • Miltersen, Peter Bro, Paterson, Michael S., Tarui, Jun. 1995, The asymptotic complexity of merging networks, University of Warwick. Department of Computer Science, Report, View
  • Ravindran, Somasundaram, Gibbons, Alan (Alan M.), Paterson, Michael S.. 1995, Dense edge-disjoint embedding of complete binary trees in interconnection networks, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Srinavasan, Aravind. 1995, Contention resolution with bounded delay, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Przytycka, Teresa. 1995, On the complexity of string folding, University of Warwick. Department of Computer Science, Report, View
  • Paterson, M. S., Dancik, V.. 1994, Longest common subsequences, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S.. 1993, Computer science seminars 1992/93, University of Warwick. Department of Computer Science, Report, View
  • Koizumi, Hirotaka, Maruoka, Akira, Paterson, Michael S.. 1993, Consistency of natural relations on sets, University of Warwick. Department of Computer Science, Report, View
  • Gibbons, Alan (Alan M.), Paterson, Michael S.. 1992, Dense edge-disjoint embedding of binary trees in the mesh, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Zwick, Uri. 1992, Shallow multiplication circuits and wise financial investments, University of Warwick. Department of Computer Science, Report, View
  • Fischer, Michael J., Paterson, Michael S.. 1992, Fishspear : a priority queue algorithm, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Zwick, Uri. 1991, Shrinkage of de Morgan formulae under restriction, University of Warwick. Department of Computer Science, Report, View
  • Zwick, Uri, Paterson, Michael S.. 1991, The memory game, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Zwick, Uri. 1990, Improved circuits and formulae for multiple addition, multiplication and symmetric Boolean functions, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Yao, F. Frances. 1990, Optimal binary space partitions for orthogonal objects, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Pippenger, Nicholas, Zwick, Uri. 1990, Optimal carry save networks, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Zwick, Uri. 1990, Shallow multiplication circuits, University of Warwick. Department of Computer Science, Report, View
  • Paterson, Michael S., Yao, F. Frances. 1989, Binary partitions with applications to hidden-surface removal and solid modelling, University of Warwick. Department of Computer Science, Report, View
  • Yao, F. Frances, Dobkin, David P., Edelsbrunner, Herbert, Paterson, Michael S.. 1988, Partitioning space for range queries, University of Warwick. Department of Computer Science, Report, View
Next       

Page 1 of 2