Mike Paterson
University of Warwick, Coventry, UK
Dijkstra Prize
http://www.dcs.warwick.ac.uk/people/academic/Mike.Paterson/
https://scholar.google.com/citations?user=1lFkzWgAAAAJ
https://dl.acm.org/profile/81100275038
https://zbmath.org/authors/?q=ai:paterson.mike-s
https://mathgenealogy.org/id.php?id=51896
https://en.wikipedia.org/wiki/Mike_Paterson
https://www.wikidata.org/entity/Q1659753
http://isni.org/isni/0000000109353601
https://id.loc.gov/authorities/names/n86863622
https://d-nb.info/gnd/1047956071
https://mathscinet.ams.org/mathscinet/MRAuthorID/136785
https://orcid.org/0000-0003-0426-3468
Kazuo Iwama
Mike Paterson
Bounded Hanoi.
303-319
2022
129
Am. Math. Mon.
4
https://doi.org/10.1080/00029890.2022.2026166
db/journals/tamm/tamm129.html#IwamaP22
Artur Czumaj
George Kontogeorgiou
Mike Paterson
Haystack Hunting Hints and Locker Room Communication.
58:1-58:20
2021
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2021.58
conf/icalp/2021
db/conf/icalp/icalp2021.html#CzumajKP21
Dmitry Chistikov 0001
Grzegorz Lisowski
Mike Paterson
Paolo Turrini
Convergence of Opinion Diffusion is PSPACE-Complete.
7103-7110
2020
AAAI
https://doi.org/10.1609/aaai.v34i05.6197
conf/aaai/2020
db/conf/aaai/aaai2020.html#ChistikovLPT20
Dmitry Chistikov 0001
Olga Goulko
Adrian Kent
Mike Paterson
Globe-hopping.
2020
abs/2001.06442
CoRR
https://arxiv.org/abs/2001.06442
db/journals/corr/corr2001.html#abs-2001-06442
Artur Czumaj
George Kontogeorgiou
Mike Paterson
Combinatorial Communication in the Locker Room.
2020
abs/2008.11448
CoRR
https://arxiv.org/abs/2008.11448
db/journals/corr/corr2008.html#abs-2008-11448
Dmitry Chistikov 0001
Grzegorz Lisowski
Mike Paterson
Paolo Turrini
Convergence of Opinion Diffusion is PSPACE-complete.
2019
abs/1912.09864
CoRR
http://arxiv.org/abs/1912.09864
db/journals/corr/corr1912.html#abs-1912-09864
David B. A. Epstein
Mike Paterson
Maximizing the area of intersection of rectangles.
2017
abs/1703.08658
CoRR
http://arxiv.org/abs/1703.08658
db/journals/corr/corr1703.html#EpsteinP17
Thomas Dueholm Hansen
Mike Paterson
Uri Zwick
Improved upper bounds for Random-Edge and Random-Jump on abstract cubes.
874-881
2014
SODA
https://doi.org/10.1137/1.9781611973402.65
conf/soda/2014
db/conf/soda/soda2014.html#HansenPZ14
Haris Aziz 0001
Yoram Bachrach
Edith Elkind
Mike Paterson
False-Name Manipulations in Weighted Voting Games.
2014
abs/1401.3869
CoRR
http://arxiv.org/abs/1401.3869
db/journals/corr/corr1401.html#AzizBEP14
Haris Aziz 0001
Yoram Bachrach
Edith Elkind
Mike Paterson
False-Name Manipulations in Weighted Voting Games.
57-93
2011
40
J. Artif. Intell. Res.
https://doi.org/10.1613/jair.3166
db/journals/jair/jair40.html#AzizBEP11
Hiro Ito
Mike Paterson
Kenya Sugihara
The Multi-Commodity Source Location Problems and the Price of Greed.
55-73
2009
13
J. Graph Algorithms Appl.
1
https://doi.org/10.7155/jgaa.00176
db/journals/jgaa/jgaa13.html#ItoPS09
Mike Paterson
Uri Zwick
Overhang.
19-44
2009
116
Am. Math. Mon.
1
http://www.jstor.org/stable/27642662
db/journals/tamm/tamm116.html#PatersonZ09
Mike Paterson
Yuval Peres
Mikkel Thorup
Peter Winkler 0001
Uri Zwick
Maximum Overhang.
763-787
2009
116
Am. Math. Mon.
9
http://www.jstor.org/stable/40391297
db/journals/tamm/tamm116.html#PatersonPTWZ09
Haris Aziz 0001
Oded Lachish
Mike Paterson
Rahul Savani
Power Indices in Spanning Connectivity Games.
55-67
2009
AAIM
https://doi.org/10.1007/978-3-642-02158-9_7
conf/aaim/2009
db/conf/aaim/aaim2009.html#AzizLPS09
Haris Aziz 0001
Mike Paterson
False name manipulations in weighted voting games: splitting, merging and annexation.
409-416
2009
AAMAS (1)
https://dl.acm.org/citation.cfm?id=1558069
conf/atal/2009-1
db/conf/atal/aamas2009-1.html#AzizP09
Haris Aziz 0001
Oded Lachish
Mike Paterson
Rahul Savani
Wiretapping a Hidden Network.
438-446
2009
WINE
https://doi.org/10.1007/978-3-642-10841-9_40
conf/wine/2009
db/conf/wine/wine2009.html#AzizLPS09
Haris Aziz 0001
Mike Paterson
False name manipulations in weighted voting games: splitting, merging and annexation
http://arxiv.org/abs/0905.3348
2009
CoRR
abs/0905.3348
db/journals/corr/corr0905.html#abs-0905-3348
Haris Aziz 0001
Oded Lachish
Mike Paterson
Rahul Savani
Spanning connectivity games
http://arxiv.org/abs/0906.3643
2009
CoRR
abs/0906.3643
db/journals/corr/corr0906.html#abs-0906-3643
Haris Aziz 0001
Oded Lachish
Mike Paterson
Rahul Savani
Wiretapping a hidden network
http://arxiv.org/abs/0909.5293
2009
CoRR
abs/0909.5293
db/journals/corr/corr0909.html#abs-0909-5293
Marcin Jurdzinski
Mike Paterson
Uri Zwick
A Deterministic Subexponential Algorithm for Solving Parity Games.
1519-1532
2008
38
SIAM J. Comput.
4
https://doi.org/10.1137/070686652
db/journals/siamcomp/siamcomp38.html#JurdzinskiPZ08
Kazuo Iwama
Harumichi Nishimura
Mike Paterson
Rudy Raymond
Shigeru Yamashita
Polynomial-Time Construction of Linear Network Coding.
271-282
2008
ICALP (1)
https://doi.org/10.1007/978-3-540-70575-8_23
conf/icalp/2008-1
db/conf/icalp/icalp2008-1.html#IwamaNPRY08
Mike Paterson
Yuval Peres
Mikkel Thorup
Peter Winkler 0001
Uri Zwick
Maximum overhang.
756-765
2008
SODA
http://dl.acm.org/citation.cfm?id=1347082.1347165
conf/soda/2008
db/conf/soda/soda2008.html#PatersonPTWZ08
Hiro Ito
Mike Paterson
Kenya Sugihara
Multi-commodity Source Location Problems and Price of Greed.
169-179
2008
conf/walcom/2008
WALCOM
https://doi.org/10.1007/978-3-540-77891-2_16
db/conf/walcom/walcom2008.html#ItoPS08
Haris Aziz 0001
Mike Paterson
Computing voting power in easy weighted voting games
http://arxiv.org/abs/0811.2497
2008
CoRR
abs/0811.2497
db/journals/corr/corr0811.html#abs-0811-2497
Martin E. Dyer
Leslie Ann Goldberg
Mike Paterson
On counting homomorphisms to directed acyclic graphs.
2007
54
J. ACM
6
https://doi.org/10.1145/1314690.1314691
https://www.wikidata.org/entity/Q56323861
db/journals/jacm/jacm54.html#DyerGP07
27
Bo Chen 0002
Mike Paterson
Guochuan Zhang
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers
ESCAPE
Lecture Notes in Computer Science
4614
Springer
2007
978-3-540-74449-8
https://doi.org/10.1007/978-3-540-74450-4
https://www.wikidata.org/entity/Q56212218
db/conf/escape/escape2007.html
Martin E. Dyer
Leslie Ann Goldberg
Mike Paterson
On Counting Homomorphisms to Directed Acyclic Graphs.
38-49
2006
conf/icalp/2006-1
ICALP (1)
https://doi.org/10.1007/11786986_5
https://www.wikidata.org/entity/Q56323889
db/conf/icalp/icalp2006-1.html#DyerGP06
Marcin Jurdzinski
Mike Paterson
Uri Zwick
A deterministic subexponential algorithm for solving parity games.
117-123
2006
conf/soda/2006
SODA
http://dl.acm.org/citation.cfm?id=1109557.1109571
db/conf/soda/soda2006.html#JurdzinskiPZ06
Mike Paterson
Uri Zwick
Overhang.
231-240
2006
conf/soda/2006
SODA
http://dl.acm.org/citation.cfm?id=1109557.1109584
db/conf/soda/soda2006.html#PatersonZ06
Leslie Ann Goldberg
Russell A. Martin
Mike Paterson
Strong Spatial Mixing with Fewer Colors for Lattice Graphs.
486-517
2005
35
SIAM J. Comput.
2
https://doi.org/10.1137/S0097539704445470
db/journals/siamcomp/siamcomp35.html#GoldbergMP05
Martin E. Dyer
Leslie Ann Goldberg
Mike Paterson
On counting homomorphisms to directed acyclic graphs
Electron. Colloquium Comput. Complex.
2005
TR05
TR05-121
db/journals/eccc/eccc12.html#TR05-121
https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-121/index.html
Leslie Ann Goldberg
Russell A. Martin
Mike Paterson
Random sampling of 3-colorings in Z2.
279-302
2004
24
Random Struct. Algorithms
3
https://doi.org/10.1002/rsa.20002
db/journals/rsa/rsa24.html#GoldbergMP04
Leslie Ann Goldberg
Mark Jerrum
Sampath Kannan
Mike Paterson
A bound on the capacity of backoff and acknowledgment-based protocols.
313-331
2004
33
SIAM J. Comput.
2
https://doi.org/10.1137/S0097539700381851
db/journals/siamcomp/siamcomp33.html#GoldbergJKP04
Leslie Ann Goldberg
Steven Kelk
Mike Paterson
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random.
416-432
2004
33
SIAM J. Comput.
2
https://doi.org/10.1137/S0097539702408363
db/journals/siamcomp/siamcomp33.html#GoldbergKP04
Leslie Ann Goldberg
Russell A. Martin
Mike Paterson
trong Spatial Mixing for Lattice Graphs with Fewer Colours.
562-571
2004
conf/focs/2004
FOCS
https://doi.org/10.1109/FOCS.2004.63
https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.63
db/conf/focs/focs2004.html#GoldbergMP04
Mike Paterson
Analysis of Scheduling Algorithms for Proportionate Fairness.
1
https://doi.org/10.1007/978-3-540-24698-5_1
2004
conf/latin/2004
LATIN
db/conf/latin/latin2004.html#Paterson04
Leslie Ann Goldberg
Mark Jerrum
Mike Paterson
The computational complexity of two-state spin systems.
133-154
2003
23
Random Struct. Algorithms
2
https://doi.org/10.1002/rsa.10090
db/journals/rsa/rsa23.html#GoldbergJP03
Kazuo Iwama
Akihiro Matsuura
Mike Paterson
A family of NFAs which need 2n- deterministic states.
451-462
2003
301
Theor. Comput. Sci.
1-3
https://doi.org/10.1016/S0304-3975(02)00891-5
db/journals/tcs/tcs301.html#IwamaMP03
Micah Adler
Petra Berenbrink
Tom Friedetzky
Leslie Ann Goldberg
Paul W. Goldberg
Mike Paterson
A proportionate fair scheduling rule with good worst-case performance.
101-108
2003
conf/spaa/2003
SPAA
https://doi.org/10.1145/777412.777430
db/conf/spaa/spaa2003.html#AdlerBFGGP03
Mike Paterson
Heiko Schröder 0001
Ondrej Sýkora
Imrich Vrto
Permutation Communication in All-Optical Rings.
23-29
2002
12
Parallel Process. Lett.
1
https://doi.org/10.1142/S0129626402000793
db/journals/ppl/ppl12.html#PatersonSSV02
Leslie Ann Goldberg
Steven Kelk
Mike Paterson
The complexity of choosing an H-colouring (nearly) uniformly at random.
53-62
2002
conf/stoc/2002
STOC
https://doi.org/10.1145/509907.509917
db/conf/stoc/stoc2002.html#GoldbergKP02
Leslie Ann Goldberg
Paul W. Goldberg
Mike Paterson
Pavel A. Pevzner
Süleyman Cenk Sahinalp
Elizabeth Sweedyk
The Complexity of Gene Placement.
225-243
2001
41
J. Algorithms
2
https://doi.org/10.1006/jagm.2001.1172
db/journals/jal/jal41.html#GoldbergGPPSS01
Leslie Ann Goldberg
Mike Paterson
Aravind Srinivasan
Elizabeth Sweedyk
Better Approximation Guarantees for Job-Shop Scheduling.
67-92
2001
14
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480199326104
db/journals/siamdm/siamdm14.html#GoldbergPSS01
Leslie Ann Goldberg
Philip D. MacKenzie
Mike Paterson
Aravind Srinivasan
Contention resolution with constant expected delay.
1048-1096
2000
47
J. ACM
6
https://doi.org/10.1145/355541.355567
db/journals/jacm/jacm47.html#GoldbergMPS00
Somasundaram Ravindran
Alan Gibbons
Mike Paterson
Dense edge-disjoint embedding of complete binary trees in interconnection networks.
325-342
2000
249
Theor. Comput. Sci.
2
db/journals/tcs/tcs249.html#RavindranGP00
https://doi.org/10.1016/S0304-3975(00)00066-9
Leslie Ann Goldberg
Mark Jerrum
Sampath Kannan
Mike Paterson
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols.
705-716
https://doi.org/10.1007/3-540-45022-X_59
2000
conf/icalp/2000
ICALP
db/conf/icalp/icalp2000.html#GoldbergJKP00
Micah Adler
Faith E. Fich
Leslie Ann Goldberg
Mike Paterson
Tight Size Bounds for Packet Headers in Narrow Meshes.
756-767
https://doi.org/10.1007/3-540-45022-X_63
2000
conf/icalp/2000
ICALP
db/conf/icalp/icalp2000.html#AdlerFGP00
Kazuo Iwama
Akihiro Matsuura
Mike Paterson
A Family of NFA's Which Need 2n -alpha Deterministic States.
436-445
https://doi.org/10.1007/3-540-44612-5_39
2000
conf/mfcs/2000
MFCS
db/conf/mfcs/mfcs2000.html#IwamaMP00
Graham Cormode
Mike Paterson
Süleyman Cenk Sahinalp
Uzi Vishkin
Communication complexity of document exchange.
197-206
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338252
db/conf/soda/soda2000.html#CormodePSV00
Mike Paterson
Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings
ESA
Lecture Notes in Computer Science
1879
Springer
2000
3-540-41004-X
https://doi.org/10.1007/3-540-45253-2
db/conf/esa/esa2000.html
Michael J. Fischer
Mike Paterson
Optimal Layout of Edge-weighted Forests.
135-159
1999
90
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(98)00088-2
db/journals/dam/dam90.html#FischerP99
Mike Paterson
The chip in your wallet - The technology of security in smartcard chip manufacture.
13-18
1999
4
Inf. Secur. Tech. Rep.
2
https://doi.org/10.1016/S0167-4048(99)80010-7
db/journals/istr/istr4.html#Paterson99
Richa Agarwala
Vineet Bafna
Martin Farach
Mike Paterson
Mikkel Thorup
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics).
1073-1085
1999
28
SIAM J. Comput.
3
db/journals/siamcomp/siamcomp28.html#AgarwalaBFPT99
https://doi.org/10.1137/S0097539795296334
Leslie Ann Goldberg
Paul W. Goldberg
Mike Paterson
Pavel A. Pevzner
Süleyman Cenk Sahinalp
Elizabeth Sweedyk
The Complexity of Gene Placement.
386-395
1999
conf/soda/1999
SODA
http://dl.acm.org/citation.cfm?id=314500.314591
db/conf/soda/soda99.html#GoldbergGPPSS99
S. Muthukrishnan 0001
Mike Paterson
Süleyman Cenk Sahinalp
Torsten Suel
Compact Grid Layouts of Multi-Level Networks.
455-463
1999
conf/stoc/1999
STOC
https://doi.org/10.1145/301250.301372
db/conf/stoc/stoc1999.html#MuthukrishnanPSS99
Maxime Crochemore
Mike Paterson
Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings
CPM
Lecture Notes in Computer Science
1645
Springer
1999
3-540-66278-2
https://doi.org/10.1007/3-540-48452-3
db/conf/cpm/cpm99.html
Akira Maruoka
Mike Paterson
Hirotaka Koizumi
Consistency of Natural Relations on Sets.
281-293
1998
7
Comb. Probab. Comput.
3
db/journals/cpc/cpc7.html#MaruokaPK98
http://journals.cambridge.org/action/displayAbstract?aid=46647
Mike Paterson
Heiko Schröder 0001
Ondrej Sýkora
Imrich Vrto
On permutation communications in all-optical rings.
1-9
1998
conf/sirocco/1998
SIROCCO
db/conf/sirocco/sirocco1998.html#PatersonSSV98
Sanjeev Khanna
S. Muthukrishnan 0001
Mike Paterson
On Approximating Rectangle Tiling and Packing.
384-393
1998
conf/soda/1998
SODA
db/conf/soda/soda98.html#KhannaMP98
http://dl.acm.org/citation.cfm?id=314613.314768
Shimon Even
S. Muthukrishnan 0001
Mike Paterson
Süleyman Cenk Sahinalp
Layout of the Batcher Bitonic Sorter (Extended Abstract).
172-181
1998
conf/spaa/1998
SPAA
https://doi.org/10.1145/277651.277683
db/conf/spaa/spaa98.html#EvenMPS98
Amos Beimel
Anna Gál
Mike Paterson
Lower Bounds for Monotone Span Programs.
29-45
1997
6
Comput. Complex.
1
db/journals/cc/cc6.html#BeimelGP97
https://doi.org/10.1007/BF01202040
David Eppstein
Mike Paterson
F. Frances Yao
On Nearest-Neighbor Graphs.
263-282
1997
17
Discret. Comput. Geom.
3
https://doi.org/10.1007/PL00009293
https://www.wikidata.org/entity/Q61645302
db/journals/dcg/dcg17.html#EppsteinPY97
Aviezri S. Fraenkel
Jamie Simpson
Mike Paterson
On Weak Circular Squares in Binary Words.
76-82
1997
conf/cpm/1997
CPM
db/conf/cpm/cpm97.html#FraenkelSP97
https://doi.org/10.1007/3-540-63220-4_51
Leslie Ann Goldberg
Mike Paterson
Aravind Srinivasan
Elizabeth Sweedyk
Better Approximation Guarantees for Job-shop Scheduling.
599-608
1997
conf/soda/1997
SODA
db/conf/soda/soda97.html#GoldbergPSS97
http://dl.acm.org/citation.cfm?id=314161.314395
Mike Paterson
Teresa M. Przytycka
On the Complexity of String Folding.
217-230
1996
71
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(96)00065-0
db/journals/dam/dam71.html#PatersonP96
Peter Bro Miltersen
Mike Paterson
Jun Tarui
The Asymptotic Complexity of Merging Networks.
147-165
1996
43
J. ACM
1
db/journals/jacm/jacm43.html#MiltersenPT96
https://doi.org/10.1145/227595.227693
Uri Zwick
Mike Paterson
The Complexity of Mean Payoff Games on Graphs.
343-359
1996
158
Theor. Comput. Sci.
1&2
db/journals/tcs/tcs158.html#ZwickP96
https://doi.org/10.1016/0304-3975(95)00188-3
Mike Paterson
Teresa M. Przytycka
On the Complexity of String Folding.
658-669
1996
conf/icalp/1996
ICALP
db/conf/icalp/icalp96.html#PatersonP96
https://doi.org/10.1007/3-540-61440-0_167
Richa Agarwala
Vineet Bafna
Martin Farach
Babu O. Narayanan
Mike Paterson
Mikkel Thorup
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics).
365-372
1996
conf/soda/1996
SODA
db/conf/soda/soda96.html#AgarwalaBFOPT96
http://dl.acm.org/citation.cfm?id=313852.314084
Mike Paterson
Progress in Selection.
368-379
1996
conf/swat/1996
SWAT
db/conf/swat/swat96.html#Paterson96
https://doi.org/10.1007/3-540-61422-2_146
Alain P. Hiltgen
Mike Paterson
PIk Mass Production and an Optimal Circuit for the Neciporuk Slice.
132-154
1995
5
Comput. Complex.
2
db/journals/cc/cc5.html#HiltgenP95
https://doi.org/10.1007/BF01268142
Vlado Dancík
Mike Paterson
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
449-458
1995
6
Random Struct. Algorithms
4
db/journals/rsa/rsa6.html#DancekP95
https://doi.org/10.1002/rsa.3240060408
Richard Cole 0001
Ramesh Hariharan
Mike Paterson
Uri Zwick
Tighter Lower Bounds on the Exact Complexity of String Matching.
30-45
1995
24
SIAM J. Comput.
1
db/journals/siamcomp/siamcomp24.html#ColeHPZ95
https://doi.org/10.1137/S0097539793245829
Uri Zwick
Mike Paterson
The Complexity of Mean Payoff Games.
1-10
1995
conf/cocoon/1995
COCOON
db/conf/cocoon/cocoon95.html#ZwickP95
https://doi.org/10.1007/BFb0030814
Mike Paterson
Aravind Srinivasan
Contention Resolution with Bounded Delay.
104-113
1995
conf/focs/1995
FOCS
db/conf/focs/focs95.html#PatersonS95
https://doi.org/10.1109/SFCS.1995.492467
https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492467
Amos Beimel
Anna Gál
Mike Paterson
Lower Bounds for Monotone Span Programs.
674-681
1995
conf/focs/1995
FOCS
db/conf/focs/focs95.html#BeimelGP95
https://doi.org/10.1109/SFCS.1995.492669
https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492669
Mike Paterson
Shlomit Tassa
Uri Zwick
Looking for MUM and DAD: Text-Text Comparisons Do Help.
1-10
1995
conf/fsttcs/1995
FSTTCS
db/conf/fsttcs/fsttcs95.html#PatersonTZ95
https://doi.org/10.1007/3-540-60692-0_36
Amos Beimel
Anna Gál
Mike Paterson
Lower Bounds for Monotone Span Programs
Electron. Colloquium Comput. Complex.
1995
TR95-001
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-001
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-001/index.html
Uri Zwick
Mike Paterson
The Complexity of Mean Payoff Games on Graphs
Electron. Colloquium Comput. Complex.
1995
TR95-040
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-040
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-040/index.html
Michael J. Fischer
Mike Paterson
Fishspear: A Priority Queue Algorithm.
3-30
1994
41
J. ACM
1
db/journals/jacm/jacm41.html#FischerP94
https://doi.org/10.1145/174644.174645
Mike Paterson
David Michael Ritchie Park (1935-1990) in Memoriam.
187-200
1994
133
Theor. Comput. Sci.
1
db/journals/tcs/tcs133.html#Paterson94
Mike Paterson
Vlado Dancík
Longest Common Subsequences.
127-142
1994
conf/mfcs/1994
MFCS
db/conf/mfcs/mfcs94.html#PatersonD94
https://doi.org/10.1007/3-540-58338-6_63
Vlado Dancík
Mike Paterson
Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences.
669-678
1994
conf/stacs/1994
STACS
db/conf/stacs/stacs94.html#DancikP94
https://doi.org/10.1007/3-540-57785-8_180
Mike Paterson
Uri Zwick
Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication.
262-291
1993
3
Comput. Complex.
db/journals/cc/cc3.html#PatersonZ93
https://doi.org/10.1007/BF01271371
Mike Paterson
Heiko Schröder 0001
Ondrej Sýkora
Imrich Vrto
A Short Proof of the Dilation of a Toroidal Mesh in a Path.
197-199
1993
48
Inf. Process. Lett.
4
db/journals/ipl/ipl48.html#PatersonSSV93
https://doi.org/10.1016/0020-0190(93)90145-Y
Mike Paterson
Uri Zwick
Shrinkage of de Morgan Formulae under Restriction.
135-150
1993
4
Random Struct. Algorithms
2
db/journals/rsa/rsa4.html#PatersonZ93
https://doi.org/10.1002/rsa.3240040203
Uri Zwick
Mike Paterson
The Memory Game.
169-196
1993
110
Theor. Comput. Sci.
1
db/journals/tcs/tcs110.html#ZwickP93
https://doi.org/10.1016/0304-3975(93)90355-W
https://www.wikidata.org/entity/Q56638788
Mike Paterson
Evolution of an Algorithm.
306-308
1993
conf/esa/1993
ESA
db/conf/esa/esa93.html#Paterson93
https://doi.org/10.1007/3-540-57273-2_65
Richard Cole 0001
Ramesh Hariharan
Mike Paterson
Uri Zwick
Which Patterns are Hard to Find?
59-68
1993
conf/istcs/1993
ISTCS
db/conf/istcs/istcs1993.html#ColeHPZ93
https://doi.org/10.1109/ISTCS.1993.253483
https://doi.ieeecomputersociety.org/10.1109/ISTCS.1993.253483
Mike Paterson
F. Frances Yao
Optimal Binary Space Partitions for Orthogonal Objects.
99-113
1992
13
J. Algorithms
1
db/journals/jal/jal13.html#PatersonY92
https://doi.org/10.1016/0196-6774(92)90007-Y
The Asymptotic Complexity of Merging Networks
Peter Bro Miltersen
Mike Paterson
Jun Tarui
236-246
conf/focs/FOCS33
1992
FOCS
db/conf/focs/focs92.html#MiltersenPT92
https://doi.org/10.1109/SFCS.1992.267768
https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267768
Mike Paterson
F. Frances Yao
On Nearest-Neighbor Graphs.
416-426
1992
conf/icalp/1992
ICALP
db/conf/icalp/icalp92.html#PatersonY92
https://doi.org/10.1007/3-540-55719-9_93
Mike Paterson
Boolean Circuit Complexity.
187
1992
conf/isaac/1992
ISAAC
db/conf/isaac/isaac92.html#Paterson92
https://doi.org/10.1007/3-540-56279-6_71
Alan Gibbons
Mike Paterson
Dense Edge-Disjoint Embedding of Binary Trees in the Mesh.
257-263
1992
conf/spaa/1992
SPAA
https://doi.org/10.1145/140901.141876
db/conf/spaa/spaa92.html#GibbonsP92
Shallow Multiplication Circuits and Wise Financial Investments
Mike Paterson
Uri Zwick
429-437
conf/stoc/STOC24
1992
STOC
db/conf/stoc/stoc92.html#PatersonZ92
https://doi.org/10.1145/129712.129753
https://www.wikidata.org/entity/Q60299188
Planar Acyclic Computation
William F. McColl
Mike Paterson
Brian H. Bowditch
178-193
Inf. Comput.
February
1991
90
2
db/journals/iandc/iandc90.html#McCollPB91
https://doi.org/10.1016/0890-5401(91)90003-K
Mike Paterson
Alexander A. Razborov
The Set of Minimal Braids is co-NP-Complete.
393-408
1991
12
J. Algorithms
3
db/journals/jal/jal12.html#PatersonR91
https://doi.org/10.1016/0196-6774(91)90011-M
Shrinkage of de~Morgan formulae under restriction
Mike Paterson
Uri Zwick
324-333
conf/focs/FOCS32
1991
FOCS
db/conf/focs/focs91.html#PatersonZ91
https://doi.org/10.1109/SFCS.1991.185385
https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185385
Josep Díaz
Alan Gibbons
Mike Paterson
Jacobo Torán
The MINSUMCUT Problem.
65-89
1991
conf/wads/1991
WADS
db/conf/wads/wads91.html#DiazGPT91
https://doi.org/10.1007/BFb0028251
Mike Paterson
Improved Sorting Networks with O(log N) Depth.
65-92
1990
5
Algorithmica
1
db/journals/algorithmica/algorithmica5.html#Paterson90
https://doi.org/10.1007/BF01840378
https://www.wikidata.org/entity/Q56337888
Clyde L. Monma
Mike Paterson
Subhash Suri
F. Frances Yao
Computing Euclidean Maximum Spanning Trees.
407-419
1990
5
Algorithmica
3
db/journals/algorithmica/algorithmica5.html#MonmaPSY90
https://doi.org/10.1007/BF01840396
Mike Paterson
F. Frances Yao
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
485-503
1990
5
Discret. Comput. Geom.
db/journals/dcg/dcg5.html#PatersonY90
https://doi.org/10.1007/BF02187806
https://www.wikidata.org/entity/Q106190047
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions
Mike Paterson
Nicholas Pippenger
Uri Zwick
642-650
conf/focs/FOCS31b
1990
FOCS
db/conf/focs/focs90.html#PatersonPZ90
https://doi.org/10.1109/FSCS.1990.89586
https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89586
Mike Paterson
F. Frances Yao
Optimal Binary Space Partitions for Orthogonal Objects.
100-106
1990
conf/soda/1990
SODA
db/conf/soda/soda90.html#PatersonY90
http://dl.acm.org/citation.cfm?id=320176.320187
Mike Paterson
Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings
ICALP
Lecture Notes in Computer Science
443
Springer
1990
3-540-52826-1
https://doi.org/10.1007/BFb0032016
db/conf/icalp/icalp90.html
F. Frances Yao
David P. Dobkin
Herbert Edelsbrunner
Mike Paterson
Partitioning Space for Range Queries.
371-384
1989
18
SIAM J. Comput.
2
db/journals/siamcomp/siamcomp18.html#YaoDEP89
https://doi.org/10.1137/0218025
Mike Paterson
F. Frances Yao
Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling.
23-32
1989
conf/compgeom/1989
SCG
https://doi.org/10.1145/73833.73836
db/conf/compgeom/compgeom89.html#PatersonY89
Mike Paterson
Universal Chains and Wiring Layouts.
80-85
1988
1
SIAM J. Discret. Math.
1
db/journals/siamdm/siamdm1.html#Paterson88
https://doi.org/10.1137/0401009
Clyde L. Monma
Mike Paterson
Subhash Suri
F. Frances Yao
Computing Euclidean Maximum Spanning Trees.
241-251
1988
conf/compgeom/1988
SCG
https://doi.org/10.1145/73393.73418
db/conf/compgeom/compgeom88.html#MonmaPSY89
William F. McColl
Mike Paterson
The Planar Realization of Boolean Functions.
165-170
1987
24
Inf. Process. Lett.
3
db/journals/ipl/ipl24.html#McCollP87
https://doi.org/10.1016/0020-0190(87)90180-3
Mike Paterson
Ingo Wegener
Nearly Optimal Hierarchies for Network and Formula Size.
217-221
1986
23
Acta Informatica
2
db/journals/acta/acta23.html#PatersonW86
https://doi.org/10.1007/BF00289499
Mike Paterson
F. Frances Yao
Point Retrieval for Polygons.
441-447
1986
7
J. Algorithms
3
db/journals/jal/jal7.html#PatersonY86
https://doi.org/10.1016/0196-6774(86)90033-7
Impossibility of Distributed Consensus with One Faulty Process
Michael J. Fischer
Nancy A. Lynch
Mike Paterson
374-382
J. ACM
April
1985
32
2
db/journals/jacm/jacm32.html#FischerLP85
https://doi.org/10.1145/3149.214121
https://www.wikidata.org/entity/Q55951797
JACM/32/P0374.pdf
Dynamic Monotone Priorities on Planar Sets (Extended Abstract)
Michael J. Fischer
Mike Paterson
289-292
conf/focs/FOCS26
1985
FOCS
db/conf/focs/focs85.html#FischerP85
https://doi.org/10.1109/SFCS.1985.21
https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.21
David Harel
Mike Paterson
Undecidability of PDL with L={a^(2i)|i>=0}.
359-365
1984
29
J. Comput. Syst. Sci.
3
db/journals/jcss/jcss29.html#HarelP84
https://doi.org/10.1016/0022-0000(84)90005-9
Fishspear: A Priority Queue Algorithm (Extended Abstract)
Michael J. Fischer
Mike Paterson
375-386
conf/focs/FOCS25
1984
FOCS
db/conf/focs/focs84.html#FischerP84
https://doi.org/10.1109/SFCS.1984.715938
https://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715938
Michael J. Fischer
Mike Paterson
Storage Requirements for Fair Scheduling.
249-250
1983
17
Inf. Process. Lett.
5
db/journals/ipl/ipl17.html#FischerP83
https://doi.org/10.1016/0020-0190(83)90107-2
conf/pods/83
Michael J. Fischer
Nancy A. Lynch
Mike Paterson
Impossibility of Distributed Consensus with One Faulty Process.
1-7
1983
PODS
db/conf/pods/pods83.html#FischerLP83
https://doi.org/10.1145/588058.588060
journals/anthology/cd1-3:PODS83/P001.PDF
journals/anthology/dvd1:text/1-3/PODS83/P001.PDF
...
conf/stoc/DeMilloLM82
...
conf/stoc/DolevS82
journals/ipl/FischerL82
journals/tc/Garcia-Molina82
...
...
...
...
...
journals/toplas/LamportSP82
journals/jacm/PeaseSL80
...
journals/tods/RosenkrantzSL78
...
conf/berkeley/SkeenS81
Albert G. Greenberg
Richard E. Ladner
Mike Paterson
Zvi Galil
Efficient Parallel Algorithms for Linear Recurrence Computation.
31-35
1982
15
Inf. Process. Lett.
1
db/journals/ipl/ipl15.html#GreenbergLPG82
https://doi.org/10.1016/0020-0190(82)90081-3
Michael J. Fischer
Albert R. Meyer
Mike Paterson
Omega(n log n) Lower Bounds on Length of Boolean Formulas.
416-427
1982
11
SIAM J. Comput.
3
db/journals/siamcomp/siamcomp11.html#FischerMP82
https://doi.org/10.1137/0211033
Robert J. Fowler
Mike Paterson
Steven L. Tanimoto
Optimal Packing and Covering in the Plane are NP-Complete.
133-137
1981
12
Inf. Process. Lett.
3
db/journals/ipl/ipl12.html#FowlerPT81
https://doi.org/10.1016/0020-0190(81)90111-3
https://www.wikidata.org/entity/Q57568241
Francine Berman
Mike Paterson
Propositional Dynamic Logic is Weaker without Tests.
321-328
1981
16
Theor. Comput. Sci.
db/journals/tcs/tcs16.html#BermanP81
https://doi.org/10.1016/0304-3975(81)90102-X
Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract)
Mike Paterson
Walter L. Ruzzo
Lawrence Snyder
293-299
conf/stoc/STOC13
1981
STOC
db/conf/stoc/stoc81.html#PatersonRS81
https://doi.org/10.1145/800076.802481
William J. Masek
Mike Paterson
A Faster Algorithm Computing String Edit Distances.
18-31
1980
20
J. Comput. Syst. Sci.
1
db/journals/jcss/jcss20.html#MasekP80
https://doi.org/10.1016/0022-0000(80)90002-1
https://www.wikidata.org/entity/Q55891303
Peter Klein
Mike Paterson
Asymtotically Optimal Circuit for a Storage Access Function.
737-738
1980
29
IEEE Trans. Computers
8
db/journals/tc/tc29.html#KleinP80
https://doi.org/10.1109/TC.1980.1675657
http://doi.ieeecomputersociety.org/10.1109/TC.1980.1675657
J. Ian Munro
Mike Paterson
Selection and Sorting with Limited Storage.
315-323
1980
12
Theor. Comput. Sci.
db/journals/tcs/tcs12.html#MunroP80
https://doi.org/10.1016/0304-3975(80)90061-4
https://www.wikidata.org/entity/Q59795779
Optimal Tree Layout (Preliminary Version)
Michael J. Fischer
Mike Paterson
177-189
conf/stoc/STOC12
1980
STOC
db/conf/stoc/stoc80.html#FischerP80
https://doi.org/10.1145/800141.804665
Mike Paterson
The linear postman: a message-forwarding algorithm using sequential storage.
463
1979
conf/ershov/1979
Algorithms in Modern Mathematics and Computer Science
db/conf/ershov/ershov1979.html#Paterson79
Mike Paterson
Mark N. Wegman
Linear Unification.
158-167
1978
16
J. Comput. Syst. Sci.
2
db/journals/jcss/jcss16.html#PatersonW78
https://doi.org/10.1016/0022-0000(78)90043-0
https://www.wikidata.org/entity/Q56092429
Selection and Sorting with Limited Storage
J. Ian Munro
Mike Paterson
253-258
conf/focs/FOCS19
1978
FOCS
db/conf/focs/focs78.html#MunroP78
https://doi.org/10.1109/SFCS.1978.32
https://doi.ieeecomputersociety.org/10.1109/SFCS.1978.32
William F. McColl
Mike Paterson
The Depth of All Boolean Functions.
373-380
1977
6
SIAM J. Comput.
2
db/journals/siamcomp/siamcomp6.html#McCollP77
https://doi.org/10.1137/0206026
Mike Paterson
New bounds on formula size.
17-26
1977
conf/tcs/1977
Theoretical Computer Science
db/conf/tcs/tcs1977.html#Paterson77
https://doi.org/10.1007/3-540-08138-0_2
Arnold Schönhage
Mike Paterson
Nicholas Pippenger
Finding the Median.
184-199
1976
13
J. Comput. Syst. Sci.
2
db/journals/jcss/jcss13.html#SchonhagePP76
https://doi.org/10.1016/S0022-0000(76)80029-3
Mike Paterson
Leslie G. Valiant
Circuit Size is Nonlinear in Depth.
397-400
1976
2
Theor. Comput. Sci.
3
db/journals/tcs/tcs2.html#PatersonV76
https://doi.org/10.1016/0304-3975(76)90090-6
Linear Unification
Mike Paterson
Mark N. Wegman
181-186
conf/stoc/STOC8
1976
STOC
db/conf/stoc/stoc76.html#PatersonW76
https://doi.org/10.1145/800113.803646
Leslie G. Valiant
Mike Paterson
Deterministic One-Counter Automata.
340-350
1975
10
J. Comput. Syst. Sci.
3
db/journals/jcss/jcss10.html#ValiantP75
https://doi.org/10.1016/S0022-0000(75)80005-5
Mike Paterson
Complexity of Monotone Networks for Boolean Matrix Product.
13-20
1975
1
Theor. Comput. Sci.
1
db/journals/tcs/tcs1.html#Paterson75
https://doi.org/10.1016/0304-3975(75)90009-2
Lower Bounds on the Size of Boolean Formulas: Preliminary Report
Michael J. Fischer
Albert R. Meyer
Mike Paterson
37-44
conf/stoc/STOC7
1975
STOC
db/conf/stoc/stoc75.html#FischerMP75
https://doi.org/10.1145/800116.803751
Ronald V. Book
Maurice Nivat
Mike Paterson
Reversal-Bounded Acceptors and Intersections of Linear Languages.
283-295
1974
3
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp3.html#BookNP74
https://doi.org/10.1137/0203023
Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract)
Ronald V. Book
Maurice Nivat
Mike Paterson
290-296
conf/stoc/STOC6
1974
STOC
db/conf/stoc/stoc74.html#BookNP74
https://doi.org/10.1145/800119.803906
J. Ian Munro
Mike Paterson
Optimal Algorithms for Parallel Polynomial Evaluation.
189-198
1973
7
J. Comput. Syst. Sci.
2
db/journals/jcss/jcss7.html#MunroP73
https://doi.org/10.1016/S0022-0000(73)80043-1
https://www.wikidata.org/entity/Q107417322
Mike Paterson
Larry J. Stockmeyer
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials.
60-66
1973
2
SIAM J. Comput.
1
db/journals/siamcomp/siamcomp2.html#PatersonS73
https://doi.org/10.1137/0202007
https://www.wikidata.org/entity/Q114074411
M. Bauer
D. Brand
Michael J. Fischer
Albert R. Meyer
Mike Paterson
A note on disjunctive form tautologies.
17-20
1973
5
SIGACT News
2
https://doi.org/10.1145/1811123.1811124
db/journals/sigact/sigact5.html#BauerBFMP73
Leslie G. Valiant
Mike Paterson
Deterministic one-counter automata.
104-115
1973
conf/automata/1973
Automatentheorie und Formale Sprachen
db/conf/automata/automata1973.html#ValiantP73
https://doi.org/10.1007/BFb0039144
Mike Paterson
Tape Bounds for Time-Bounded Turing Machines.
116-124
1972
6
J. Comput. Syst. Sci.
2
db/journals/jcss/jcss6.html#Paterson72
https://doi.org/10.1016/S0022-0000(72)80017-5
Mike Paterson
Decision problems in computational models.
85-85
1972
conf/ershov/1972
International Sympoisum on Theoretical Programming
db/conf/ershov/ershov1972.html#Paterson72
https://doi.org/10.1007/3-540-06720-5_7
Optimal Algorithms for Parallel Polynomial Evaluation
J. Ian Munro
Mike Paterson
132-139
conf/focs/FOCS12
1971
SWAT
db/conf/focs/focs71.html#MunroP71
https://doi.org/10.1109/SWAT.1971.23
https://doi.ieeecomputersociety.org/10.1109/SWAT.1971.23
Bounds on the Evaluation Time for Rational Polynomials
Mike Paterson
Larry J. Stockmeyer
140-143
conf/focs/FOCS12
1971
SWAT
db/conf/focs/focs71.html#PatersonS71
https://doi.org/10.1109/SWAT.1971.5
https://doi.ieeecomputersociety.org/10.1109/SWAT.1971.5
David C. Luckham
David Michael Ritchie Park
Mike Paterson
On Formalised Computer Programs.
220-249
1970
4
J. Comput. Syst. Sci.
3
db/journals/jcss/jcss4.html#LuckhamPP70
https://doi.org/10.1016/S0022-0000(70)80022-8
Tape-Bounds for Time-Bounded Turing Machines
Mike Paterson
73-75
conf/focs/FOCS11
1970
SWAT
db/conf/focs/focs70.html#Paterson70
https://doi.org/10.1109/SWAT.1970.25
https://doi.ieeecomputersociety.org/10.1109/SWAT.1970.25
Micah Adler
Richa Agarwala
Haris Aziz 0001
Yoram Bachrach
Vineet Bafna
M. Bauer
Amos Beimel
Petra Berenbrink
Francine Berman
Ronald V. Book
Brian H. Bowditch
D. Brand
Bo Chen 0002
Dmitry Chistikov 0001
Richard Cole 0001
Graham Cormode
Maxime Crochemore
Artur Czumaj
Vlado Dancík
Josep Díaz
David P. Dobkin
Martin E. Dyer
Herbert Edelsbrunner
Edith Elkind
Faith EllenFaith E. Fich
David Eppstein
David B. A. Epstein
Shimon Even
Martin Farach-ColtonMartin Farach
Michael J. Fischer
Robert J. Fowler
Aviezri S. Fraenkel
Tom Friedetzky
Anna Gál
Zvi Galil
Alan Gibbons
Leslie Ann Goldberg
Paul W. Goldberg
Olga Goulko
Albert G. Greenberg
Thomas Dueholm Hansen
David Harel
Ramesh Hariharan
Alain P. Hiltgen
Hiro Ito
Kazuo Iwama
Mark Jerrum
Marcin Jurdzinski
Sampath Kannan
Steven Kelk
Adrian Kent
Sanjeev Khanna
Peter Klein
Hirotaka Koizumi
George Kontogeorgiou
Oded Lachish
Richard E. Ladner
Grzegorz Lisowski
David C. Luckham
Nancy A. Lynch
Philip D. MacKenzie
Russell MartinRussell A. Martin
Akira Maruoka
William J. Masek
Akihiro Matsuura
William F. McColl
Albert R. Meyer
Peter Bro Miltersen
Clyde L. Monma
J. Ian Munro
S. Muthukrishnan 0001
Babu O. Narayanan
Harumichi Nishimura
Maurice Nivat
David M. R. ParkDavid Michael Ritchie Park
Yuval Peres
Pavel A. Pevzner
Nicholas Pippenger
Teresa M. Przytycka
Raymond H. PutraRudy Raymond
Somasundaram Ravindran
Alexander A. Razborov
Walter L. Ruzzo
Süleyman Cenk Sahinalp
Rahul Savani
Arnold Schönhage
Heiko Schröder 0001
Jamie Simpson
Lawrence Snyder
Aravind Srinivasan
Larry J. Stockmeyer
Torsten Suel
Kenya Sugihara
Subhash Suri
Elizabeth Sweedyk
Ondrej Sýkora
Steven L. Tanimoto
Jun Tarui
Shlomit Tassa
Mikkel Thorup
Jacobo Torán
Paolo Turrini
Leslie G. Valiant
Uzi Vishkin
Imrich Vrto
Ingo Wegener
Mark N. Wegman
Peter Winkler 0001
Shigeru Yamashita
F. Frances Yao
Guochuan Zhang
Uri Zwick