Search the dblp DataBase
Mike Paterson :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Michael J. Fischer , Nancy A. Lynch , Mike Paterson Impossibility of Distributed Consensus with One Faulty Process [Citation Graph (6, 0)][DBLP ] J. ACM, 1985, v:32, n:2, pp:374-382 [Journal ] J. Ian Munro , Mike Paterson Selection and Sorting with Limited Storage. [Citation Graph (3, 0)][DBLP ] Theor. Comput. Sci., 1980, v:12, n:, pp:315-323 [Journal ] Michael J. Fischer , Nancy A. Lynch , Mike Paterson Impossibility of Distributed Consensus with One Faulty Process. [Citation Graph (2, 8)][DBLP ] PODS, 1983, pp:1-7 [Conf ] Sanjeev Khanna , S. Muthukrishnan , Mike Paterson On Approximating Rectangle Tiling and Packing. [Citation Graph (2, 0)][DBLP ] SODA, 1998, pp:384-393 [Conf ] Robert J. Fowler , Mike Paterson , Steven L. Tanimoto Optimal Packing and Covering in the Plane are NP-Complete. [Citation Graph (2, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:3, pp:133-137 [Journal ] William J. Masek , Mike Paterson A Faster Algorithm Computing String Edit Distances. [Citation Graph (2, 0)][DBLP ] J. Comput. Syst. Sci., 1980, v:20, n:1, pp:18-31 [Journal ] Mike Paterson , Mark N. Wegman Linear Unification. [Citation Graph (2, 0)][DBLP ] J. Comput. Syst. Sci., 1978, v:16, n:2, pp:158-167 [Journal ] Leslie G. Valiant , Mike Paterson Deterministic One-Counter Automata. [Citation Graph (2, 0)][DBLP ] J. Comput. Syst. Sci., 1975, v:10, n:3, pp:340-350 [Journal ] Mike Paterson , Mark N. Wegman Linear Unification [Citation Graph (1, 0)][DBLP ] STOC, 1976, pp:181-186 [Conf ] Mike Paterson Progress in Selection. [Citation Graph (1, 0)][DBLP ] SWAT, 1996, pp:368-379 [Conf ] David C. Luckham , David Michael Ritchie Park , Mike Paterson On Formalised Computer Programs. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:3, pp:220-249 [Journal ] Leslie G. Valiant , Mike Paterson Deterministic one-counter automata. [Citation Graph (0, 0)][DBLP ] Automatentheorie und Formale Sprachen, 1973, pp:104-115 [Conf ] Uri Zwick , Mike Paterson The Complexity of Mean Payoff Games. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:1-10 [Conf ] Clyde L. Monma , Mike Paterson , Subhash Suri , F. Frances Yao Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1988, pp:241-251 [Conf ] Mike Paterson , F. Frances Yao Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1989, pp:23-32 [Conf ] Aviezri S. Fraenkel , Jamie Simpson , Mike Paterson On Weak Circular Squares in Binary Words. [Citation Graph (0, 0)][DBLP ] CPM, 1997, pp:76-82 [Conf ] Mike Paterson Decision problems in computational models. [Citation Graph (0, 0)][DBLP ] International Sympoisum on Theoretical Programming, 1972, pp:85-85 [Conf ] Mike Paterson The linear postman: a message-forwarding algorithm using sequential storage. [Citation Graph (0, 0)][DBLP ] Algorithms in Modern Mathematics and Computer Science, 1979, pp:463- [Conf ] Mike Paterson Evolution of an Algorithm. [Citation Graph (0, 0)][DBLP ] ESA, 1993, pp:306-308 [Conf ] Amos Beimel , Anna Gál , Mike Paterson Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP ] FOCS, 1995, pp:674-681 [Conf ] Michael J. Fischer , Mike Paterson Fishspear: A Priority Queue Algorithm (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:375-386 [Conf ] Michael J. Fischer , Mike Paterson Dynamic Monotone Priorities on Planar Sets (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1985, pp:289-292 [Conf ] Leslie Ann Goldberg , Russell A. Martin , Mike Paterson trong Spatial Mixing for Lattice Graphs with Fewer Colours. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:562-571 [Conf ] Peter Bro Miltersen , Mike Paterson , Jun Tarui The Asymptotic Complexity of Merging Networks [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:236-246 [Conf ] J. Ian Munro , Mike Paterson Optimal Algorithms for Parallel Polynomial Evaluation [Citation Graph (0, 0)][DBLP ] FOCS, 1971, pp:132-139 [Conf ] J. Ian Munro , Mike Paterson Selection and Sorting with Limited Storage [Citation Graph (0, 0)][DBLP ] FOCS, 1978, pp:253-258 [Conf ] Mike Paterson Tape-Bounds for Time-Bounded Turing Machines [Citation Graph (0, 0)][DBLP ] FOCS, 1970, pp:73-75 [Conf ] Mike Paterson , Nicholas Pippenger , Uri Zwick Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP ] FOCS, 1990, pp:642-650 [Conf ] Mike Paterson , Larry J. Stockmeyer Bounds on the Evaluation Time for Rational Polynomials [Citation Graph (0, 0)][DBLP ] FOCS, 1971, pp:140-143 [Conf ] Mike Paterson , Aravind Srinivasan Contention Resolution with Bounded Delay. [Citation Graph (0, 0)][DBLP ] FOCS, 1995, pp:104-113 [Conf ] Mike Paterson , Uri Zwick Shrinkage of de~Morgan formulae under restriction [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:324-333 [Conf ] Mike Paterson , Shlomit Tassa , Uri Zwick Looking for MUM and DAD: Text-Text Comparisons Do Help. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1995, pp:1-10 [Conf ] Micah Adler , Faith E. Fich , Leslie Ann Goldberg , Mike Paterson Tight Size Bounds for Packet Headers in Narrow Meshes. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:756-767 [Conf ] Martin E. Dyer , Leslie Ann Goldberg , Mike Paterson On Counting Homomorphisms to Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP ] ICALP (1), 2006, pp:38-49 [Conf ] Leslie Ann Goldberg , Mark Jerrum , Sampath Kannan , Mike Paterson A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:705-716 [Conf ] Mike Paterson , F. Frances Yao On Nearest-Neighbor Graphs. [Citation Graph (0, 0)][DBLP ] ICALP, 1992, pp:416-426 [Conf ] Mike Paterson , Teresa M. Przytycka On the Complexity of String Folding. [Citation Graph (0, 0)][DBLP ] ICALP, 1996, pp:658-669 [Conf ] Mike Paterson Boolean Circuit Complexity. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:187- [Conf ] Richard Cole , Ramesh Hariharan , Mike Paterson , Uri Zwick Which Patterns are Hard to Find? [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:59-68 [Conf ] Mike Paterson Analysis of Scheduling Algorithms for Proportionate Fairness. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:1- [Conf ] Kazuo Iwama , Akihiro Matsuura , Mike Paterson A Family of NFA's Which Need 2n -alpha Deterministic States. [Citation Graph (0, 0)][DBLP ] MFCS, 2000, pp:436-445 [Conf ] Mike Paterson , Vlado Dancík Longest Common Subsequences. [Citation Graph (0, 0)][DBLP ] MFCS, 1994, pp:127-142 [Conf ] Mike Paterson , Heiko Schröder , Ondrej Sýkora , Imrich Vrto On permutation communications in all-optical rings. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1998, pp:1-9 [Conf ] Richa Agarwala , Vineet Bafna , Martin Farach , Babu O. Narayanan , Mike Paterson , Mikkel Thorup On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:365-372 [Conf ] Graham Cormode , Mike Paterson , Süleyman Cenk Sahinalp , Uzi Vishkin Communication complexity of document exchange. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:197-206 [Conf ] Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson , Pavel A. Pevzner , Süleyman Cenk Sahinalp , Elizabeth Sweedyk The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:386-395 [Conf ] Leslie Ann Goldberg , Mike Paterson , Aravind Srinivasan , Elizabeth Sweedyk Better Approximation Guarantees for Job-shop Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:599-608 [Conf ] Marcin Jurdzinski , Mike Paterson , Uri Zwick A deterministic subexponential algorithm for solving parity games. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:117-123 [Conf ] Mike Paterson , F. Frances Yao Optimal Binary Space Partitions for Orthogonal Objects. [Citation Graph (0, 0)][DBLP ] SODA, 1990, pp:100-106 [Conf ] Mike Paterson , Uri Zwick Overhang. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:231-240 [Conf ] Micah Adler , Petra Berenbrink , Tom Friedetzky , Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson A proportionate fair scheduling rule with good worst-case performance. [Citation Graph (0, 0)][DBLP ] SPAA, 2003, pp:101-108 [Conf ] Shimon Even , S. Muthukrishnan , Mike Paterson , Süleyman Cenk Sahinalp Layout of the Batcher Bitonic Sorter (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SPAA, 1998, pp:172-181 [Conf ] Alan Gibbons , Mike Paterson Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. [Citation Graph (0, 0)][DBLP ] SPAA, 1992, pp:257-263 [Conf ] Vlado Dancík , Mike Paterson Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. [Citation Graph (0, 0)][DBLP ] STACS, 1994, pp:669-678 [Conf ] Ronald V. Book , Maurice Nivat , Mike Paterson Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1974, pp:290-296 [Conf ] Michael J. Fischer , Albert R. Meyer , Mike Paterson Lower Bounds on the Size of Boolean Formulas: Preliminary Report [Citation Graph (0, 0)][DBLP ] STOC, 1975, pp:37-44 [Conf ] Michael J. Fischer , Mike Paterson Optimal Tree Layout (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:177-189 [Conf ] Leslie Ann Goldberg , Steven Kelk , Mike Paterson The complexity of choosing an H-colouring (nearly) uniformly at random. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:53-62 [Conf ] S. Muthukrishnan , Mike Paterson , Süleyman Cenk Sahinalp , Torsten Suel Compact Grid Layouts of Multi-Level Networks. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:455-463 [Conf ] Mike Paterson , Walter L. Ruzzo , Lawrence Snyder Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1981, pp:293-299 [Conf ] Mike Paterson , Uri Zwick Shallow Multiplication Circuits and Wise Financial Investments [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:429-437 [Conf ] Mike Paterson New bounds on formula size. [Citation Graph (0, 0)][DBLP ] Theoretical Computer Science, 1977, pp:17-26 [Conf ] Josep Díaz , Alan Gibbons , Mike Paterson , Jacobo Torán The MINSUMCUT Problem. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:65-89 [Conf ] Mike Paterson , Ingo Wegener Nearly Optimal Hierarchies for Network and Formula Size. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1986, v:23, n:2, pp:217-221 [Journal ] Clyde L. Monma , Mike Paterson , Subhash Suri , F. Frances Yao Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1990, v:5, n:3, pp:407-419 [Journal ] Mike Paterson Improved Sorting Networks with O(log N) Depth. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1990, v:5, n:1, pp:65-92 [Journal ] Amos Beimel , Anna Gál , Mike Paterson Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1997, v:6, n:1, pp:29-45 [Journal ] Alain P. Hiltgen , Mike Paterson PI_k Mass Production and an Optimal Circuit for the Neciporuk Slice. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1995, v:5, n:2, pp:132-154 [Journal ] Mike Paterson , Uri Zwick Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1993, v:3, n:, pp:262-291 [Journal ] Akira Maruoka , Mike Paterson , Hirotaka Koizumi Consistency of Natural Relations on Sets. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:281-293 [Journal ] Michael J. Fischer , Mike Paterson Optimal Layout of Edge-weighted Forests. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:135-159 [Journal ] Mike Paterson , Teresa M. Przytycka On the Complexity of String Folding. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:217-230 [Journal ] David Eppstein , Mike Paterson , F. Frances Yao On Nearest-Neighbor Graphs. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1997, v:17, n:3, pp:263-282 [Journal ] Mike Paterson , F. Frances Yao Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1990, v:5, n:, pp:485-503 [Journal ] Martin E. Dyer , Leslie Ann Goldberg , Mike Paterson On counting homomorphisms to directed acyclic graphs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:121, pp:- [Journal ] Amos Beimel , Anna Gál , Mike Paterson Lower Bounds for Monotone Span Programs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:1, pp:- [Journal ] Uri Zwick , Mike Paterson The Complexity of Mean Payoff Games on Graphs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:40, pp:- [Journal ] William F. McColl , Mike Paterson , B. H. Bowditch Planar Acyclic Computation [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1991, v:90, n:2, pp:178-193 [Journal ] Michael J. Fischer , Mike Paterson Storage Requirements for Fair Scheduling. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1983, v:17, n:5, pp:249-250 [Journal ] Albert G. Greenberg , Richard E. Ladner , Mike Paterson , Zvi Galil Efficient Parallel Algorithms for Linear Recurrence Computation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:31-35 [Journal ] William F. McColl , Mike Paterson The Planar Realization of Boolean Functions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:24, n:3, pp:165-170 [Journal ] Mike Paterson , Heiko Schröder , Ondrej Sýkora , Imrich Vrto A Short Proof of the Dilation of a Toroidal Mesh in a Path. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:48, n:4, pp:197-199 [Journal ] Michael J. Fischer , Mike Paterson Fishspear: A Priority Queue Algorithm. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:1, pp:3-30 [Journal ] Leslie Ann Goldberg , Philip D. MacKenzie , Mike Paterson , Aravind Srinivasan Contention resolution with constant expected delay. [Citation Graph (0, 0)][DBLP ] J. ACM, 2000, v:47, n:6, pp:1048-1096 [Journal ] Peter Bro Miltersen , Mike Paterson , Jun Tarui The Asymptotic Complexity of Merging Networks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1996, v:43, n:1, pp:147-165 [Journal ] Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson , Pavel A. Pevzner , Süleyman Cenk Sahinalp , Elizabeth Sweedyk The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:41, n:2, pp:225-243 [Journal ] Mike Paterson , Alexander A. Razborov The Set of Minimal Braids is co-NP-Complete. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:3, pp:393-408 [Journal ] Mike Paterson , F. Frances Yao Point Retrieval for Polygons. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1986, v:7, n:3, pp:441-447 [Journal ] Mike Paterson , F. Frances Yao Optimal Binary Space Partitions for Orthogonal Objects. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1992, v:13, n:1, pp:99-113 [Journal ] David Harel , Mike Paterson Undecidability of PDL with L={a^(2i)|i>=0}. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1984, v:29, n:3, pp:359-365 [Journal ] J. Ian Munro , Mike Paterson Optimal Algorithms for Parallel Polynomial Evaluation. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1973, v:7, n:2, pp:189-198 [Journal ] Mike Paterson Tape Bounds for Time-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1972, v:6, n:2, pp:116-124 [Journal ] Arnold Schönhage , Mike Paterson , Nicholas Pippenger Finding the Median. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1976, v:13, n:2, pp:184-199 [Journal ] Mike Paterson , Heiko Schröder , Ondrej Sýkora , Imrich Vrto Permutation Communication in All-Optical Rings. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2002, v:12, n:1, pp:23-29 [Journal ] Vlado Dancík , Mike Paterson Upper Bounds for the Expected Length of a Longest Common Subsequence of Two Binary Sequences. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:6, n:4, pp:449-458 [Journal ] Leslie Ann Goldberg , Mark Jerrum , Mike Paterson The computational complexity of two-state spin systems. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2003, v:23, n:2, pp:133-154 [Journal ] Leslie Ann Goldberg , Russell A. Martin , Mike Paterson Random sampling of 3-colorings in Z2 . [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:3, pp:279-302 [Journal ] Mike Paterson , Uri Zwick Shrinkage of de Morgan Formulae under Restriction. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1993, v:4, n:2, pp:135-150 [Journal ] Richa Agarwala , Vineet Bafna , Martin Farach , Mike Paterson , Mikkel Thorup On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:3, pp:1073-1085 [Journal ] Ronald V. Book , Maurice Nivat , Mike Paterson Reversal-Bounded Acceptors and Intersections of Linear Languages. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1974, v:3, n:4, pp:283-295 [Journal ] Richard Cole , Ramesh Hariharan , Mike Paterson , Uri Zwick Tighter Lower Bounds on the Exact Complexity of String Matching. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:1, pp:30-45 [Journal ] Michael J. Fischer , Albert R. Meyer , Mike Paterson Omega(n log n) Lower Bounds on Length of Boolean Formulas. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:3, pp:416-427 [Journal ] Leslie Ann Goldberg , Mark Jerrum , Sampath Kannan , Mike Paterson A bound on the capacity of backoff and acknowledgment-based protocols. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:2, pp:313-331 [Journal ] Leslie Ann Goldberg , Steven Kelk , Mike Paterson The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:2, pp:416-432 [Journal ] Leslie Ann Goldberg , Russell A. Martin , Mike Paterson Strong Spatial Mixing with Fewer Colors for Lattice Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:2, pp:486-517 [Journal ] William F. McColl , Mike Paterson The Depth of All Boolean Functions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1977, v:6, n:2, pp:373-380 [Journal ] Mike Paterson , Larry J. Stockmeyer On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1973, v:2, n:1, pp:60-66 [Journal ] F. Frances Yao , David P. Dobkin , Herbert Edelsbrunner , Mike Paterson Partitioning Space for Range Queries. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:2, pp:371-384 [Journal ] Leslie Ann Goldberg , Mike Paterson , Aravind Srinivasan , Elizabeth Sweedyk Better Approximation Guarantees for Job-Shop Scheduling. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:1, pp:67-92 [Journal ] Mike Paterson Universal Chains and Wiring Layouts. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:1, pp:80-85 [Journal ] Peter Klein , Mike Paterson Asymtotically Optimal Circuit for a Storage Access Function. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1980, v:29, n:8, pp:737-738 [Journal ] Francine Berman , Mike Paterson Propositional Dynamic Logic is Weaker without Tests. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1981, v:16, n:, pp:321-328 [Journal ] Kazuo Iwama , Akihiro Matsuura , Mike Paterson A family of NFAs which need 2n- deterministic states. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:301, pp:451-462 [Journal ] Mike Paterson Complexity of Monotone Networks for Boolean Matrix Product. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1975, v:1, n:1, pp:13-20 [Journal ] Mike Paterson David Michael Ritchie Park (1935-1990) in Memoriam. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:133, n:1, pp:187-200 [Journal ] Mike Paterson , Leslie G. Valiant Circuit Size is Nonlinear in Depth. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:2, n:3, pp:397-400 [Journal ] Somasundaram Ravindran , Alan Gibbons , Mike Paterson Dense edge-disjoint embedding of complete binary trees in interconnection networks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:249, n:2, pp:325-342 [Journal ] Uri Zwick , Mike Paterson The Memory Game. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:110, n:1, pp:169-196 [Journal ] Uri Zwick , Mike Paterson The Complexity of Mean Payoff Games on Graphs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:343-359 [Journal ] Power Indices in Spanning Connectivity Games. [Citation Graph (, )][DBLP ] False name manipulations in weighted voting games: splitting, merging and annexation. [Citation Graph (, )][DBLP ] Polynomial-Time Construction of Linear Network Coding. [Citation Graph (, )][DBLP ] Maximum overhang. [Citation Graph (, )][DBLP ] Wiretapping a Hidden Network. [Citation Graph (, )][DBLP ] Multi-commodity Source Location Problems and Price of Greed. [Citation Graph (, )][DBLP ] Computing voting power in easy weighted voting games [Citation Graph (, )][DBLP ] False name manipulations in weighted voting games: splitting, merging and annexation [Citation Graph (, )][DBLP ] Spanning connectivity games [Citation Graph (, )][DBLP ] Wiretapping a hidden network [Citation Graph (, )][DBLP ] Search in 0.022secs, Finished in 0.031secs