British Council

Koizumi, Hirotaka, Maruoka, Akira and Paterson, Michael S. (1993) Consistency of natural relations on sets. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

CITO

Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2000) Tight size bounds for packet headers in narrow meshes. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Engineering and Physical Sciences Research Council (EPSRC)

Aziz, Haris and Paterson, Michael S. (2008) Variation in weighted voting games. Coventry: University of Warwick. Department of Computer Science. (Unpublished)

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

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 (No.823).

Goldberg, Leslie Ann, Jerrum, Mark and Paterson, Michael S. (2001) The computational complexity of two-state spin systems. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2000) Tight size bounds for packet headers in narrow meshes. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinavasan, Aravind (1998) Contention resolution with constant expected delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

European Commission (EC)

Paterson, Michael S., Pippenger, Nicholas and Zwick, Uri (1990) Optimal carry save networks. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

European Strategic Programme of Research and Development in Information Technology (ESPRIT)

Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2000) Tight size bounds for packet headers in narrow meshes. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinavasan, Aravind (1998) Contention resolution with constant expected delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Khanna, Sanjeev, Muthukrishnan, S. and Paterson, Michael S. (1998) On approximating rectangle tiling and packing. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Agarwala, Richa, Bafna, Vineet, Farach, Martin, Paterson, Michael S. and Thorup, Mikkel (1997) On the approximability of numerical taxonomy (fitting distances by tree metrics). University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Srinavasan, Aravind (1995) Contention resolution with bounded delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Miltersen, Peter Bro, Paterson, Michael S. and Tarui, Jun (1995) The asymptotic complexity of merging networks. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Ravindran, Somasundaram, Gibbons, Alan (Alan M.) and Paterson, Michael S. (1995) Dense edge-disjoint embedding of complete binary trees in interconnection networks. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Przytycka, Teresa (1995) On the complexity of string folding. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Fischer, Michael J. and Paterson, Michael S. (1992) Fishspear : a priority queue algorithm. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Gibbons, Alan (Alan M.) and Paterson, Michael S. (1992) Dense edge-disjoint embedding of binary trees in the mesh. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Zwick, Uri (1992) Shallow multiplication circuits and wise financial investments. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Zwick, Uri and Paterson, Michael S. (1991) The memory game. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Zwick, Uri (1991) Shrinkage of de Morgan formulae under restriction. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Zwick, Uri (1990) Shallow multiplication circuits. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Zwick, Uri (1990) Improved circuits and formulae for multiple addition, multiplication and symmetric Boolean functions. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Fifth Framework Programme (European Commission) (FP5)

Goldberg, Leslie Ann, Jerrum, Mark and Paterson, Michael S. (2001) The computational complexity of two-state spin systems. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

London Mathematical Society

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

National ICT R&D Fund (Pakistan)

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 (No.823).

National Science Foundation (U.S.) (NSF)

Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S. (2000) A bound on the capacity of backoff and acknowledgement-based protocols. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Agarwala, Richa, Bafna, Vineet, Farach, Martin, Paterson, Michael S. and Thorup, Mikkel (1997) On the approximability of numerical taxonomy (fitting distances by tree metrics). University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Fischer, Michael J. and Paterson, Michael S. (1992) Fishspear : a priority queue algorithm. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Schönhage, Arnold, Paterson, Michael S. and Pippenger, Nicholas (1975) Finding the median. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

National University of Singapore

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinavasan, Aravind (1998) Contention resolution with constant expected delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Natural Sciences and Engineering Research Council of Canada (NSERC)

Adler, Micah, Fitch, Faith, Goldberg, Leslie Ann and Paterson, Michael S. (2000) Tight size bounds for packet headers in narrow meshes. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S., Pippenger, Nicholas and Zwick, Uri (1990) Optimal carry save networks. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Pakistan

Aziz, Haris and Paterson, Michael S. (2008) Variation in weighted voting games. Coventry: University of Warwick. Department of Computer Science. (Unpublished)

Science Research Council (Great Britain) (SRC)

Munro, J. Ian and Paterson, Michael S. (1978) Selection and sorting with limited storage. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Science and Engineering Research Council (Great Britain) (SERC)

Ravindran, Somasundaram, Gibbons, Alan (Alan M.) and Paterson, Michael S. (1995) Dense edge-disjoint embedding of complete binary trees in interconnection networks. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Fischer, Michael J. and Paterson, Michael S. (1992) Fishspear : a priority queue algorithm. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S., Pippenger, Nicholas and Zwick, Uri (1990) Optimal carry save networks. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Paterson, Michael S. and Yao, F. Frances (1990) Optimal binary space partitions for orthogonal objects. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Paterson, Michael S. and Zwick, Uri (1990) Improved circuits and formulae for multiple addition, multiplication and symmetric Boolean functions. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Paterson, Michael S. and Razborov, Alexander (1988) The set of minimal braids is co-NP-complete. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

McColl, William Finlay and Paterson, Michael S. (1988) Planar acyclic computation. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Yao, F. Frances, Dobkin, David P., Edelsbrunner, Herbert and Paterson, Michael S. (1988) Partitioning space for range queries. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

United States. Department of Energy

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinavasan, Aravind (1998) Contention resolution with constant expected delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

United States. Office of Naval Research

Fischer, Michael J. and Paterson, Michael S. (1992) Fishspear : a priority queue algorithm. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

University of Warwick. Centre for Discrete Mathematics and Its Applications

Aziz, Haris and Paterson, Michael S. (2008) Variation in weighted voting games. Coventry: University of Warwick. Department of Computer Science. (Unpublished)

University of Warwick. Centre for Discrete Mathematics and its Applications (DIMAP)

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

Universiṭat Tel-Aviv‏

Paterson, Michael S., Pippenger, Nicholas and Zwick, Uri (1990) Optimal carry save networks. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Universiṭat Tel-Aviv

Paterson, Michael S. and Zwick, Uri (1990) Improved circuits and formulae for multiple addition, multiplication and symmetric Boolean functions. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Xerox Corporation

Yao, F. Frances, Dobkin, David P., Edelsbrunner, Herbert and Paterson, Michael S. (1988) Partitioning space for range queries. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)