The following pages link to Mike S. Paterson (Q1904666):
Displaying 50 items.
- (Q242871) (redirect page) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
- \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice (Q1904667) (← links)
- Better Approximation Guarantees for Job-Shop Scheduling (Q2706190) (← links)
- (Q2754189) (← links)
- (Q2754194) (← links)
- The Complexity of Gene Placement (Q2775888) (← links)
- Looking for MUM and DAD: Text-text comparisons do help (Q2956669) (← links)
- False-Name Manipulations in Weighted Voting Games (Q3068942) (← links)
- Maximum Overhang (Q3107108) (← links)
- More about Exact Slow $k$-Nim (Q3390058) (← links)
- A Deterministic Subexponential Algorithm for Solving Parity Games (Q3395043) (← links)
- Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on <b>Z</b><sup>2</sup> (Q3430817) (← links)
- Polynomial-Time Construction of Linear Network Coding (Q3521926) (← links)
- On counting homomorphisms to directed acyclic graphs (Q3546354) (← links)
- The complexity of choosing an <i>H</i> -colouring (nearly) uniformly at random (Q3579223) (← links)
- (Q3579383) (← links)
- A deterministic subexponential algorithm for solving parity games (Q3581528) (← links)
- Overhang (Q3581532) (← links)
- Overhang (Q3606424) (← links)
- On Counting Homomorphisms to Directed Acyclic Graphs (Q3613747) (← links)
- The Multi-Commodity Source Location Problems and the Price of Greed (Q3627966) (← links)
- Power Indices in Spanning Connectivity Games (Q3638444) (← links)
- Consistency of Natural Relations on Sets (Q4228205) (← links)
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics) (Q4229424) (← links)
- (Q4230345) (← links)
- (Q4231915) (← links)
- (Q4252311) (← links)
- (Q4252753) (← links)
- Tighter Lower Bounds on the Exact Complexity of String Matching (Q4326851) (← links)
- The asymptotic complexity of merging networks (Q4371518) (← links)
- The computational complexity of two‐state spin systems (Q4434468) (← links)
- (Q4536379) (← links)
- A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols (Q4651466) (← links)
- The Complexity of Choosing an <i>H</i>-Coloring (Nearly) Uniformly at Random (Q4651471) (← links)
- Random sampling of 3‐colorings in ℤ<sup>2</sup> (Q4736775) (← links)
- (Q4818874) (← links)
- Upper bounds for the expected length of a longest common subsequence of two binary sequences (Q4845082) (← links)
- (Q4875208) (← links)
- (Q4942627) (← links)
- (Q4952617) (← links)
- Progress in selection (Q5054828) (← links)
- Bounded Hanoi (Q5071763) (← links)
- Longest common subsequences (Q5096874) (← links)
- Globe-hopping (Q5160980) (← links)
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes (Q5384026) (← links)
- Multi-commodity Source Location Problems and Price of Greed (Q5452163) (← links)
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs (Q5470700) (← links)
