The Complexity of Group Algebra Computations. - M. D. Atkinson (Theor. Comput. Sci., 1977)

Permutation Groups and Set Union Algorithms. - M. D. Atkinson (Comput. J., 1980)

Saving space in coset enumeration. - Mike D. Atkinson (SIGSAM Bull., 1981)

The Cyclic Towers of Hanoi. - M. D. Atkinson (Inf. Process. Lett., 1981)

The Ranks of m * n * (mn-2) Tensors. - M. D. Atkinson; S. Lloyd (SIAM J. Comput., 1983)

Min-Max Heaps and Generalized Priority Queues. - M. D. Atkinson; Jörg-Rüdiger Sack; Nicola Santoro; Thomas Strothotte (Commun. ACM, 1986)

On the Computation of Group Characters. - M. D. Atkinson; R. A. Hassan (J. Symb. Comput., 1986)

On the integer complexity of Boolean matrix multiplication. - Mike D. Atkinson; Nicola Santoro; Jorge Urrutia (SIGACT News, 1986)

Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters. - Michael D. Atkinson; Nicola Santoro; Jorge Urrutia (IEEE Trans. Commun., 1986)

Computing the Number of Mergings with Constraints. - M. D. Atkinson; H. W. Chang (Inf. Process. Lett., 1987)

An Optimal Algorithm for Geometrical Congruence. - M. D. Atkinson (J. Algorithms, 1987)

A Practical Algorithm for Boolean Matrix Multiplication. - M. D. Atkinson; Nicola Santoro (Inf. Process. Lett., 1988)

A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygons. - M. D. Atkinson; J. S. Heslop-Harrison (Comput. Appl. Biosci., 1990)

Sums of lexicographically ordered sets. - M. D. Atkinson; Alberto Negro; Nicola Santoro (Discret. Math., 1990)

The Recursive Structure of Some Ordering Problems. - M. D. Atkinson (BIT, 1991)

Generating Binary Trees at Random. - M. D. Atkinson; Jörg-Rüdiger Sack (Inf. Process. Lett., 1992)

The Permutational Power of a Priority Queue. - M. D. Atkinson; Murali Thiyagarajah (BIT, 1993)

Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. - M. D. Atkinson (Comput. J., 1993)

Enumerating k-Way Trees. - M. D. Atkinson; Louise Walker (Inf. Process. Lett., 1993)

Uniform Generation of Forests of Restricted Height. - M. D. Atkinson; Jörg-Rüdiger Sack (Inf. Process. Lett., 1994)

Uniform Generation of Binary Trees in Parallel. - M. D. Atkinson; Jörg-Rüdiger Sack (J. Parallel Distributed Comput., 1994)

Priority Queues and Permutations. - M. D. Atkinson; Robert Beals (SIAM J. Comput., 1994)

Priority Queues and Multisets. - M. D. Atkinson; Stephen A. Linton; L. A. Walker (Electron. J. Comb., 1995)

Permutations Generated by Token Passing in Graphs. - M. D. Atkinson; Mike Livesey; D. Tulley (Theor. Comput. Sci., 1997)

Bounded Capacity Priority Queues. - M. D. Atkinson; D. Tulley (Theor. Comput. Sci., 1997)

Permutations which are the Union of an Increasing and a Decreasing Subsequence. - M. D. Atkinson (Electron. J. Comb., 1998)

Generalized Stack Permutations. - M. D. Atkinson (Comb. Probab. Comput., 1998)

Restricted permutations. - M. D. Atkinson (Discret. Math., 1999)

Pop-Stacks in Parallel. - M. D. Atkinson; Jörg-Rüdiger Sack (Inf. Process. Lett., 1999)

Algorithms for Pattern Involvement in Permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Derek A. Holton (ISAAC, 2001)

Permutations of a Multiset Avoiding Permutations of Length 3. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Chris C. Handley; Derek A. Holton (Eur. J. Comb., 2001)

Sorting with a Forklift. - Michael H. Albert; Mike D. Atkinson (Electron. J. Comb., 2002)

On Packing Densities of Permutations. - Michael H. Albert; Mike D. Atkinson; Chris C. Handley; Derek A. Holton; Walter Stromquist (Electron. J. Comb., 2002)

Restricted permutations and the wreath product. - Mike D. Atkinson; Timothy Stitt (Discret. Math., 2002)

Partially Well-Ordered Closed Sets of Permutations. - Mike D. Atkinson; Max Murphy 001; Nikola Ruskuc (Order, 2002)

Sorting with two ordered stacks in series. - Mike D. Atkinson; Max Murphy 001; Nikola Ruskuc (Theor. Comput. Sci., 2002)

Longest subsequences in permutations. - Michael H. Albert; Robert E. L. Aldred; Michael D. Atkinson; Hans P. van Ditmarsch; B. D. Handley; Chris C. Handley; Jaroslav Opatrny (Australas. J Comb., 2003)

Regular closed sets of permutations. - Michael H. Albert; Mike D. Atkinson; Nikola Ruskuc (Theor. Comput. Sci., 2003)

Restricted permutations and queue jumping. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton (Discret. Math., 2004)

Foreword. - Mike D. Atkinson (CATS, 2004)

Safe communication for card players by combinatorial designs for two-step protocols. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley (Australas. J Comb., 2005)

Sorting Classes. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Chris C. Handley; Derek A. Holton; D. J. McCaughan; Hans P. van Ditmarsch (Electron. J. Comb., 2005)

Pattern Avoidance Classes and Subpermutations. - Mike D. Atkinson; Maximillian M. Murphy; Nikola Ruskuc (Electron. J. Comb., 2005)

Simple permutations and pattern restricted permutations. - Michael H. Albert; Mike D. Atkinson (Discret. Math., 2005)

Some equinumerous pattern-avoiding classes of permutations. - Mike D. Atkinson (Discret. Math. Theor. Comput. Sci., 2005)

Permuting machines and priority queues. - Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan (Theor. Comput. Sci., 2005)

Compositions of pattern restricted sets of permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan (Australas. J Comb., 2007)

Cyclically closed pattern classes of permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan; C. W. Monteith (Australas. J Comb., 2007)

On the longest increasing subsequence of a circular list. - Michael H. Albert; Mike D. Atkinson; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro (Inf. Process. Lett., 2007)

Avoiding bias in cards cryptography. - Mike D. Atkinson; Hans P. van Ditmarsch; Sigrid Roehling (Australas. J Comb., 2009)

Counting 1324, 4231-Avoiding Permutations. - Michael H. Albert; M. D. Atkinson; Vincent Vatter (Electron. J. Comb., 2009)

Avoiding consecutive patterns in permutations. - Robert E. L. Aldred; Mike D. Atkinson; D. J. McCaughan (Adv. Appl. Math., 2010)

Growth Rates for Subclasses of Av(321). - Michael H. Albert; M. D. Atkinson; Robert Brignall; Nikola Ruskuc; Rebecca Smith 001; J. West (Electron. J. Comb., 2010)

Substitution-closed pattern classes. - M. D. Atkinson; Nikola Ruskuc; Rebecca Smith 001 (J. Comb. Theory A, 2011)

The Enumeration of Three Pattern Classes using Monotone Grid Classes. - Michael H. Albert; Mike D. Atkinson; Robert Brignall (Electron. J. Comb., 2012)

Pattern classes and priority queues - Michael H. Albert; M. D. Atkinson (CoRR, 2012)

Counting s(3+1)-avoiding permutations. - M. D. Atkinson; Bruce E. Sagan; Vincent R. Vatter (Eur. J. Comb., 2012)

Inflations of geometric grid classes: three case studies. - Michael H. Albert; M. D. Atkinson; Vincent Vatter (Australas. J Comb., 2014)

Deflatability of permutation classes. - Michael H. Albert; M. D. Atkinson; Cheyne Homberger; Jay Pantone (Australas. J Comb., 2016)

3D variational autoencoder for fingerprinting microstructure volume elements. - Michael D. White; Michael D. Atkinson; Adam J. Plowman; Pratheek Shanthraj (CoRR, 2025)