Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Paterson, Mike - Department of Computer Science, University of Warwick
Mike Paterson and Uri Zwick 1. INTRODUCTION. How far off the edge of the table can we reach by stacking n
The complexity of choosing an H-colouring (nearly) uniformly at random
On Permutation Communications in All-Optical Mike Paterson Heiko Schroder y Ondrej S ykora z
A Family of NFA's Which Need 2 n 0 ff Deterministic States
THEC APAC ITY OF BAC KOFF AND
Maximum Overhang Mike Paterson, Yuval Peres, Mikkel Thorup,
Polynomial-Time Construction of Linear Network Coding
Journal of Artificial Intelligence Research 40 (2011) 57-93 Submitted 08/10; published 01/11 False-Name Manipulations in Weighted Voting Games
