Atkinson, Mike - Department of Computer Science, University of Otago

• Longest subsequences in permutations M. H. Albert
• ELSEVIER Theoretical Computer Science 178 (1997) 103-l 18 Theoretical
• Restricted Permutations M D Atkinson
• Permutations of a multiset avoiding permutations of length 3
• Safe communication for card players by combinatorial designs for two-step protocols
• On the longest increasing subsequence of a circular list
• Pop-Stacks in Parallel M.D. Atkinson
• GENERALISED STACK PERMUTATIONS M D Atkinson
• Permuting mechanisms and closed classes of permutations
• Restricted permutations and the wreath M.D. Atkinson
• Order 5 (1988), 33-43. 0 1988 by Kluwer Academic Publishers
• Algorithms for pattern involvement in permutations
• SPACES OF MATRICES OF BOUNDED RANK By M. D. ATKINSON and N. M. STEPHENS
• The p-Modular Descent Algebras M.D. Atkinson
• Permutation involvement and groups M.D. Atkinson
• Compositions of pattern restricted sets of permutations
• On permutation pattern classes with two restrictions only
• 530 ARCH. MATH. Some permutation groups of degree p=6q+l
• Permutations generated by stacks and deques M. H. Albert
• Partially well-ordered closed sets of permutations M. D. Atkinson
• Permuting machines and priority queues R. E. L. Aldred
• Algorithms for pattern involvement in permutations
• ELSEVIER Theoretical Computer Science 182(1997) 145-l 57 Theoretical
• REGULAR CLOSED SETS OF PERMUTATIONS
• The Complexity of Algorithms M. D. Atkinson
• Bull. London Math. Soc. Page 1 of 12 Ce2011 London Mathematical Society doi:10.1112/blms/bdr022
• Sorting with two ordered stacks in series M. D. Atkinson a; M. M. Murphy b N. Ru skuc b
• The pmodular Descent Algebra of the Symmetric Group
• Simple permutations and pattern restricted permutations
• Permutation Classes of Polynomial Growth M. H. Albert
• Avoiding bias in cards cryptography M.D. Atkinson
• COUNTING 1324, 4231-AVOIDING PERMUTATIONS Michael H. Albert
• Growth rates for subclasses of Av(321) M. H. Albert1
• Substitution-closed pattern classes M. D. Atkinsona,
• Counting (3 + 1)-avoiding permutations M. D. Atkinsona,
• RESEARCHCONTRIBUTIONS Programming
• BIT31(1991).194-201. THE RECURSIVE STRUCTURE OF
• Restricted Permutations M D Atkinson
• The combinatorics of some abstract data types M D Atkinson and D Tulley
• SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES
• LARGE SPACES OF MATRICES OF BOUNDED RANK
• Order 10:31-36, 1993, 31 1993KtuwerAcademic Publishers. Printed in the Netherlands.
• Avoiding consecutive patterns in permutations R. E. L. Aldred
• COMPUTER SCIENCE BIT33(1993),2-6.