# The Library

### Browse by Warwick Author

Up a level |

Number of items:

**65**.## 2011

Aziz, Haris, Bachrach, Yoram, Elkind, Edith and Paterson, Michael S.
(2011)
*False-name manipulations in weighted voting games.*
Journal of Artificial Intelligence, Vol.40
.
pp. 57-93.
doi:10.1613/jair.3166

## 2009

Paterson, Michael S., Peres, Y., Thorup, Mikkel, Winkler, P. and Zwick, Uri
(2009)
*Maximum overhang.*
American Mathematical Monthly, Vol.116
(No.9).
pp. 765-787.
doi:10.4169/000298909x474855

Paterson, Michael S. and Zwick, Uri
(2009)
*Overhang.*
American Mathematical Monthly, Vol.116
(No.1).
pp. 19-44.
doi:10.4169/000298909x474855

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.
ISBN 978-3-642-02157-2.
ISSN 0302-9743.
doi:10.1007/978-3-642-02158-9_7

## 2008

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

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.
ISBN 978-988-98671-9-5.
ISSN 2078-0966.

Paterson, Michael S., 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.
ISBN 978-0-898716-47-4.

Iwama, Kazuo, Nishimura, Harumichi, Paterson, Michael S., 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.
ISSN 0302-9743.
doi:10.1007/978-3-540-70575-8_23

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

## 2007

Dyer, Martin, Goldberg, Leslie Ann and Paterson, Michael S.
(2007)
*On counting homomorphisms to directed acyclic graphs.*
Journal of the ACM, Vol.54
(No.6).
Article: 27.
doi:10.1145/1314690.1314691

Aziz, H., Paterson, Michael S. and Leech, Dennis
(2007)
*Efficient algorithm for designing weighted voting games.*
University of Warwick. Department of Computer Science. (Department of Computer Science Research Report).

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).

Aziz, Haris, Paterson, Michael S. and Leech, Dennis
(2007)
*Efficient algorithm for designing weighted voting games.*
In: 11th IEEE International Multitopic Conference, Lahore, Pakistan, 28-30 Dec 2007. Published in: IEEE International Multitopic Conference, 2007. INMIC 2007.
pp. 211-216.
ISBN 9781424415526.
doi:10.1109/INMIC.2007.4557718

## 2006

Dyer, Martin, Goldberg, Leslie Ann and Paterson, Michael S.
(2006)
*On counting homomorphisms to directed acyclic graphs.*
In: 33rd International Colloquium on Automata, Languages and Programming, Venice, Italy, 10-14 Jul 2006. Published in: Lecture Notes in Computer Science, Volume 4051
pp. 38-49.
ISBN 3-540-35904-4.
ISSN 0302-9743.
doi:10.1007/11786986_5

Paterson, Michael S. 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.
ISBN 978-0-89871-605-4.
ISSN 9780898716054.
doi:10.1145/1109557.1109584

Jurdzinski, Marcin, Paterson, Michael S. 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.
ISBN 978-0-89871-605-4.
ISSN 9780898716054.

## 2003

Goldberg, Leslie Ann, Jerrum, Mark and Paterson, Michael S.
(2003)
*The computational complexity of two-state spin systems.*
Random Structures & Algorithms, Volume 23
(Number 2).
pp. 133-154.
doi:10.1002/rsa.10090

## 2002

Adler, Micah, Fich, Faith, Goldberg, Leslie Ann and Paterson, Michael S.
(2002)
*Tight size bounds for packet headers in narrow meshes.*
In: Montanari, U. and Rolim, J. D. P. and Welzl, E., (eds.)
Automata, Languages and Programming.
Lecture Notes in Computer Science, Volume 1853
.
Springer Berlin Heidelberg, pp. 756-767.
ISBN 9783540677154

## 2001

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, Paterson, Michael S., Srinivasan, Aravind and Sweedyk, Elizabeth
(2001)
*Better approximation guarantees for job-shop scheduling.*
SIAM Journal on Discrete Mathematics, Volume 14
(Number 1).
pp. 67-92.
doi:10.1137/S0895480199326104

## 2000

Goldberg, Leslie Ann, MacKenzie, Phil, Paterson, Michael S. and Srinivasan, Aravind
(2000)
*Contention resolution with constant expected delay.*
Journal of the ACM, Volume 47
(Number 6).
pp. 1048-1096.

Ravindran, Somasundaram, Gibbons, Alan (Alan M.) and Paterson, Michael S.
(2000)
*Dense edge-disjoint embedding of complete binary trees in interconnection networks.*
Theoretical Computer Science, Volume 249
(Number 2).
pp. 325-342.

Goldberg, Leslie Ann, Jerrum, Mark, Kannan, Sampath and Paterson, Michael S.
(2000)
*A bound on the capacity of backoff and acknowledgement-based protocols.*
In: Montanari, U. and Rolim, J. D. P and Welzl, E, (eds.)
Automata, Languages and Programming.
Lecture Notes in Computer Science, Volume 1853
.
Springer Berlin Heidelberg, pp. 705-716.
ISBN 9783540677154

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)

## 1999

Cormode, Graham, Paterson, Michael S., Sahinalp, Suleyman Cenk and Vishkin, Uzi
(1999)
*Communication complexity of document exchange.*
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
(1999)
*On the approximability of numerical taxonomy (fitting distances by tree metrics).*
SIAM Journal on Computing, Volume 28
(Number 3).
pp. 1073-1085.

## 1998

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)

## 1997

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)

Goldberg, Leslie Ann, Paterson, Michael S., Srinivasan, Aravind and Sweedyk, Elizabeth
(1997)
*Better approximation guarantees for job-shop scheduling.*
In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, New Orleans, LA, 05-07 Jan 1997. Published in: SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
pp. 599-608.
ISBN 0898713900.

## 1996

Paterson, Michael S. and Przytycka, Teresa
(1996)
*On the complexity of string folding.*
Discrete Applied Mathematics, Volume 71
(Number 1-3).
pp. 217-230.

Goldberg, Leslie Ann, Paterson, Michael S., Srinavasan, Aravind and Sweedyk, Elizabeth
(1996)
*Better approximation guarantees for job-shop scheduling.*
University of Warwick. Department of Computer Science. (Department of Computer Science research report).
(Unpublished)

Miltersen, Peter Bro, Paterson, Michael S. and Tarui, Jun
(1996)
*The asymptotic complexity of merging networks.*
Journal of the ACM, Volume 43
(Number 1).
pp. 147-165.

## 1995

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)

Paterson, Michael S. and Srinivasan, Aravind
(1995)
*Contention resolution with bounded delay.*
In: 36th Annual Symposium on Foundations of Computer Science (FOCS 95), Milwaukee, WI, 23-25 Oct 1995. Published in: 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings.
pp. 104-113.
ISBN 0818671831.
ISSN 0272-5428.

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)

## 1994

Fischer, Michael J. and Paterson, Michael S.
(1994)
*Fishspear : a priority queue algorithm.*
Journal of the ACM, Volume 41
(Number 1).
pp. 3-30.
doi:10.1145/174644.174645

## 1993

Zwick, Uri and Paterson, Michael S.
(1993)
*The memory game.*
Theoretical Computer Science, Volume 110
(Number 1).
pp. 169-196.
doi:10.1016/0304-3975(93)90355-W

Paterson, Michael S.
(1993)
*Computer science seminars 1992/93.*
University of Warwick. Department of Computer Science. (Department of Computer Science research report).
(Unpublished)

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)

## 1992

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)

## 1991

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)

## 1990

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., 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)

## 1989

Paterson, Michael S. and Yao, F. Frances
(1989)
*Binary partitions with applications to hidden-surface removal and solid modelling.*
Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report).
(Unpublished)

## 1988

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)

## 1987

Paterson, Michael S.
(1987)
*Improved sorting networks with O(log n) depth.*
Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report).
(Unpublished)

## 1986

Paterson, Michael S.
(1986)
*Universal chains and wiring layouts.*
Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report).
(Unpublished)

## 1983

Daykin, D. E., Daykin, J. W. and Paterson, Michael S.
(1983)
*On log concavity for order-preserving and order-non-reversing maps of partial orders.*
Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report).
(Unpublished)

## 1978

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)

## 1976

Paterson, Michael S.
(1976)
*New bounds for formula size.*
University of Warwick. Department of Computer Science. (Theory of Computation Report).
(Unpublished)

## 1975

Valiant, Leslie and Paterson, Michael S.
(1975)
*Circuit size is nonlinear in depth.*
University of Warwick. Department of Computer Science. (Theory of Computation Report).
(Unpublished)

McColl, William Finlay and Paterson, Michael S.
(1975)
*The depth of all Boolean functions.*
University of Warwick. Department of Computer Science. (Theory of Computation 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)

## 1974

Paterson, Michael S.
(1974)
*Complexity of monotone networks for Boolean matrix product.*
University of Warwick. Department of Computer Science. (Theory of Computation Report).
(Unpublished)

This list was generated on

**Mon Mar 19 21:59:48 2018 GMT**.