Searching for authors named "Mike Paterson" – sorted by Relevance.
-
Progress in Selection
- Progress in Selection ? Mike Paterson Department of Computer Science, University of Warwick
- Cited by 11 (0 self) – Add To MetaCart
-
Contention Resolution with Bounded Delay
- Contention Resolution with Bounded Delay Mike Paterson y Aravind Srinivasan z Dept
- Cited by 6 (0 self) – Add To MetaCart
-
On Approximating Rectangle Tiling and Packing
- On Approximating Rectangle Tiling and Packing Sanjeev Khanna S. Muthukrishnan y Mike Paterson
- Cited by 29 (6 self) – Add To MetaCart
-
Longest Common Subsequences
- Longest Common Subsequences ? Mike Paterson Vlado Danc'ik ?? Department of Computer Science
- Cited by 25 (1 self) – Add To MetaCart
-
The Complexity of Mean Payoff Games on Graphs
- The complexity of mean payoff games on graphs Uri Zwick y Mike Paterson z July 26, 1995
- Cited by 34 (1 self) – Add To MetaCart
-
Looking for MUM and DAD: text-text comparisons do help
- Looking for MUM and DAD: text--text comparisons do help ? Mike Paterson, 1 Shlomit Tassa, 2
- Add To MetaCart
-
Tighter Lower Bounds on the Exact Complexity of String Matching
- Mike Paterson y Uri Zwick z January 14, 2002 Abstract The paper considers the exact number
- Cited by 16 (4 self) – Add To MetaCart
-
Lower Bounds for Monotone Span Programs
- al Mike Paterson BRICS Report Series RS-94-46 ISSN 0909-0878 December 1994 Copyright c fl 1994
- Cited by 32 (5 self) – Add To MetaCart
-
A deterministic subexponential algorithm for solving parity games
- A DETERMINISTIC SUBEXPONENTIAL ALGORITHM FOR SOLVING PARITY GAMES ∗ MARCIN JURDZI ŃSKI† , MIKE
- Cited by 3 (0 self) – Add To MetaCart
-
On Weak Circular Squares in Binary Words
- On Weak Circular Squares in Binary Words Aviezri S. Fraenkel 1 , Jamie Simpson 2 and Mike
- Add To MetaCart

