BibTeX records: Mike Paterson

download as .bib file

@article{DBLP:journals/tamm/IwamaP22,
  author       = {Kazuo Iwama and
                  Mike Paterson},
  title        = {Bounded Hanoi},
  journal      = {Am. Math. Mon.},
  volume       = {129},
  number       = {4},
  pages        = {303--319},
  year         = {2022},
  url          = {https://doi.org/10.1080/00029890.2022.2026166},
  doi          = {10.1080/00029890.2022.2026166},
  timestamp    = {Sat, 10 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/IwamaP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzumajKP21,
  author       = {Artur Czumaj and
                  George Kontogeorgiou and
                  Mike Paterson},
  editor       = {Nikhil Bansal and
                  Emanuela Merelli and
                  James Worrell},
  title        = {Haystack Hunting Hints and Locker Room Communication},
  booktitle    = {48th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {198},
  pages        = {58:1--58:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2021.58},
  doi          = {10.4230/LIPICS.ICALP.2021.58},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/CzumajKP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ChistikovLPT20,
  author       = {Dmitry Chistikov and
                  Grzegorz Lisowski and
                  Mike Paterson and
                  Paolo Turrini},
  title        = {Convergence of Opinion Diffusion is PSPACE-Complete},
  booktitle    = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
                  2020, The Thirty-Second Innovative Applications of Artificial Intelligence
                  Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
                  Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
                  February 7-12, 2020},
  pages        = {7103--7110},
  publisher    = {{AAAI} Press},
  year         = {2020},
  url          = {https://doi.org/10.1609/aaai.v34i05.6197},
  doi          = {10.1609/AAAI.V34I05.6197},
  timestamp    = {Mon, 04 Sep 2023 12:29:24 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/ChistikovLPT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-06442,
  author       = {Dmitry Chistikov and
                  Olga Goulko and
                  Adrian Kent and
                  Mike Paterson},
  title        = {Globe-hopping},
  journal      = {CoRR},
  volume       = {abs/2001.06442},
  year         = {2020},
  url          = {https://arxiv.org/abs/2001.06442},
  eprinttype    = {arXiv},
  eprint       = {2001.06442},
  timestamp    = {Sat, 26 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-06442.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-11448,
  author       = {Artur Czumaj and
                  George Kontogeorgiou and
                  Mike Paterson},
  title        = {Combinatorial Communication in the Locker Room},
  journal      = {CoRR},
  volume       = {abs/2008.11448},
  year         = {2020},
  url          = {https://arxiv.org/abs/2008.11448},
  eprinttype    = {arXiv},
  eprint       = {2008.11448},
  timestamp    = {Wed, 16 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2008-11448.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-09864,
  author       = {Dmitry Chistikov and
                  Grzegorz Lisowski and
                  Mike Paterson and
                  Paolo Turrini},
  title        = {Convergence of Opinion Diffusion is PSPACE-complete},
  journal      = {CoRR},
  volume       = {abs/1912.09864},
  year         = {2019},
  url          = {http://arxiv.org/abs/1912.09864},
  eprinttype    = {arXiv},
  eprint       = {1912.09864},
  timestamp    = {Sat, 26 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1912-09864.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EpsteinP17,
  author       = {David B. A. Epstein and
                  Mike Paterson},
  title        = {Maximizing the area of intersection of rectangles},
  journal      = {CoRR},
  volume       = {abs/1703.08658},
  year         = {2017},
  url          = {http://arxiv.org/abs/1703.08658},
  eprinttype    = {arXiv},
  eprint       = {1703.08658},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/EpsteinP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HansenPZ14,
  author       = {Thomas Dueholm Hansen and
                  Mike Paterson and
                  Uri Zwick},
  editor       = {Chandra Chekuri},
  title        = {Improved upper bounds for Random-Edge and Random-Jump on abstract
                  cubes},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {874--881},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.65},
  doi          = {10.1137/1.9781611973402.65},
  timestamp    = {Tue, 02 Feb 2021 17:07:40 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/HansenPZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AzizBEP14,
  author       = {Haris Aziz and
                  Yoram Bachrach and
                  Edith Elkind and
                  Mike Paterson},
  title        = {False-Name Manipulations in Weighted Voting Games},
  journal      = {CoRR},
  volume       = {abs/1401.3869},
  year         = {2014},
  url          = {http://arxiv.org/abs/1401.3869},
  eprinttype    = {arXiv},
  eprint       = {1401.3869},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AzizBEP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/AzizBEP11,
  author       = {Haris Aziz and
                  Yoram Bachrach and
                  Edith Elkind and
                  Mike Paterson},
  title        = {False-Name Manipulations in Weighted Voting Games},
  journal      = {J. Artif. Intell. Res.},
  volume       = {40},
  pages        = {57--93},
  year         = {2011},
  url          = {https://doi.org/10.1613/jair.3166},
  doi          = {10.1613/JAIR.3166},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jair/AzizBEP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ItoPS09,
  author       = {Hiro Ito and
                  Mike Paterson and
                  Kenya Sugihara},
  title        = {The Multi-Commodity Source Location Problems and the Price of Greed},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {13},
  number       = {1},
  pages        = {55--73},
  year         = {2009},
  url          = {https://doi.org/10.7155/jgaa.00176},
  doi          = {10.7155/JGAA.00176},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/ItoPS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/PatersonZ09,
  author       = {Mike Paterson and
                  Uri Zwick},
  title        = {Overhang},
  journal      = {Am. Math. Mon.},
  volume       = {116},
  number       = {1},
  pages        = {19--44},
  year         = {2009},
  url          = {http://www.jstor.org/stable/27642662},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/PatersonZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/PatersonPTWZ09,
  author       = {Mike Paterson and
                  Yuval Peres and
                  Mikkel Thorup and
                  Peter Winkler and
                  Uri Zwick},
  title        = {Maximum Overhang},
  journal      = {Am. Math. Mon.},
  volume       = {116},
  number       = {9},
  pages        = {763--787},
  year         = {2009},
  url          = {http://www.jstor.org/stable/40391297},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tamm/PatersonPTWZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/AzizLPS09,
  author       = {Haris Aziz and
                  Oded Lachish and
                  Mike Paterson and
                  Rahul Savani},
  editor       = {Andrew V. Goldberg and
                  Yunhong Zhou},
  title        = {Power Indices in Spanning Connectivity Games},
  booktitle    = {Algorithmic Aspects in Information and Management, 5th International
                  Conference, {AAIM} 2009, San Francisco, CA, USA, June 15-17, 2009.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5564},
  pages        = {55--67},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02158-9\_7},
  doi          = {10.1007/978-3-642-02158-9\_7},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/aaim/AzizLPS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/AzizP09,
  author       = {Haris Aziz and
                  Mike Paterson},
  editor       = {Carles Sierra and
                  Cristiano Castelfranchi and
                  Keith S. Decker and
                  Jaime Sim{\~{a}}o Sichman},
  title        = {False name manipulations in weighted voting games: splitting, merging
                  and annexation},
  booktitle    = {8th International Joint Conference on Autonomous Agents and Multiagent
                  Systems {(AAMAS} 2009), Budapest, Hungary, May 10-15, 2009, Volume
                  1},
  pages        = {409--416},
  publisher    = {{IFAAMAS}},
  year         = {2009},
  url          = {https://dl.acm.org/citation.cfm?id=1558069},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/atal/AzizP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AzizLPS09,
  author       = {Haris Aziz and
                  Oded Lachish and
                  Mike Paterson and
                  Rahul Savani},
  editor       = {Stefano Leonardi},
  title        = {Wiretapping a Hidden Network},
  booktitle    = {Internet and Network Economics, 5th International Workshop, {WINE}
                  2009, Rome, Italy, December 14-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5929},
  pages        = {438--446},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10841-9\_40},
  doi          = {10.1007/978-3-642-10841-9\_40},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/wine/AzizLPS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-3348,
  author       = {Haris Aziz and
                  Mike Paterson},
  title        = {False name manipulations in weighted voting games: splitting, merging
                  and annexation},
  journal      = {CoRR},
  volume       = {abs/0905.3348},
  year         = {2009},
  url          = {http://arxiv.org/abs/0905.3348},
  eprinttype    = {arXiv},
  eprint       = {0905.3348},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0905-3348.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-3643,
  author       = {Haris Aziz and
                  Oded Lachish and
                  Mike Paterson and
                  Rahul Savani},
  title        = {Spanning connectivity games},
  journal      = {CoRR},
  volume       = {abs/0906.3643},
  year         = {2009},
  url          = {http://arxiv.org/abs/0906.3643},
  eprinttype    = {arXiv},
  eprint       = {0906.3643},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0906-3643.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-5293,
  author       = {Haris Aziz and
                  Oded Lachish and
                  Mike Paterson and
                  Rahul Savani},
  title        = {Wiretapping a hidden network},
  journal      = {CoRR},
  volume       = {abs/0909.5293},
  year         = {2009},
  url          = {http://arxiv.org/abs/0909.5293},
  eprinttype    = {arXiv},
  eprint       = {0909.5293},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0909-5293.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JurdzinskiPZ08,
  author       = {Marcin Jurdzinski and
                  Mike Paterson and
                  Uri Zwick},
  title        = {A Deterministic Subexponential Algorithm for Solving Parity Games},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {4},
  pages        = {1519--1532},
  year         = {2008},
  url          = {https://doi.org/10.1137/070686652},
  doi          = {10.1137/070686652},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/JurdzinskiPZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/IwamaNPRY08,
  author       = {Kazuo Iwama and
                  Harumichi Nishimura and
                  Mike Paterson and
                  Rudy Raymond and
                  Shigeru Yamashita},
  editor       = {Luca Aceto and
                  Ivan Damg{\aa}rd and
                  Leslie Ann Goldberg and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Anna Ing{\'{o}}lfsd{\'{o}}ttir and
                  Igor Walukiewicz},
  title        = {Polynomial-Time Construction of Linear Network Coding},
  booktitle    = {Automata, Languages and Programming, 35th International Colloquium,
                  {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
                  {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series       = {Lecture Notes in Computer Science},
  volume       = {5125},
  pages        = {271--282},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-70575-8\_23},
  doi          = {10.1007/978-3-540-70575-8\_23},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/IwamaNPRY08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatersonPTWZ08,
  author       = {Mike Paterson and
                  Yuval Peres and
                  Mikkel Thorup and
                  Peter Winkler and
                  Uri Zwick},
  editor       = {Shang{-}Hua Teng},
  title        = {Maximum overhang},
  booktitle    = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
                  2008},
  pages        = {756--765},
  publisher    = {{SIAM}},
  year         = {2008},
  url          = {http://dl.acm.org/citation.cfm?id=1347082.1347165},
  timestamp    = {Mon, 23 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/PatersonPTWZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/ItoPS08,
  author       = {Hiro Ito and
                  Mike Paterson and
                  Kenya Sugihara},
  editor       = {Shin{-}Ichi Nakano and
                  Md. Saidur Rahman},
  title        = {Multi-commodity Source Location Problems and Price of Greed},
  booktitle    = {{WALCOM:} Algorithms and Computation, Second International Workshop,
                  {WALCOM} 2008, Dhaka, Bangladesh, February 7-8, 2008},
  series       = {Lecture Notes in Computer Science},
  volume       = {4921},
  pages        = {169--179},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-77891-2\_16},
  doi          = {10.1007/978-3-540-77891-2\_16},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/ItoPS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-2497,
  author       = {Haris Aziz and
                  Mike Paterson},
  title        = {Computing voting power in easy weighted voting games},
  journal      = {CoRR},
  volume       = {abs/0811.2497},
  year         = {2008},
  url          = {http://arxiv.org/abs/0811.2497},
  eprinttype    = {arXiv},
  eprint       = {0811.2497},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0811-2497.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerGP07,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Mike Paterson},
  title        = {On counting homomorphisms to directed acyclic graphs},
  journal      = {J. {ACM}},
  volume       = {54},
  number       = {6},
  pages        = {27},
  year         = {2007},
  url          = {https://doi.org/10.1145/1314690.1314691},
  doi          = {10.1145/1314690.1314691},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/DyerGP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/escape/2007,
  editor       = {Bo Chen and
                  Mike Paterson and
                  Guochuan Zhang},
  title        = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
                  First International Symposium, {ESCAPE} 2007, Hangzhou, China, April
                  7-9, 2007, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4614},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74450-4},
  doi          = {10.1007/978-3-540-74450-4},
  isbn         = {978-3-540-74449-8},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/escape/2007.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DyerGP06,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Mike Paterson},
  editor       = {Michele Bugliesi and
                  Bart Preneel and
                  Vladimiro Sassone and
                  Ingo Wegener},
  title        = {On Counting Homomorphisms to Directed Acyclic Graphs},
  booktitle    = {Automata, Languages and Programming, 33rd International Colloquium,
                  {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {4051},
  pages        = {38--49},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11786986\_5},
  doi          = {10.1007/11786986\_5},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DyerGP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JurdzinskiPZ06,
  author       = {Marcin Jurdzinski and
                  Mike Paterson and
                  Uri Zwick},
  title        = {A deterministic subexponential algorithm for solving parity games},
  booktitle    = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages        = {117--123},
  publisher    = {{ACM} Press},
  year         = {2006},
  url          = {http://dl.acm.org/citation.cfm?id=1109557.1109571},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/JurdzinskiPZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatersonZ06,
  author       = {Mike Paterson and
                  Uri Zwick},
  title        = {Overhang},
  booktitle    = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages        = {231--240},
  publisher    = {{ACM} Press},
  year         = {2006},
  url          = {http://dl.acm.org/citation.cfm?id=1109557.1109584},
  timestamp    = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/PatersonZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergMP05,
  author       = {Leslie Ann Goldberg and
                  Russell A. Martin and
                  Mike Paterson},
  title        = {Strong Spatial Mixing with Fewer Colors for Lattice Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {35},
  number       = {2},
  pages        = {486--517},
  year         = {2005},
  url          = {https://doi.org/10.1137/S0097539704445470},
  doi          = {10.1137/S0097539704445470},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GoldbergMP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-121,
  author       = {Martin E. Dyer and
                  Leslie Ann Goldberg and
                  Mike Paterson},
  title        = {On counting homomorphisms to directed acyclic graphs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-121}},
  year         = {2005},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-121/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR05-121},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR05-121.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldbergMP04,
  author       = {Leslie Ann Goldberg and
                  Russell A. Martin and
                  Mike Paterson},
  title        = {Random sampling of 3-colorings in Z\({}^{\mbox{2}}\)},
  journal      = {Random Struct. Algorithms},
  volume       = {24},
  number       = {3},
  pages        = {279--302},
  year         = {2004},
  url          = {https://doi.org/10.1002/rsa.20002},
  doi          = {10.1002/RSA.20002},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GoldbergMP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJKP04,
  author       = {Leslie Ann Goldberg and
                  Mark Jerrum and
                  Sampath Kannan and
                  Mike Paterson},
  title        = {A bound on the capacity of backoff and acknowledgment-based protocols},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {313--331},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539700381851},
  doi          = {10.1137/S0097539700381851},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GoldbergJKP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergKP04,
  author       = {Leslie Ann Goldberg and
                  Steven Kelk and
                  Mike Paterson},
  title        = {The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random},
  journal      = {{SIAM} J. Comput.},
  volume       = {33},
  number       = {2},
  pages        = {416--432},
  year         = {2004},
  url          = {https://doi.org/10.1137/S0097539702408363},
  doi          = {10.1137/S0097539702408363},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GoldbergKP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldbergMP04,
  author       = {Leslie Ann Goldberg and
                  Russell A. Martin and
                  Mike Paterson},
  title        = {trong Spatial Mixing for Lattice Graphs with Fewer Colours},
  booktitle    = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
                  October 2004, Rome, Italy, Proceedings},
  pages        = {562--571},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/FOCS.2004.63},
  doi          = {10.1109/FOCS.2004.63},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GoldbergMP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Paterson04,
  author       = {Mike Paterson},
  editor       = {Martin Farach{-}Colton},
  title        = {Analysis of Scheduling Algorithms for Proportionate Fairness},
  booktitle    = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
                  Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2976},
  pages        = {1},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-24698-5\_1},
  doi          = {10.1007/978-3-540-24698-5\_1},
  timestamp    = {Fri, 09 Apr 2021 18:42:35 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/Paterson04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldbergJP03,
  author       = {Leslie Ann Goldberg and
                  Mark Jerrum and
                  Mike Paterson},
  title        = {The computational complexity of two-state spin systems},
  journal      = {Random Struct. Algorithms},
  volume       = {23},
  number       = {2},
  pages        = {133--154},
  year         = {2003},
  url          = {https://doi.org/10.1002/rsa.10090},
  doi          = {10.1002/RSA.10090},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GoldbergJP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IwamaMP03,
  author       = {Kazuo Iwama and
                  Akihiro Matsuura and
                  Mike Paterson},
  title        = {A family of NFAs which need 2n- deterministic states},
  journal      = {Theor. Comput. Sci.},
  volume       = {301},
  number       = {1-3},
  pages        = {451--462},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00891-5},
  doi          = {10.1016/S0304-3975(02)00891-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/IwamaMP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AdlerBFGGP03,
  author       = {Micah Adler and
                  Petra Berenbrink and
                  Tom Friedetzky and
                  Leslie Ann Goldberg and
                  Paul W. Goldberg and
                  Mike Paterson},
  editor       = {Arnold L. Rosenberg and
                  Friedhelm Meyer auf der Heide},
  title        = {A proportionate fair scheduling rule with good worst-case performance},
  booktitle    = {{SPAA} 2003: Proceedings of the Fifteenth Annual {ACM} Symposium on
                  Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego,
                  California, {USA} (part of {FCRC} 2003)},
  pages        = {101--108},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/777412.777430},
  doi          = {10.1145/777412.777430},
  timestamp    = {Wed, 21 Nov 2018 11:11:22 +0100},
  biburl       = {https://dblp.org/rec/conf/spaa/AdlerBFGGP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/PatersonSSV02,
  author       = {Mike Paterson and
                  Heiko Schr{\"{o}}der and
                  Ondrej S{\'{y}}kora and
                  Imrich Vrto},
  title        = {Permutation Communication in All-Optical Rings},
  journal      = {Parallel Process. Lett.},
  volume       = {12},
  number       = {1},
  pages        = {23--29},
  year         = {2002},
  url          = {https://doi.org/10.1142/S0129626402000793},
  doi          = {10.1142/S0129626402000793},
  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ppl/PatersonSSV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldbergKP02,
  author       = {Leslie Ann Goldberg and
                  Steven Kelk and
                  Mike Paterson},
  editor       = {John H. Reif},
  title        = {The complexity of choosing an H-colouring (nearly) uniformly at random},
  booktitle    = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
                  May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  pages        = {53--62},
  publisher    = {{ACM}},
  year         = {2002},
  url          = {https://doi.org/10.1145/509907.509917},
  doi          = {10.1145/509907.509917},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/GoldbergKP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GoldbergGPPSS01,
  author       = {Leslie Ann Goldberg and
                  Paul W. Goldberg and
                  Mike Paterson and
                  Pavel A. Pevzner and
                  S{\"{u}}leyman Cenk Sahinalp and
                  Elizabeth Sweedyk},
  title        = {The Complexity of Gene Placement},
  journal      = {J. Algorithms},
  volume       = {41},
  number       = {2},
  pages        = {225--243},
  year         = {2001},
  url          = {https://doi.org/10.1006/jagm.2001.1172},
  doi          = {10.1006/JAGM.2001.1172},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/GoldbergGPPSS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoldbergPSS01,
  author       = {Leslie Ann Goldberg and
                  Mike Paterson and
                  Aravind Srinivasan and
                  Elizabeth Sweedyk},
  title        = {Better Approximation Guarantees for Job-Shop Scheduling},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {14},
  number       = {1},
  pages        = {67--92},
  year         = {2001},
  url          = {https://doi.org/10.1137/S0895480199326104},
  doi          = {10.1137/S0895480199326104},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/GoldbergPSS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldbergMPS00,
  author       = {Leslie Ann Goldberg and
                  Philip D. MacKenzie and
                  Mike Paterson and
                  Aravind Srinivasan},
  title        = {Contention resolution with constant expected delay},
  journal      = {J. {ACM}},
  volume       = {47},
  number       = {6},
  pages        = {1048--1096},
  year         = {2000},
  url          = {https://doi.org/10.1145/355541.355567},
  doi          = {10.1145/355541.355567},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GoldbergMPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RavindranGP00,
  author       = {Somasundaram Ravindran and
                  Alan Gibbons and
                  Mike Paterson},
  title        = {Dense edge-disjoint embedding of complete binary trees in interconnection
                  networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {249},
  number       = {2},
  pages        = {325--342},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(00)00066-9},
  doi          = {10.1016/S0304-3975(00)00066-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RavindranGP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoldbergJKP00,
  author       = {Leslie Ann Goldberg and
                  Mark Jerrum and
                  Sampath Kannan and
                  Mike Paterson},
  editor       = {Ugo Montanari and
                  Jos{\'{e}} D. P. Rolim and
                  Emo Welzl},
  title        = {A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols},
  booktitle    = {Automata, Languages and Programming, 27th International Colloquium,
                  {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1853},
  pages        = {705--716},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45022-X\_59},
  doi          = {10.1007/3-540-45022-X\_59},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/GoldbergJKP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdlerFGP00,
  author       = {Micah Adler and
                  Faith E. Fich and
                  Leslie Ann Goldberg and
                  Mike Paterson},
  editor       = {Ugo Montanari and
                  Jos{\'{e}} D. P. Rolim and
                  Emo Welzl},
  title        = {Tight Size Bounds for Packet Headers in Narrow Meshes},
  booktitle    = {Automata, Languages and Programming, 27th International Colloquium,
                  {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1853},
  pages        = {756--767},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45022-X\_63},
  doi          = {10.1007/3-540-45022-X\_63},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/AdlerFGP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/IwamaMP00,
  author       = {Kazuo Iwama and
                  Akihiro Matsuura and
                  Mike Paterson},
  editor       = {Mogens Nielsen and
                  Branislav Rovan},
  title        = {A Family of NFA's Which Need 2\({}^{\mbox{n}}\) -\emph{alpha} Deterministic
                  States},
  booktitle    = {Mathematical Foundations of Computer Science 2000, 25th International
                  Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
                  1, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1893},
  pages        = {436--445},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44612-5\_39},
  doi          = {10.1007/3-540-44612-5\_39},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/IwamaMP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CormodePSV00,
  author       = {Graham Cormode and
                  Mike Paterson and
                  S{\"{u}}leyman Cenk Sahinalp and
                  Uzi Vishkin},
  editor       = {David B. Shmoys},
  title        = {Communication complexity of document exchange},
  booktitle    = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  pages        = {197--206},
  publisher    = {{ACM/SIAM}},
  year         = {2000},
  url          = {http://dl.acm.org/citation.cfm?id=338219.338252},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CormodePSV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2000,
  editor       = {Mike Paterson},
  title        = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
                  Germany, September 5-8, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1879},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45253-2},
  doi          = {10.1007/3-540-45253-2},
  isbn         = {3-540-41004-X},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/2000.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FischerP99,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  title        = {Optimal Layout of Edge-weighted Forests},
  journal      = {Discret. Appl. Math.},
  volume       = {90},
  number       = {1-3},
  pages        = {135--159},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0166-218X(98)00088-2},
  doi          = {10.1016/S0166-218X(98)00088-2},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FischerP99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/istr/Paterson99,
  author       = {Mike Paterson},
  title        = {The chip in your wallet - The technology of security in smartcard
                  chip manufacture},
  journal      = {Inf. Secur. Tech. Rep.},
  volume       = {4},
  number       = {2},
  pages        = {13--18},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0167-4048(99)80010-7},
  doi          = {10.1016/S0167-4048(99)80010-7},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/istr/Paterson99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgarwalaBFPT99,
  author       = {Richa Agarwala and
                  Vineet Bafna and
                  Martin Farach and
                  Mike Paterson and
                  Mikkel Thorup},
  title        = {On the Approximability of Numerical Taxonomy (Fitting Distances by
                  Tree Metrics)},
  journal      = {{SIAM} J. Comput.},
  volume       = {28},
  number       = {3},
  pages        = {1073--1085},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0097539795296334},
  doi          = {10.1137/S0097539795296334},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AgarwalaBFPT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoldbergGPPSS99,
  author       = {Leslie Ann Goldberg and
                  Paul W. Goldberg and
                  Mike Paterson and
                  Pavel A. Pevzner and
                  S{\"{u}}leyman Cenk Sahinalp and
                  Elizabeth Sweedyk},
  editor       = {Robert Endre Tarjan and
                  Tandy J. Warnow},
  title        = {The Complexity of Gene Placement},
  booktitle    = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  17-19 January 1999, Baltimore, Maryland, {USA}},
  pages        = {386--395},
  publisher    = {{ACM/SIAM}},
  year         = {1999},
  url          = {http://dl.acm.org/citation.cfm?id=314500.314591},
  timestamp    = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/GoldbergGPPSS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MuthukrishnanPSS99,
  author       = {S. Muthukrishnan and
                  Mike Paterson and
                  S{\"{u}}leyman Cenk Sahinalp and
                  Torsten Suel},
  editor       = {Jeffrey Scott Vitter and
                  Lawrence L. Larmore and
                  Frank Thomson Leighton},
  title        = {Compact Grid Layouts of Multi-Level Networks},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {455--463},
  publisher    = {{ACM}},
  year         = {1999},
  url          = {https://doi.org/10.1145/301250.301372},
  doi          = {10.1145/301250.301372},
  timestamp    = {Fri, 07 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/MuthukrishnanPSS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/1999,
  editor       = {Maxime Crochemore and
                  Mike Paterson},
  title        = {Combinatorial Pattern Matching, 10th Annual Symposium, {CPM} 99, Warwick
                  University, UK, July 22-24, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1645},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48452-3},
  doi          = {10.1007/3-540-48452-3},
  isbn         = {3-540-66278-2},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/1999.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MaruokaPK98,
  author       = {Akira Maruoka and
                  Mike Paterson and
                  Hirotaka Koizumi},
  title        = {Consistency of Natural Relations on Sets},
  journal      = {Comb. Probab. Comput.},
  volume       = {7},
  number       = {3},
  pages        = {281--293},
  year         = {1998},
  url          = {http://journals.cambridge.org/action/displayAbstract?aid=46647},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/MaruokaPK98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/PatersonSSV98,
  author       = {Mike Paterson and
                  Heiko Schr{\"{o}}der and
                  Ondrej S{\'{y}}kora and
                  Imrich Vrto},
  editor       = {Luisa Gargano and
                  David Peleg},
  title        = {On permutation communications in all-optical rings},
  booktitle    = {SIROCCO'98, 5th International Colloquium on Structural Information
                  {\&} Communication Complexity, Amalfi, Italy, June 22-24, 1998},
  pages        = {1--9},
  publisher    = {Carleton Scientific},
  year         = {1998},
  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sirocco/PatersonSSV98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaMP98,
  author       = {Sanjeev Khanna and
                  S. Muthukrishnan and
                  Mike Paterson},
  editor       = {Howard J. Karloff},
  title        = {On Approximating Rectangle Tiling and Packing},
  booktitle    = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  25-27 January 1998, San Francisco, California, {USA}},
  pages        = {384--393},
  publisher    = {{ACM/SIAM}},
  year         = {1998},
  url          = {http://dl.acm.org/citation.cfm?id=314613.314768},
  timestamp    = {Mon, 10 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/KhannaMP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/EvenMPS98,
  author       = {Shimon Even and
                  S. Muthukrishnan and
                  Mike Paterson and
                  S{\"{u}}leyman Cenk Sahinalp},
  editor       = {Gary L. Miller and
                  Phillip B. Gibbons},
  title        = {Layout of the Batcher Bitonic Sorter (Extended Abstract)},
  booktitle    = {Proceedings of the Tenth Annual {ACM} Symposium on Parallel Algorithms
                  and Architectures, {SPAA} '98, Puerto Vallarta, Mexico, June 28 -
                  July 2, 1998},
  pages        = {172--181},
  publisher    = {{ACM}},
  year         = {1998},
  url          = {https://doi.org/10.1145/277651.277683},
  doi          = {10.1145/277651.277683},
  timestamp    = {Fri, 07 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/spaa/EvenMPS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelGP97,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l and
                  Mike Paterson},
  title        = {Lower Bounds for Monotone Span Programs},
  journal      = {Comput. Complex.},
  volume       = {6},
  number       = {1},
  pages        = {29--45},
  year         = {1997},
  url          = {https://doi.org/10.1007/BF01202040},
  doi          = {10.1007/BF01202040},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BeimelGP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/EppsteinPY97,
  author       = {David Eppstein and
                  Mike Paterson and
                  F. Frances Yao},
  title        = {On Nearest-Neighbor Graphs},
  journal      = {Discret. Comput. Geom.},
  volume       = {17},
  number       = {3},
  pages        = {263--282},
  year         = {1997},
  url          = {https://doi.org/10.1007/PL00009293},
  doi          = {10.1007/PL00009293},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/EppsteinPY97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FraenkelSP97,
  author       = {Aviezri S. Fraenkel and
                  Jamie Simpson and
                  Mike Paterson},
  editor       = {Alberto Apostolico and
                  Jotun Hein},
  title        = {On Weak Circular Squares in Binary Words},
  booktitle    = {Combinatorial Pattern Matching, 8th Annual Symposium, {CPM} 97, Aarhus,
                  Denmark, June 30 - July 2, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1264},
  pages        = {76--82},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-63220-4\_51},
  doi          = {10.1007/3-540-63220-4\_51},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/FraenkelSP97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoldbergPSS97,
  author       = {Leslie Ann Goldberg and
                  Mike Paterson and
                  Aravind Srinivasan and
                  Elizabeth Sweedyk},
  editor       = {Michael E. Saks},
  title        = {Better Approximation Guarantees for Job-shop Scheduling},
  booktitle    = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
  pages        = {599--608},
  publisher    = {{ACM/SIAM}},
  year         = {1997},
  url          = {http://dl.acm.org/citation.cfm?id=314161.314395},
  timestamp    = {Thu, 05 Jul 2018 07:29:42 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/GoldbergPSS97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PatersonP96,
  author       = {Mike Paterson and
                  Teresa M. Przytycka},
  title        = {On the Complexity of String Folding},
  journal      = {Discret. Appl. Math.},
  volume       = {71},
  number       = {1-3},
  pages        = {217--230},
  year         = {1996},
  url          = {https://doi.org/10.1016/S0166-218X(96)00065-0},
  doi          = {10.1016/S0166-218X(96)00065-0},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/PatersonP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MiltersenPT96,
  author       = {Peter Bro Miltersen and
                  Mike Paterson and
                  Jun Tarui},
  title        = {The Asymptotic Complexity of Merging Networks},
  journal      = {J. {ACM}},
  volume       = {43},
  number       = {1},
  pages        = {147--165},
  year         = {1996},
  url          = {https://doi.org/10.1145/227595.227693},
  doi          = {10.1145/227595.227693},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/MiltersenPT96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZwickP96,
  author       = {Uri Zwick and
                  Mike Paterson},
  title        = {The Complexity of Mean Payoff Games on Graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {158},
  number       = {1{\&}2},
  pages        = {343--359},
  year         = {1996},
  url          = {https://doi.org/10.1016/0304-3975(95)00188-3},
  doi          = {10.1016/0304-3975(95)00188-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZwickP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PatersonP96,
  author       = {Mike Paterson and
                  Teresa M. Przytycka},
  editor       = {Friedhelm Meyer auf der Heide and
                  Burkhard Monien},
  title        = {On the Complexity of String Folding},
  booktitle    = {Automata, Languages and Programming, 23rd International Colloquium,
                  ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1099},
  pages        = {658--669},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61440-0\_167},
  doi          = {10.1007/3-540-61440-0\_167},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/PatersonP96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalaBFOPT96,
  author       = {Richa Agarwala and
                  Vineet Bafna and
                  Martin Farach and
                  Babu O. Narayanan and
                  Mike Paterson and
                  Mikkel Thorup},
  editor       = {{\'{E}}va Tardos},
  title        = {On the Approximability of Numerical Taxonomy (Fitting Distances by
                  Tree Metrics)},
  booktitle    = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
  pages        = {365--372},
  publisher    = {{ACM/SIAM}},
  year         = {1996},
  url          = {http://dl.acm.org/citation.cfm?id=313852.314084},
  timestamp    = {Thu, 05 Jul 2018 07:29:31 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AgarwalaBFOPT96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Paterson96,
  author       = {Mike Paterson},
  editor       = {Rolf G. Karlsson and
                  Andrzej Lingas},
  title        = {Progress in Selection},
  booktitle    = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
                  Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1097},
  pages        = {368--379},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61422-2\_146},
  doi          = {10.1007/3-540-61422-2\_146},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/Paterson96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HiltgenP95,
  author       = {Alain P. Hiltgen and
                  Mike Paterson},
  title        = {PI\({}_{\mbox{k}}\) Mass Production and an Optimal Circuit for the
                  Neciporuk Slice},
  journal      = {Comput. Complex.},
  volume       = {5},
  number       = {2},
  pages        = {132--154},
  year         = {1995},
  url          = {https://doi.org/10.1007/BF01268142},
  doi          = {10.1007/BF01268142},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/HiltgenP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DancekP95,
  author       = {Vlado Danc{\'{\i}}k and
                  Mike Paterson},
  title        = {Upper Bounds for the Expected Length of a Longest Common Subsequence
                  of Two Binary Sequences},
  journal      = {Random Struct. Algorithms},
  volume       = {6},
  number       = {4},
  pages        = {449--458},
  year         = {1995},
  url          = {https://doi.org/10.1002/rsa.3240060408},
  doi          = {10.1002/RSA.3240060408},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/DancekP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeHPZ95,
  author       = {Richard Cole and
                  Ramesh Hariharan and
                  Mike Paterson and
                  Uri Zwick},
  title        = {Tighter Lower Bounds on the Exact Complexity of String Matching},
  journal      = {{SIAM} J. Comput.},
  volume       = {24},
  number       = {1},
  pages        = {30--45},
  year         = {1995},
  url          = {https://doi.org/10.1137/S0097539793245829},
  doi          = {10.1137/S0097539793245829},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ColeHPZ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ZwickP95,
  author       = {Uri Zwick and
                  Mike Paterson},
  editor       = {Ding{-}Zhu Du and
                  Ming Li},
  title        = {The Complexity of Mean Payoff Games},
  booktitle    = {Computing and Combinatorics, First Annual International Conference,
                  {COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {959},
  pages        = {1--10},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/BFb0030814},
  doi          = {10.1007/BFB0030814},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/ZwickP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatersonS95,
  author       = {Mike Paterson and
                  Aravind Srinivasan},
  title        = {Contention Resolution with Bounded Delay},
  booktitle    = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
                  Wisconsin, USA, 23-25 October 1995},
  pages        = {104--113},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/SFCS.1995.492467},
  doi          = {10.1109/SFCS.1995.492467},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PatersonS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelGP95,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l and
                  Mike Paterson},
  title        = {Lower Bounds for Monotone Span Programs},
  booktitle    = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
                  Wisconsin, USA, 23-25 October 1995},
  pages        = {674--681},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/SFCS.1995.492669},
  doi          = {10.1109/SFCS.1995.492669},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BeimelGP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/PatersonTZ95,
  author       = {Mike Paterson and
                  Shlomit Tassa and
                  Uri Zwick},
  editor       = {P. S. Thiagarajan},
  title        = {Looking for {MUM} and {DAD:} Text-Text Comparisons Do Help},
  booktitle    = {Foundations of Software Technology and Theoretical Computer Science,
                  15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1026},
  pages        = {1--10},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60692-0\_36},
  doi          = {10.1007/3-540-60692-0\_36},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/PatersonTZ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-001,
  author       = {Amos Beimel and
                  Anna G{\'{a}}l and
                  Mike Paterson},
  title        = {Lower Bounds for Monotone Span Programs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR95-001}},
  year         = {1995},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-001/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR95-001},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR95-001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-040,
  author       = {Uri Zwick and
                  Mike Paterson},
  title        = {The Complexity of Mean Payoff Games on Graphs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR95-040}},
  year         = {1995},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-040/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR95-040},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR95-040.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FischerP94,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  title        = {Fishspear: {A} Priority Queue Algorithm},
  journal      = {J. {ACM}},
  volume       = {41},
  number       = {1},
  pages        = {3--30},
  year         = {1994},
  url          = {https://doi.org/10.1145/174644.174645},
  doi          = {10.1145/174644.174645},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/FischerP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Paterson94,
  author       = {Mike Paterson},
  title        = {David Michael Ritchie Park {(1935-1990)} in Memoriam},
  journal      = {Theor. Comput. Sci.},
  volume       = {133},
  number       = {1},
  pages        = {187--200},
  year         = {1994},
  timestamp    = {Wed, 19 Nov 2003 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Paterson94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PatersonD94,
  author       = {Mike Paterson and
                  Vlado Danc{\'{\i}}k},
  editor       = {Igor Pr{\'{\i}}vara and
                  Branislav Rovan and
                  Peter Ruzicka},
  title        = {Longest Common Subsequences},
  booktitle    = {Mathematical Foundations of Computer Science 1994, 19th International
                  Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {841},
  pages        = {127--142},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-58338-6\_63},
  doi          = {10.1007/3-540-58338-6\_63},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/PatersonD94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DancikP94,
  author       = {Vlado Danc{\'{\i}}k and
                  Mike Paterson},
  editor       = {Patrice Enjalbert and
                  Ernst W. Mayr and
                  Klaus W. Wagner},
  title        = {Upper Bounds for the Expected Length of a Longest Common Subsequence
                  of Two Binary Sequences},
  booktitle    = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
                  Science, Caen, France, February 24-26, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {775},
  pages        = {669--678},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-57785-8\_180},
  doi          = {10.1007/3-540-57785-8\_180},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DancikP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PatersonZ93,
  author       = {Mike Paterson and
                  Uri Zwick},
  title        = {Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication},
  journal      = {Comput. Complex.},
  volume       = {3},
  pages        = {262--291},
  year         = {1993},
  url          = {https://doi.org/10.1007/BF01271371},
  doi          = {10.1007/BF01271371},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/PatersonZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PatersonSSV93,
  author       = {Mike Paterson and
                  Heiko Schr{\"{o}}der and
                  Ondrej S{\'{y}}kora and
                  Imrich Vrto},
  title        = {A Short Proof of the Dilation of a Toroidal Mesh in a Path},
  journal      = {Inf. Process. Lett.},
  volume       = {48},
  number       = {4},
  pages        = {197--199},
  year         = {1993},
  url          = {https://doi.org/10.1016/0020-0190(93)90145-Y},
  doi          = {10.1016/0020-0190(93)90145-Y},
  timestamp    = {Wed, 15 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/PatersonSSV93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PatersonZ93,
  author       = {Mike Paterson and
                  Uri Zwick},
  title        = {Shrinkage of de Morgan Formulae under Restriction},
  journal      = {Random Struct. Algorithms},
  volume       = {4},
  number       = {2},
  pages        = {135--150},
  year         = {1993},
  url          = {https://doi.org/10.1002/rsa.3240040203},
  doi          = {10.1002/RSA.3240040203},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/PatersonZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZwickP93,
  author       = {Uri Zwick and
                  Mike Paterson},
  title        = {The Memory Game},
  journal      = {Theor. Comput. Sci.},
  volume       = {110},
  number       = {1},
  pages        = {169--196},
  year         = {1993},
  url          = {https://doi.org/10.1016/0304-3975(93)90355-W},
  doi          = {10.1016/0304-3975(93)90355-W},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZwickP93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Paterson93,
  author       = {Mike Paterson},
  editor       = {Thomas Lengauer},
  title        = {Evolution of an Algorithm},
  booktitle    = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
                  Germany, September 30 - October 2, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {726},
  pages        = {306--308},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57273-2\_65},
  doi          = {10.1007/3-540-57273-2\_65},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/Paterson93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/ColeHPZ93,
  author       = {Richard Cole and
                  Ramesh Hariharan and
                  Mike Paterson and
                  Uri Zwick},
  title        = {Which Patterns are Hard to Find?},
  booktitle    = {Second Israel Symposium on Theory of Computing Systems, {ISTCS} 1993,
                  Natanya, Israel, June 7-9, 1993, Proceedings},
  pages        = {59--68},
  publisher    = {{IEEE} Computer Society},
  year         = {1993},
  url          = {https://doi.org/10.1109/ISTCS.1993.253483},
  doi          = {10.1109/ISTCS.1993.253483},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/istcs/ColeHPZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PatersonY92,
  author       = {Mike Paterson and
                  F. Frances Yao},
  title        = {Optimal Binary Space Partitions for Orthogonal Objects},
  journal      = {J. Algorithms},
  volume       = {13},
  number       = {1},
  pages        = {99--113},
  year         = {1992},
  url          = {https://doi.org/10.1016/0196-6774(92)90007-Y},
  doi          = {10.1016/0196-6774(92)90007-Y},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/PatersonY92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MiltersenPT92,
  author       = {Peter Bro Miltersen and
                  Mike Paterson and
                  Jun Tarui},
  title        = {The Asymptotic Complexity of Merging Networks},
  booktitle    = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
                  Pennsylvania, USA, 24-27 October 1992},
  pages        = {236--246},
  publisher    = {{IEEE} Computer Society},
  year         = {1992},
  url          = {https://doi.org/10.1109/SFCS.1992.267768},
  doi          = {10.1109/SFCS.1992.267768},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MiltersenPT92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PatersonY92,
  author       = {Mike Paterson and
                  F. Frances Yao},
  editor       = {Werner Kuich},
  title        = {On Nearest-Neighbor Graphs},
  booktitle    = {Automata, Languages and Programming, 19th International Colloquium,
                  ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {623},
  pages        = {416--426},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-55719-9\_93},
  doi          = {10.1007/3-540-55719-9\_93},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/PatersonY92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Paterson92,
  author       = {Mike Paterson},
  editor       = {Toshihide Ibaraki and
                  Yasuyoshi Inagaki and
                  Kazuo Iwama and
                  Takao Nishizeki and
                  Masafumi Yamashita},
  title        = {Boolean Circuit Complexity},
  booktitle    = {Algorithms and Computation, Third International Symposium, {ISAAC}
                  '92, Nagoya, Japan, December 16-18, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {650},
  pages        = {187},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-56279-6\_71},
  doi          = {10.1007/3-540-56279-6\_71},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/Paterson92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GibbonsP92,
  author       = {Alan Gibbons and
                  Mike Paterson},
  editor       = {Lawrence Snyder},
  title        = {Dense Edge-Disjoint Embedding of Binary Trees in the Mesh},
  booktitle    = {Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms
                  and Architectures, {SPAA} '92, San Diego, CA, USA, June 29 - July
                  1, 1992},
  pages        = {257--263},
  publisher    = {{ACM}},
  year         = {1992},
  url          = {https://doi.org/10.1145/140901.141876},
  doi          = {10.1145/140901.141876},
  timestamp    = {Wed, 21 Nov 2018 12:27:44 +0100},
  biburl       = {https://dblp.org/rec/conf/spaa/GibbonsP92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatersonZ92,
  author       = {Mike Paterson and
                  Uri Zwick},
  editor       = {S. Rao Kosaraju and
                  Mike Fellows and
                  Avi Wigderson and
                  John A. Ellis},
  title        = {Shallow Multiplication Circuits and Wise Financial Investments},
  booktitle    = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
                  May 4-6, 1992, Victoria, British Columbia, Canada},
  pages        = {429--437},
  publisher    = {{ACM}},
  year         = {1992},
  url          = {https://doi.org/10.1145/129712.129753},
  doi          = {10.1145/129712.129753},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/PatersonZ92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/McCollPB91,
  author       = {William F. McColl and
                  Mike Paterson and
                  Brian H. Bowditch},
  title        = {Planar Acyclic Computation},
  journal      = {Inf. Comput.},
  volume       = {90},
  number       = {2},
  pages        = {178--193},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90003-K},
  doi          = {10.1016/0890-5401(91)90003-K},
  timestamp    = {Sat, 25 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/McCollPB91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PatersonR91,
  author       = {Mike Paterson and
                  Alexander A. Razborov},
  title        = {The Set of Minimal Braids is co-NP-Complete},
  journal      = {J. Algorithms},
  volume       = {12},
  number       = {3},
  pages        = {393--408},
  year         = {1991},
  url          = {https://doi.org/10.1016/0196-6774(91)90011-M},
  doi          = {10.1016/0196-6774(91)90011-M},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/PatersonR91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatersonZ91,
  author       = {Mike Paterson and
                  Uri Zwick},
  title        = {Shrinkage of de{\textasciitilde}Morgan formulae under restriction},
  booktitle    = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
                  Puerto Rico, 1-4 October 1991},
  pages        = {324--333},
  publisher    = {{IEEE} Computer Society},
  year         = {1991},
  url          = {https://doi.org/10.1109/SFCS.1991.185385},
  doi          = {10.1109/SFCS.1991.185385},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PatersonZ91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DiazGPT91,
  author       = {Josep D{\'{\i}}az and
                  Alan Gibbons and
                  Mike Paterson and
                  Jacobo Tor{\'{a}}n},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Nicola Santoro},
  title        = {The {MINSUMCUT} Problem},
  booktitle    = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
                  August 14-16, 1991, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {519},
  pages        = {65--89},
  publisher    = {Springer},
  year         = {1991},
  url          = {https://doi.org/10.1007/BFb0028251},
  doi          = {10.1007/BFB0028251},
  timestamp    = {Fri, 17 Jul 2020 16:12:48 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/DiazGPT91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Paterson90,
  author       = {Mike Paterson},
  title        = {Improved Sorting Networks with O(log {N)} Depth},
  journal      = {Algorithmica},
  volume       = {5},
  number       = {1},
  pages        = {65--92},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF01840378},
  doi          = {10.1007/BF01840378},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/Paterson90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MonmaPSY90,
  author       = {Clyde L. Monma and
                  Mike Paterson and
                  Subhash Suri and
                  F. Frances Yao},
  title        = {Computing Euclidean Maximum Spanning Trees},
  journal      = {Algorithmica},
  volume       = {5},
  number       = {3},
  pages        = {407--419},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF01840396},
  doi          = {10.1007/BF01840396},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MonmaPSY90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/PatersonY90,
  author       = {Mike Paterson and
                  F. Frances Yao},
  title        = {Efficient Binary Space Partitions for Hidden-Surface Removal and Solid
                  Modeling},
  journal      = {Discret. Comput. Geom.},
  volume       = {5},
  pages        = {485--503},
  year         = {1990},
  url          = {https://doi.org/10.1007/BF02187806},
  doi          = {10.1007/BF02187806},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcg/PatersonY90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatersonPZ90,
  author       = {Mike Paterson and
                  Nicholas Pippenger and
                  Uri Zwick},
  title        = {Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication
                  and Symmetric Boolean Functions},
  booktitle    = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
                  Missouri, USA, October 22-24, 1990, Volume {II}},
  pages        = {642--650},
  publisher    = {{IEEE} Computer Society},
  year         = {1990},
  url          = {https://doi.org/10.1109/FSCS.1990.89586},
  doi          = {10.1109/FSCS.1990.89586},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PatersonPZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatersonY90,
  author       = {Mike Paterson and
                  F. Frances Yao},
  editor       = {David S. Johnson},
  title        = {Optimal Binary Space Partitions for Orthogonal Objects},
  booktitle    = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  22-24 January 1990, San Francisco, California, {USA}},
  pages        = {100--106},
  publisher    = {{SIAM}},
  year         = {1990},
  url          = {http://dl.acm.org/citation.cfm?id=320176.320187},
  timestamp    = {Thu, 05 Jul 2018 07:28:50 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/PatersonY90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/1990,
  editor       = {Mike Paterson},
  title        = {Automata, Languages and Programming, 17th International Colloquium,
                  ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {443},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/BFb0032016},
  doi          = {10.1007/BFB0032016},
  isbn         = {3-540-52826-1},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/1990.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YaoDEP89,
  author       = {F. Frances Yao and
                  David P. Dobkin and
                  Herbert Edelsbrunner and
                  Mike Paterson},
  title        = {Partitioning Space for Range Queries},
  journal      = {{SIAM} J. Comput.},
  volume       = {18},
  number       = {2},
  pages        = {371--384},
  year         = {1989},
  url          = {https://doi.org/10.1137/0218025},
  doi          = {10.1137/0218025},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/YaoDEP89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/PatersonY89,
  author       = {Mike Paterson and
                  F. Frances Yao},
  editor       = {Kurt Mehlhorn},
  title        = {Binary Partitions with Applications to Hidden Surface Removal and
                  Solid Modelling},
  booktitle    = {Proceedings of the Fifth Annual Symposium on Computational Geometry,
                  Saarbr{\"{u}}cken, Germany, June 5-7, 1989},
  pages        = {23--32},
  publisher    = {{ACM}},
  year         = {1989},
  url          = {https://doi.org/10.1145/73833.73836},
  doi          = {10.1145/73833.73836},
  timestamp    = {Mon, 14 Jun 2021 16:25:09 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/PatersonY89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Paterson88,
  author       = {Mike Paterson},
  title        = {Universal Chains and Wiring Layouts},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {1},
  number       = {1},
  pages        = {80--85},
  year         = {1988},
  url          = {https://doi.org/10.1137/0401009},
  doi          = {10.1137/0401009},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Paterson88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/MonmaPSY89,
  author       = {Clyde L. Monma and
                  Mike Paterson and
                  Subhash Suri and
                  F. Frances Yao},
  editor       = {Herbert Edelsbrunner},
  title        = {Computing Euclidean Maximum Spanning Trees},
  booktitle    = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
                  Urbana-Champaign, IL, USA, June 6-8, 1988},
  pages        = {241--251},
  publisher    = {{ACM}},
  year         = {1988},
  url          = {https://doi.org/10.1145/73393.73418},
  doi          = {10.1145/73393.73418},
  timestamp    = {Mon, 14 Jun 2021 16:25:17 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/MonmaPSY89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/McCollP87,
  author       = {William F. McColl and
                  Mike Paterson},
  title        = {The Planar Realization of Boolean Functions},
  journal      = {Inf. Process. Lett.},
  volume       = {24},
  number       = {3},
  pages        = {165--170},
  year         = {1987},
  url          = {https://doi.org/10.1016/0020-0190(87)90180-3},
  doi          = {10.1016/0020-0190(87)90180-3},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/McCollP87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/PatersonW86,
  author       = {Mike Paterson and
                  Ingo Wegener},
  title        = {Nearly Optimal Hierarchies for Network and Formula Size},
  journal      = {Acta Informatica},
  volume       = {23},
  number       = {2},
  pages        = {217--221},
  year         = {1986},
  url          = {https://doi.org/10.1007/BF00289499},
  doi          = {10.1007/BF00289499},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/PatersonW86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PatersonY86,
  author       = {Mike Paterson and
                  F. Frances Yao},
  title        = {Point Retrieval for Polygons},
  journal      = {J. Algorithms},
  volume       = {7},
  number       = {3},
  pages        = {441--447},
  year         = {1986},
  url          = {https://doi.org/10.1016/0196-6774(86)90033-7},
  doi          = {10.1016/0196-6774(86)90033-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/PatersonY86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FischerLP85,
  author       = {Michael J. Fischer and
                  Nancy A. Lynch and
                  Mike Paterson},
  title        = {Impossibility of Distributed Consensus with One Faulty Process},
  journal      = {J. {ACM}},
  volume       = {32},
  number       = {2},
  pages        = {374--382},
  year         = {1985},
  url          = {https://doi.org/10.1145/3149.214121},
  doi          = {10.1145/3149.214121},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/FischerLP85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FischerP85,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  title        = {Dynamic Monotone Priorities on Planar Sets (Extended Abstract)},
  booktitle    = {26th Annual Symposium on Foundations of Computer Science, Portland,
                  Oregon, USA, 21-23 October 1985},
  pages        = {289--292},
  publisher    = {{IEEE} Computer Society},
  year         = {1985},
  url          = {https://doi.org/10.1109/SFCS.1985.21},
  doi          = {10.1109/SFCS.1985.21},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FischerP85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HarelP84,
  author       = {David Harel and
                  Mike Paterson},
  title        = {Undecidability of {PDL} with L=\{a{\^{}}(2i){\(\vert\)}i{\textgreater}=0\}},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {29},
  number       = {3},
  pages        = {359--365},
  year         = {1984},
  url          = {https://doi.org/10.1016/0022-0000(84)90005-9},
  doi          = {10.1016/0022-0000(84)90005-9},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/HarelP84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FischerP84,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  title        = {Fishspear: {A} Priority Queue Algorithm (Extended Abstract)},
  booktitle    = {25th Annual Symposium on Foundations of Computer Science, West Palm
                  Beach, Florida, USA, 24-26 October 1984},
  pages        = {375--386},
  publisher    = {{IEEE} Computer Society},
  year         = {1984},
  url          = {https://doi.org/10.1109/SFCS.1984.715938},
  doi          = {10.1109/SFCS.1984.715938},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/FischerP84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FischerP83,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  title        = {Storage Requirements for Fair Scheduling},
  journal      = {Inf. Process. Lett.},
  volume       = {17},
  number       = {5},
  pages        = {249--250},
  year         = {1983},
  url          = {https://doi.org/10.1016/0020-0190(83)90107-2},
  doi          = {10.1016/0020-0190(83)90107-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/FischerP83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/FischerLP83,
  author       = {Michael J. Fischer and
                  Nancy A. Lynch and
                  Mike Paterson},
  editor       = {Ronald Fagin and
                  Philip A. Bernstein},
  title        = {Impossibility of Distributed Consensus with One Faulty Process},
  booktitle    = {Proceedings of the Second {ACM} {SIGACT-SIGMOD} Symposium on Principles
                  of Database Systems, March 21-23, 1983, Colony Square Hotel, Atlanta,
                  Georgia, {USA}},
  pages        = {1--7},
  publisher    = {{ACM}},
  year         = {1983},
  url          = {https://doi.org/10.1145/588058.588060},
  doi          = {10.1145/588058.588060},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/FischerLP83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GreenbergLPG82,
  author       = {Albert G. Greenberg and
                  Richard E. Ladner and
                  Mike Paterson and
                  Zvi Galil},
  title        = {Efficient Parallel Algorithms for Linear Recurrence Computation},
  journal      = {Inf. Process. Lett.},
  volume       = {15},
  number       = {1},
  pages        = {31--35},
  year         = {1982},
  url          = {https://doi.org/10.1016/0020-0190(82)90081-3},
  doi          = {10.1016/0020-0190(82)90081-3},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/GreenbergLPG82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerMP82,
  author       = {Michael J. Fischer and
                  Albert R. Meyer and
                  Mike Paterson},
  title        = {Omega(n log n) Lower Bounds on Length of Boolean Formulas},
  journal      = {{SIAM} J. Comput.},
  volume       = {11},
  number       = {3},
  pages        = {416--427},
  year         = {1982},
  url          = {https://doi.org/10.1137/0211033},
  doi          = {10.1137/0211033},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FischerMP82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FowlerPT81,
  author       = {Robert J. Fowler and
                  Mike Paterson and
                  Steven L. Tanimoto},
  title        = {Optimal Packing and Covering in the Plane are NP-Complete},
  journal      = {Inf. Process. Lett.},
  volume       = {12},
  number       = {3},
  pages        = {133--137},
  year         = {1981},
  url          = {https://doi.org/10.1016/0020-0190(81)90111-3},
  doi          = {10.1016/0020-0190(81)90111-3},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/FowlerPT81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermanP81,
  author       = {Francine Berman and
                  Mike Paterson},
  title        = {Propositional Dynamic Logic is Weaker without Tests},
  journal      = {Theor. Comput. Sci.},
  volume       = {16},
  pages        = {321--328},
  year         = {1981},
  url          = {https://doi.org/10.1016/0304-3975(81)90102-X},
  doi          = {10.1016/0304-3975(81)90102-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BermanP81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatersonRS81,
  author       = {Mike Paterson and
                  Walter L. Ruzzo and
                  Lawrence Snyder},
  title        = {Bounds on Minimax Edge Length for Complete Binary Trees (Extended
                  Abstract)},
  booktitle    = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
                  May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
  pages        = {293--299},
  publisher    = {{ACM}},
  year         = {1981},
  url          = {https://doi.org/10.1145/800076.802481},
  doi          = {10.1145/800076.802481},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/PatersonRS81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MasekP80,
  author       = {William J. Masek and
                  Mike Paterson},
  title        = {A Faster Algorithm Computing String Edit Distances},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {20},
  number       = {1},
  pages        = {18--31},
  year         = {1980},
  url          = {https://doi.org/10.1016/0022-0000(80)90002-1},
  doi          = {10.1016/0022-0000(80)90002-1},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/MasekP80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/KleinP80,
  author       = {Peter Klein and
                  Mike Paterson},
  title        = {Asymtotically Optimal Circuit for a Storage Access Function},
  journal      = {{IEEE} Trans. Computers},
  volume       = {29},
  number       = {8},
  pages        = {737--738},
  year         = {1980},
  url          = {https://doi.org/10.1109/TC.1980.1675657},
  doi          = {10.1109/TC.1980.1675657},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tc/KleinP80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MunroP80,
  author       = {J. Ian Munro and
                  Mike Paterson},
  title        = {Selection and Sorting with Limited Storage},
  journal      = {Theor. Comput. Sci.},
  volume       = {12},
  pages        = {315--323},
  year         = {1980},
  url          = {https://doi.org/10.1016/0304-3975(80)90061-4},
  doi          = {10.1016/0304-3975(80)90061-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MunroP80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FischerP80,
  author       = {Michael J. Fischer and
                  Mike Paterson},
  editor       = {Raymond E. Miller and
                  Seymour Ginsburg and
                  Walter A. Burkhard and
                  Richard J. Lipton},
  title        = {Optimal Tree Layout (Preliminary Version)},
  booktitle    = {Proceedings of the 12th Annual {ACM} Symposium on Theory of Computing,
                  April 28-30, 1980, Los Angeles, California, {USA}},
  pages        = {177--189},
  publisher    = {{ACM}},
  year         = {1980},
  url          = {https://doi.org/10.1145/800141.804665},
  doi          = {10.1145/800141.804665},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/FischerP80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ershov/Paterson79,
  author       = {Mike Paterson},
  editor       = {Andrei P. Ershov and
                  Donald E. Knuth},
  title        = {The linear postman: a message-forwarding algorithm using sequential
                  storage},
  booktitle    = {Algorithms in Modern Mathematics and Computer Science, Proceedings,
                  Urgench, Uzbek SSR, USSR, September 16-22, 1979},
  series       = {Lecture Notes in Computer Science},
  volume       = {122},
  pages        = {463},
  publisher    = {Springer},
  year         = {1979},
  timestamp    = {Thu, 25 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ershov/Paterson79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PatersonW78,
  author       = {Mike Paterson and
                  Mark N. Wegman},
  title        = {Linear Unification},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {16},
  number       = {2},
  pages        = {158--167},
  year         = {1978},
  url          = {https://doi.org/10.1016/0022-0000(78)90043-0},
  doi          = {10.1016/0022-0000(78)90043-0},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/PatersonW78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MunroP78,
  author       = {J. Ian Munro and
                  Mike Paterson},
  title        = {Selection and Sorting with Limited Storage},
  booktitle    = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor,
                  Michigan, USA, 16-18 October 1978},
  pages        = {253--258},
  publisher    = {{IEEE} Computer Society},
  year         = {1978},
  url          = {https://doi.org/10.1109/SFCS.1978.32},
  doi          = {10.1109/SFCS.1978.32},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MunroP78.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McCollP77,
  author       = {William F. McColl and
                  Mike Paterson},
  title        = {The Depth of All Boolean Functions},
  journal      = {{SIAM} J. Comput.},
  volume       = {6},
  number       = {2},
  pages        = {373--380},
  year         = {1977},
  url          = {https://doi.org/10.1137/0206026},
  doi          = {10.1137/0206026},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/McCollP77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/Paterson77,
  author       = {Mike Paterson},
  editor       = {Hans Tzschach and
                  H. Waldschmidt and
                  Hermann K.{-}G. Walter},
  title        = {New bounds on formula size},
  booktitle    = {Theoretical Computer Science, 3rd GI-Conference, Darmstadt, Germany,
                  March 28-30, 1977, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {48},
  pages        = {17--26},
  publisher    = {Springer},
  year         = {1977},
  url          = {https://doi.org/10.1007/3-540-08138-0\_2},
  doi          = {10.1007/3-540-08138-0\_2},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/tcs/Paterson77.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/SchonhagePP76,
  author       = {Arnold Sch{\"{o}}nhage and
                  Mike Paterson and
                  Nicholas Pippenger},
  title        = {Finding the Median},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {13},
  number       = {2},
  pages        = {184--199},
  year         = {1976},
  url          = {https://doi.org/10.1016/S0022-0000(76)80029-3},
  doi          = {10.1016/S0022-0000(76)80029-3},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/SchonhagePP76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PatersonV76,
  author       = {Mike Paterson and
                  Leslie G. Valiant},
  title        = {Circuit Size is Nonlinear in Depth},
  journal      = {Theor. Comput. Sci.},
  volume       = {2},
  number       = {3},
  pages        = {397--400},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90090-6},
  doi          = {10.1016/0304-3975(76)90090-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PatersonV76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatersonW76,
  author       = {Mike Paterson and
                  Mark N. Wegman},
  editor       = {Ashok K. Chandra and
                  Detlef Wotschke and
                  Emily P. Friedman and
                  Michael A. Harrison},
  title        = {Linear Unification},
  booktitle    = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing,
                  May 3-5, 1976, Hershey, Pennsylvania, {USA}},
  pages        = {181--186},
  publisher    = {{ACM}},
  year         = {1976},
  url          = {https://doi.org/10.1145/800113.803646},
  doi          = {10.1145/800113.803646},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/PatersonW76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ValiantP75,
  author       = {Leslie G. Valiant and
                  Mike Paterson},
  title        = {Deterministic One-Counter Automata},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {10},
  number       = {3},
  pages        = {340--350},
  year         = {1975},
  url          = {https://doi.org/10.1016/S0022-0000(75)80005-5},
  doi          = {10.1016/S0022-0000(75)80005-5},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/ValiantP75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Paterson75,
  author       = {Mike Paterson},
  title        = {Complexity of Monotone Networks for Boolean Matrix Product},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {13--20},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90009-2},
  doi          = {10.1016/0304-3975(75)90009-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Paterson75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FischerMP75,
  author       = {Michael J. Fischer and
                  Albert R. Meyer and
                  Mike Paterson},
  editor       = {William C. Rounds and
                  Nancy Martin and
                  Jack W. Carlyle and
                  Michael A. Harrison},
  title        = {Lower Bounds on the Size of Boolean Formulas: Preliminary Report},
  booktitle    = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing,
                  May 5-7, 1975, Albuquerque, New Mexico, {USA}},
  pages        = {37--44},
  publisher    = {{ACM}},
  year         = {1975},
  url          = {https://doi.org/10.1145/800116.803751},
  doi          = {10.1145/800116.803751},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/FischerMP75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BookNP74,
  author       = {Ronald V. Book and
                  Maurice Nivat and
                  Mike Paterson},
  title        = {Reversal-Bounded Acceptors and Intersections of Linear Languages},
  journal      = {{SIAM} J. Comput.},
  volume       = {3},
  number       = {4},
  pages        = {283--295},
  year         = {1974},
  url          = {https://doi.org/10.1137/0203023},
  doi          = {10.1137/0203023},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BookNP74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BookNP74,
  author       = {Ronald V. Book and
                  Maurice Nivat and
                  Mike Paterson},
  editor       = {Robert L. Constable and
                  Robert W. Ritchie and
                  Jack W. Carlyle and
                  Michael A. Harrison},
  title        = {Intersections of Linear Context-Free Languages and Reversal-Bounded
                  Multipushdown Machines (Extended Abstract)},
  booktitle    = {Proceedings of the 6th Annual {ACM} Symposium on Theory of Computing,
                  April 30 - May 2, 1974, Seattle, Washington, {USA}},
  pages        = {290--296},
  publisher    = {{ACM}},
  year         = {1974},
  url          = {https://doi.org/10.1145/800119.803906},
  doi          = {10.1145/800119.803906},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BookNP74.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MunroP73,
  author       = {J. Ian Munro and
                  Mike Paterson},
  title        = {Optimal Algorithms for Parallel Polynomial Evaluation},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {7},
  number       = {2},
  pages        = {189--198},
  year         = {1973},
  url          = {https://doi.org/10.1016/S0022-0000(73)80043-1},
  doi          = {10.1016/S0022-0000(73)80043-1},
  timestamp    = {Sat, 31 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/MunroP73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PatersonS73,
  author       = {Mike Paterson and
                  Larry J. Stockmeyer},
  title        = {On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials},
  journal      = {{SIAM} J. Comput.},
  volume       = {2},
  number       = {1},
  pages        = {60--66},
  year         = {1973},
  url          = {https://doi.org/10.1137/0202007},
  doi          = {10.1137/0202007},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/PatersonS73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BauerBFMP73,
  author       = {M. Bauer and
                  D. Brand and
                  Michael J. Fischer and
                  Albert R. Meyer and
                  Mike Paterson},
  title        = {A note on disjunctive form tautologies},
  journal      = {{SIGACT} News},
  volume       = {5},
  number       = {2},
  pages        = {17--20},
  year         = {1973},
  url          = {https://doi.org/10.1145/1811123.1811124},
  doi          = {10.1145/1811123.1811124},
  timestamp    = {Thu, 05 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sigact/BauerBFMP73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/automata/ValiantP73,
  author       = {Leslie G. Valiant and
                  Mike Paterson},
  editor       = {Karl{-}Heinz B{\"{o}}hling and
                  Klaus Indermark},
  title        = {Deterministic one-counter automata},
  booktitle    = {1. Fachtagung {\"{u}}ber Automatentheorie und Formale Sprachen,
                  Bonn, 9.-12. Juli 1973, Gesellschaft f{\"{u}}r Informatik {(GI)}},
  series       = {Lecture Notes in Computer Science},
  volume       = {2},
  pages        = {104--115},
  publisher    = {Springer},
  year         = {1973},
  url          = {https://doi.org/10.1007/BFb0039144},
  doi          = {10.1007/BFB0039144},
  timestamp    = {Tue, 14 May 2019 10:00:39 +0200},
  biburl       = {https://dblp.org/rec/conf/automata/ValiantP73.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Paterson72,
  author       = {Mike Paterson},
  title        = {Tape Bounds for Time-Bounded Turing Machines},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {6},
  number       = {2},
  pages        = {116--124},
  year         = {1972},
  url          = {https://doi.org/10.1016/S0022-0000(72)80017-5},
  doi          = {10.1016/S0022-0000(72)80017-5},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/Paterson72.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ershov/Paterson72,
  author       = {Mike Paterson},
  editor       = {Andrei P. Ershov and
                  Valery A. Nepomniaschy},
  title        = {Decision problems in computational models},
  booktitle    = {International Sympoisum on Theoretical Programming, Novosibirsk, Russia,
                  August 7-11, 1972, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5},
  pages        = {85--85},
  publisher    = {Springer},
  year         = {1972},
  url          = {https://doi.org/10.1007/3-540-06720-5\_7},
  doi          = {10.1007/3-540-06720-5\_7},
  timestamp    = {Fri, 17 Jul 2020 16:12:47 +0200},
  biburl       = {https://dblp.org/rec/conf/ershov/Paterson72.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MunroP71,
  author       = {J. Ian Munro and
                  Mike Paterson},
  title        = {Optimal Algorithms for Parallel Polynomial Evaluation},
  booktitle    = {12th Annual Symposium on Switching and Automata Theory, East Lansing,
                  Michigan, USA, October 13-15, 1971},
  pages        = {132--139},
  publisher    = {{IEEE} Computer Society},
  year         = {1971},
  url          = {https://doi.org/10.1109/SWAT.1971.23},
  doi          = {10.1109/SWAT.1971.23},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MunroP71.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatersonS71,
  author       = {Mike Paterson and
                  Larry J. Stockmeyer},
  title        = {Bounds on the Evaluation Time for Rational Polynomials},
  booktitle    = {12th Annual Symposium on Switching and Automata Theory, East Lansing,
                  Michigan, USA, October 13-15, 1971},
  pages        = {140--143},
  publisher    = {{IEEE} Computer Society},
  year         = {1971},
  url          = {https://doi.org/10.1109/SWAT.1971.5},
  doi          = {10.1109/SWAT.1971.5},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/PatersonS71.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LuckhamPP70,
  author       = {David C. Luckham and
                  David Michael Ritchie Park and
                  Mike Paterson},
  title        = {On Formalised Computer Programs},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {4},
  number       = {3},
  pages        = {220--249},
  year         = {1970},
  url          = {https://doi.org/10.1016/S0022-0000(70)80022-8},
  doi          = {10.1016/S0022-0000(70)80022-8},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/LuckhamPP70.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Paterson70,
  author       = {Mike Paterson},
  title        = {Tape-Bounds for Time-Bounded Turing Machines},
  booktitle    = {11th Annual Symposium on Switching and Automata Theory, Santa Monica,
                  California, USA, October 28-30, 1970},
  pages        = {73--75},
  publisher    = {{IEEE} Computer Society},
  year         = {1970},
  url          = {https://doi.org/10.1109/SWAT.1970.25},
  doi          = {10.1109/SWAT.1970.25},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Paterson70.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics