Mike Paterson Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2011
j67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Yoram Bachrach, Edith Elkind, Mike Paterson: False-Name Manipulations in Weighted Voting Games. J. Artif. Intell. Res. (JAIR) 40: 57-93 (2011)
2009
j66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hiro Ito, Mike Paterson, Kenya Sugihara: The Multi-Commodity Source Location Problems and the Price of Greed. J. Graph Algorithms Appl. 13(1): 55-73 (2009)
j65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Uri Zwick: Overhang. The American Mathematical Monthly 116(1): 19-44 (2009)
j64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick: Maximum Overhang. The American Mathematical Monthly 116(9): 763-787 (2009)
c62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Power Indices in Spanning Connectivity Games. AAIM 2009: 55-67
c61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Mike Paterson: False name manipulations in weighted voting games: splitting, merging and annexation. AAMAS (1) 2009: 409-416
c60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Wiretapping a Hidden Network. WINE 2009: 438-446
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Mike Paterson: False name manipulations in weighted voting games: splitting, merging and annexation. CoRR abs/0905.3348 (2009)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Spanning connectivity games. CoRR abs/0906.3643 (2009)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani: Wiretapping a hidden network. CoRR abs/0909.5293 (2009)
2008
j63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marcin Jurdzinski, Mike Paterson, Uri Zwick: A Deterministic Subexponential Algorithm for Solving Parity Games. SIAM J. Comput. 38(4): 1519-1532 (2008)
c59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita: Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282
c58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick: Maximum overhang. SODA 2008: 756-765
c57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hiro Ito, Mike Paterson, Kenya Sugihara: Multi-commodity Source Location Problems and Price of Greed. WALCOM 2008: 169-179
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Haris Aziz, Mike Paterson: Computing voting power in easy weighted voting games. CoRR abs/0811.2497 (2008)
2007
j62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs. J. ACM 54(6) (2007)
e4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Bo Chen, Mike Paterson, Guochuan Zhang (Eds.): Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4614, Springer 2007, isbn 978-3-540-74449-8
2006
c56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On Counting Homomorphisms to Directed Acyclic Graphs. ICALP (1) 2006: 38-49
c55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marcin Jurdzinski, Mike Paterson, Uri Zwick: A deterministic subexponential algorithm for solving parity games. SODA 2006: 117-123
c54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Uri Zwick: Overhang. SODA 2006: 231-240
2005
j61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Strong Spatial Mixing with Fewer Colors for Lattice Graphs. SIAM J. Comput. 35(2): 486-517 (2005)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson: On counting homomorphisms to directed acyclic graphs. Electronic Colloquium on Computational Complexity (ECCC)(121) (2005)
2004
j60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: Random sampling of 3-colorings in Z2. Random Struct. Algorithms 24(3): 279-302 (2004)
j59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson: A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. 33(2): 313-331 (2004)
j58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM J. Comput. 33(2): 416-432 (2004)
c53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Russell A. Martin, Mike Paterson: trong Spatial Mixing for Lattice Graphs with Fewer Colours. FOCS 2004: 562-571
c52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Analysis of Scheduling Algorithms for Proportionate Fairness. LATIN 2004: 1
2003
j57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Mark Jerrum, Mike Paterson: The computational complexity of two-state spin systems. Random Struct. Algorithms 23(2): 133-154 (2003)
j56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kazuo Iwama, Akihiro Matsuura, Mike Paterson: A family of NFAs which need 2n- deterministic states. Theor. Comput. Sci. 1-3(301): 451-462 (2003)
c51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson: A proportionate fair scheduling rule with good worst-case performance. SPAA 2003: 101-108
2002
j55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Permutation Communication in All-Optical Rings. Parallel Processing Letters 12(1): 23-29 (2002)
c50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The complexity of choosing an H-colouring (nearly) uniformly at random. STOC 2002: 53-62
2001
j54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk: The Complexity of Gene Placement. J. Algorithms 41(2): 225-243 (2001)
j53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-Shop Scheduling. SIAM J. Discrete Math. 14(1): 67-92 (2001)
2000
j52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan: Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000)
j51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Somasundaram Ravindran, Alan Gibbons, Mike Paterson: Dense edge-disjoint embedding of complete binary trees in interconnection networks. Theor. Comput. Sci. 249(2): 325-342 (2000)
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson: A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716
c48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson: Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kazuo Iwama, Akihiro Matsuura, Mike Paterson: A Family of NFA's Which Need 2n -alpha Deterministic States. MFCS 2000: 436-445
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin: Communication complexity of document exchange. SODA 2000: 197-206
e3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson (Ed.): Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1879, Springer 2000, isbn 3-540-41004-X
1999
j50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Mike Paterson: Optimal Layout of Edge-weighted Forests. Discrete Applied Mathematics 90(1-3): 135-159 (1999)
j49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: The chip in your wallet - The technology of security in smartcard chip manufacture. Inf. Sec. Techn. Report 4(2): 13-18 (1999)
j48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup: On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SIAM J. Comput. 28(3): 1073-1085 (1999)
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk: The Complexity of Gene Placement. SODA 1999: 386-395
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp, Torsten Suel: Compact Grid Layouts of Multi-Level Networks. STOC 1999: 455-463
e2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Maxime Crochemore, Mike Paterson (Eds.): Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings. Lecture Notes in Computer Science 1645, Springer 1999, isbn 3-540-66278-2
1998
j47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Akira Maruoka, Mike Paterson, Hirotaka Koizumi: Consistency of Natural Relations on Sets. Combinatorics, Probability & Computing 7(3): 281-293 (1998)
c43no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: On permutation communications in all-optical rings. SIROCCO 1998: 1-9
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sanjeev Khanna, S. Muthukrishnan, Mike Paterson: On Approximating Rectangle Tiling and Packing. SODA 1998: 384-393
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp: Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998: 172-181
1997
j46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Amos Beimel, Anna Gál, Mike Paterson: Lower Bounds for Monotone Span Programs. Computational Complexity 6(1): 29-45 (1997)
j45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David Eppstein, Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. Discrete & Computational Geometry 17(3): 263-282 (1997)
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson: On Weak Circular Squares in Binary Words. CPM 1997: 76-82
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk: Better Approximation Guarantees for Job-shop Scheduling. SODA 1997: 599-608
1996
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Teresa M. Przytycka: On the Complexity of String Folding. Discrete Applied Mathematics 71(1-3): 217-230 (1996)
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Peter Bro Miltersen, Mike Paterson, Jun Tarui: The Asymptotic Complexity of Merging Networks. J. ACM 43(1): 147-165 (1996)
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uri Zwick, Mike Paterson: The Complexity of Mean Payoff Games on Graphs. Theor. Comput. Sci. 158(1&2): 343-359 (1996)
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Teresa M. Przytycka: On the Complexity of String Folding. ICALP 1996: 658-669
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup: On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SODA 1996: 365-372
c36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Progress in Selection. SWAT 1996: 368-379
1995
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alain P. Hiltgen, Mike Paterson: PI_k Mass Production and an Optimal Circuit for the Neciporuk Slice. Computational Complexity 5(2): 132-154 (1995)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vlado Dancík, Mike Paterson: Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. Random Struct. Algorithms 6(4): 449-458 (1995)
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick: Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 24(1): 30-45 (1995)
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uri Zwick, Mike Paterson: The Complexity of Mean Payoff Games. COCOON 1995: 1-10
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Aravind Srinivasan: Contention Resolution with Bounded Delay. FOCS 1995: 104-113
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Amos Beimel, Anna Gál, Mike Paterson: Lower Bounds for Monotone Span Programs. FOCS 1995: 674-681
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Shlomit Tassa, Uri Zwick: Looking for MUM and DAD: Text-Text Comparisons Do Help. FSTTCS 1995: 1-10
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Amos Beimel, Anna Gál, Mike Paterson: Lower Bounds for Monotone Span Programs. Electronic Colloquium on Computational Complexity (ECCC) 2(1) (1995)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uri Zwick, Mike Paterson: The Complexity of Mean Payoff Games on Graphs. Electronic Colloquium on Computational Complexity (ECCC) 2(40) (1995)
1994
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Mike Paterson: Fishspear: A Priority Queue Algorithm. J. ACM 41(1): 3-30 (1994)
j37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: David Michael Ritchie Park (1935-1990) in Memoriam. Theor. Comput. Sci. 133(1): 187-200 (1994)
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Vlado Dancík: Longest Common Subsequences. MFCS 1994: 127-142
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vlado Dancík, Mike Paterson: Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. STACS 1994: 669-678
1993
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Uri Zwick: Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. Computational Complexity 3: 262-291 (1993)
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: A Short Proof of the Dilation of a Toroidal Mesh in a Path. Inf. Process. Lett. 48(4): 197-199 (1993)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Uri Zwick: Shrinkage of de Morgan Formulae under Restriction. Random Struct. Algorithms 4(2): 135-150 (1993)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Uri Zwick, Mike Paterson: The Memory Game. Theor. Comput. Sci. 110(1): 169-196 (1993)
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Evolution of an Algorithm. ESA 1993: 306-308
c28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick: Which Patterns are Hard to Find? ISTCS 1993: 59-68
1992
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, F. Frances Yao: Optimal Binary Space Partitions for Orthogonal Objects. J. Algorithms 13(1): 99-113 (1992)
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Peter Bro Miltersen, Mike Paterson, Jun Tarui: The Asymptotic Complexity of Merging Networks. FOCS 1992: 236-246
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, F. Frances Yao: On Nearest-Neighbor Graphs. ICALP 1992: 416-426
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Boolean Circuit Complexity. ISAAC 1992: 187
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alan Gibbons, Mike Paterson: Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. SPAA 1992: 257-263
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Uri Zwick: Shallow Multiplication Circuits and Wise Financial Investments. STOC 1992: 429-437
1991
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
William F. McColl, Mike Paterson, B. H. Bowditch: Planar Acyclic Computation. Inf. Comput. 90(2): 178-193 (1991)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Alexander A. Razborov: The Set of Minimal Braids is co-NP-Complete. J. Algorithms 12(3): 393-408 (1991)
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Uri Zwick: Shrinkage of de~Morgan formulae under restriction. FOCS 1991: 324-333
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán: The MINSUMCUT Problem. WADS 1991: 65-89
1990
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Improved Sorting Networks with O(log N) Depth. Algorithmica 5(1): 65-92 (1990)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Algorithmica 5(3): 407-419 (1990)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, F. Frances Yao: Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. Discrete & Computational Geometry 5: 485-503 (1990)
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Nicholas Pippenger, Uri Zwick: Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions. FOCS 1990: 642-650
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, F. Frances Yao: Optimal Binary Space Partitions for Orthogonal Objects. SODA 1990: 100-106
e1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson (Ed.): Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, July 16-20, 1990, Proceedings. Lecture Notes in Computer Science 443, Springer 1990, isbn 3-540-52826-1
1989
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson: Partitioning Space for Range Queries. SIAM J. Comput. 18(2): 371-384 (1989)
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, F. Frances Yao: Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. Symposium on Computational Geometry 1989: 23-32
1988
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Universal Chains and Wiring Layouts. SIAM J. Discrete Math. 1(1): 80-85 (1988)
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao: Computing Euclidean Maximum Spanning Trees. Symposium on Computational Geometry 1988: 241-251
1987
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
William F. McColl, Mike Paterson: The Planar Realization of Boolean Functions. Inf. Process. Lett. 24(3): 165-170 (1987)
1986
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Ingo Wegener: Nearly Optimal Hierarchies for Network and Formula Size. Acta Inf. 23(2): 217-221 (1986)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, F. Frances Yao: Point Retrieval for Polygons. J. Algorithms 7(3): 441-447 (1986)
1985
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382 (1985)
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Mike Paterson: Dynamic Monotone Priorities on Planar Sets (Extended Abstract). FOCS 1985: 289-292
1984
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David Harel, Mike Paterson: Undecidability of PDL with L={a^(2i)|i>=0}. J. Comput. Syst. Sci. 29(3): 359-365 (1984)
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Mike Paterson: Fishspear: A Priority Queue Algorithm (Extended Abstract). FOCS 1984: 375-386
1983
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Mike Paterson: Storage Requirements for Fair Scheduling. Inf. Process. Lett. 17(5): 249-250 (1983)
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. PODS 1983: 1-7
1982
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Albert G. Greenberg, Richard E. Ladner, Mike Paterson, Zvi Galil: Efficient Parallel Algorithms for Linear Recurrence Computation. Inf. Process. Lett. 15(1): 31-35 (1982)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Albert R. Meyer, Mike Paterson: Omega(n log n) Lower Bounds on Length of Boolean Formulas. SIAM J. Comput. 11(3): 416-427 (1982)
1981
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Robert J. Fowler, Mike Paterson, Steven L. Tanimoto: Optimal Packing and Covering in the Plane are NP-Complete. Inf. Process. Lett. 12(3): 133-137 (1981)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Francine Berman, Mike Paterson: Propositional Dynamic Logic is Weaker without Tests. Theor. Comput. Sci. 16: 321-328 (1981)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Walter L. Ruzzo, Lawrence Snyder: Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract). STOC 1981: 293-299
1980
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
William J. Masek, Mike Paterson: A Faster Algorithm Computing String Edit Distances. J. Comput. Syst. Sci. 20(1): 18-31 (1980)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Peter Klein, Mike Paterson: Asymtotically Optimal Circuit for a Storage Access Function. IEEE Trans. Computers 29(8): 737-738 (1980)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
J. Ian Munro, Mike Paterson: Selection and Sorting with Limited Storage. Theor. Comput. Sci. 12: 315-323 (1980)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Mike Paterson: Optimal Tree Layout (Preliminary Version). STOC 1980: 177-189
1979
c11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: The linear postman: a message-forwarding algorithm using sequential storage. Algorithms in Modern Mathematics and Computer Science 1979: 463
1978
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Mark N. Wegman: Linear Unification. J. Comput. Syst. Sci. 16(2): 158-167 (1978)
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
J. Ian Munro, Mike Paterson: Selection and Sorting with Limited Storage. FOCS 1978: 253-258
1977
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
William F. McColl, Mike Paterson: The Depth of All Boolean Functions. SIAM J. Comput. 6(2): 373-380 (1977)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: New bounds on formula size. Theoretical Computer Science 1977: 17-26
1976
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Arnold Schönhage, Mike Paterson, Nicholas Pippenger: Finding the Median. J. Comput. Syst. Sci. 13(2): 184-199 (1976)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Leslie G. Valiant: Circuit Size is Nonlinear in Depth. Theor. Comput. Sci. 2(3): 397-400 (1976)
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Mark N. Wegman: Linear Unification. STOC 1976: 181-186
1975
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie G. Valiant, Mike Paterson: Deterministic One-Counter Automata. J. Comput. Syst. Sci. 10(3): 340-350 (1975)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Complexity of Monotone Networks for Boolean Matrix Product. Theor. Comput. Sci. 1(1): 13-20 (1975)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael J. Fischer, Albert R. Meyer, Mike Paterson: Lower Bounds on the Size of Boolean Formulas: Preliminary Report. STOC 1975: 37-44
1974
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ronald V. Book, Maurice Nivat, Mike Paterson: Reversal-Bounded Acceptors and Intersections of Linear Languages. SIAM J. Comput. 3(4): 283-295 (1974)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ronald V. Book, Maurice Nivat, Mike Paterson: Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract). STOC 1974: 290-296
1973
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
J. Ian Munro, Mike Paterson: Optimal Algorithms for Parallel Polynomial Evaluation. J. Comput. Syst. Sci. 7(2): 189-198 (1973)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Larry J. Stockmeyer: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. SIAM J. Comput. 2(1): 60-66 (1973)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leslie G. Valiant, Mike Paterson: Deterministic one-counter automata. Automatentheorie und Formale Sprachen 1973: 104-115
1972
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Tape Bounds for Time-Bounded Turing Machines. J. Comput. Syst. Sci. 6(2): 116-124 (1972)
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Decision problems in computational models. International Sympoisum on Theoretical Programming 1972: 85-85
1971
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
J. Ian Munro, Mike Paterson: Optimal Algorithms for Parallel Polynomial Evaluation. SWAT (FOCS) 1971: 132-139
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson, Larry J. Stockmeyer: Bounds on the Evaluation Time for Rational Polynomials. SWAT (FOCS) 1971: 140-143
1970
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
David C. Luckham, David Michael Ritchie Park, Mike Paterson: On Formalised Computer Programs. J. Comput. Syst. Sci. 4(3): 220-249 (1970)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mike Paterson: Tape-Bounds for Time-Bounded Turing Machines. SWAT (FOCS) 1970: 73-75

Coauthor Index

1Micah Adler
[c51] [c48]
2Richa Agarwala
[j48] [c37]
3Haris Aziz
[j67] [c62] [c61] [c60] [i7] [i6] [i5] [i4]
4Yoram Bachrach
[j67]
5Vineet Bafna
[j48] [c37]
6Amos Beimel
[j46] [c33] [i2]
7Petra Berenbrink
[c51]
8Francine Berman (Fran Berman)
[j15]
9Ronald V. Book
[j5] [c6]
10B. H. Bowditch
[j31]
11Bo Chen
[e4]
12Richard Cole
[j39] [c28]
13Graham Cormode
[c46]
14Maxime Crochemore
[e2]
15Vlado Dancík
[j40] [c31] [c30]
16David P. Dobkin
[j26]
17Martin E. Dyer
[j62] [c56] [i3]
18Josep Díaz
[c21]
19Herbert Edelsbrunner
[j26]
20Edith Elkind
[j67]
21Faith Ellen (Faith Ellen Fich, Faith E. Fich)
[c48]
22David Eppstein
[j45]
23Shimon Even
[c41]
24Martin Farach-Colton (Martin Farach)
[j48] [c37]
25Michael J. Fischer
[j50] [j38] [j21] [c16] [c15] [j19] [c14] [j17] [c12] [c7]
26Robert J. Fowler (Rob Fowler)
[j16]
27Aviezri S. Fraenkel
[c40]
28Tom Friedetzky
[c51]
29Zvi Galil
[j18]
30Alan Gibbons
[j51] [c24] [c21]
31Leslie Ann Goldberg (Leslie A. Henderson)
[j62] [c56] [j61] [i3] [j60] [j59] [j58] [c53] [j57] [c51] [c50] [j54] [j53] [j52] [c49] [c48] [c45] [c39]
32Paul W. Goldberg
[c51] [j54] [c45]
33Albert G. Greenberg
[j18]
34Anna Gál
[j46] [c33] [i2]
35David Harel
[j20]
36Ramesh Hariharan
[j39] [c28]
37Alain P. Hiltgen
[j41]
38Hiro Ito
[j66] [c57]
39Kazuo Iwama
[c59] [j56] [c47]
40Mark Jerrum
[j59] [j57] [c49]
41Marcin Jurdzinski
[j63] [c55]
42Sampath Kannan
[j59] [c49]
43Steven Kelk
[j58] [c50]
44Sanjeev Khanna
[c42]
45Peter Klein
[j13]
46Hirotaka Koizumi
[j47]
47Oded Lachish
[c62] [c60] [i6] [i5]
48Richard E. Ladner
[j18]
49David C. Luckham
[j1]
50Nancy A. Lynch
[j21] [c14]
51Philip D. MacKenzie
[j52]
52Russell Martin (Russell A. Martin)
[j61] [j60] [c53]
53Akira Maruoka
[j47]
54William J. Masek
[j14]
55Akihiro Matsuura
[j56] [c47]
56William F. McColl
[j31] [j24] [j10]
57Albert R. Meyer
[j17] [c7]
58Peter Bro Miltersen
[j43] [c27]
59Clyde L. Monma
[j28] [c17]
60J. Ian Munro
[j12] [c10] [j4] [c3]
61S. Muthukrishnan (S. Muthu Muthukrishnan)
[c44] [c42] [c41]
62Babu O. Narayanan
[c37]
63Harumichi Nishimura
[c59]
64Maurice Nivat
[j5] [c6]
65David Michael Ritchie Park
[j1]
66Yuval Peres
[j64] [c58]
67Pavel A. Pevzner
[j54] [c45]
68Nicholas Pippenger
[c20] [j9]
69Teresa M. Przytycka
[j44] [c38]
70Raymond H. Putra (Rudy Raymond Harry Putra, Rudy Raymond)
[c59]
71Somasundaram Ravindran
[j51]
72Alexander A. Razborov
[j30]
73Walter L. Ruzzo
[c13]
74Süleyman Cenk Sahinalp
[j54] [c46] [c45] [c44] [c41]
75Rahul Savani
[c62] [c60] [i6] [i5]
76Heiko Schröder
[j55] [c43] [j35]
77Arnold Schönhage
[j9]
78Jamie Simpson
[c40]
79Lawrence Snyder (Larry Snyder)
[c13]
80Aravind Srinivasan
[j53] [j52] [c39] [c34]
81Larry J. Stockmeyer
[j3] [c2]
82Torsten Suel
[c44]
83Kenya Sugihara
[j66] [c57]
84Subhash Suri
[j28] [c17]
85Elizabeth Sweedyk
[j54] [j53] [c45] [c39]
86Ondrej Sýkora
[j55] [c43] [j35]
87Steven L. Tanimoto
[j16]
88Jun Tarui
[j43] [c27]
89Shlomit Tassa
[c32]
90Mikkel Thorup
[j64] [c58] [j48] [c37]
91Jacobo Torán
[c21]
92Leslie G. Valiant
[j8] [j7] [c5]
93Uzi Vishkin
[c46]
94Imrich Vrto (Imrich Vrt'o)
[j55] [c43] [j35]
95Ingo Wegener
[j23]
96Mark N. Wegman
[j11] [c8]
97Peter Winkler (Peter M. Winkler)
[j64] [c58]
98Shigeru Yamashita
[c59]
99F. Frances Yao (Frances F. Yao, Foong Frances Yao)
[j45] [j32] [c26] [j28] [j27] [c19] [j26] [c18] [c17] [j22]
100Guochuan Zhang
[e4]
101Uri Zwick
[j65] [j64] [j63] [c58] [c55] [c54] [j42] [j39] [c35] [c32] [i1] [j36] [j34] [j33] [c28] [c23] [c22] [c20]

Colors in the list of coauthors

Last update Thu May 23 14:10:24 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page