Mike D. Atkinson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2012

The Enumeration of Three Pattern Classes using Monotone Grid ClassesMichael H. Albert, Mike D. Atkinson, Robert Brignall. combinatorics, 19(3):20, 2012. [doi]

2010

Avoiding consecutive patterns in permutationsRobert E. L. Aldred, Mike D. Atkinson, D. J. McCaughan. aam, 45(3):449-461, 2010. [doi]

2009

Avoiding bias in cards cryptographyMike D. Atkinson, Hans P. van Ditmarsch, Sigrid Roehling. ajc, 44:3-18, 2009. [doi]

2007

2005

Simple permutations and pattern restricted permutationsMichael H. Albert, Mike D. Atkinson. DM, 300(1-3):1-15, 2005. [doi]

Sorting ClassesMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, D. J. McCaughan, Hans P. van Ditmarsch. combinatorics, 12, 2005. [doi]

Safe communication for card players by combinatorial designs for two-step protocolsMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley. ajc, 33:33-46, 2005. [doi]

Permuting machines and priority queuesRobert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan. TCS, 349(3):309-317, 2005. [doi]

Some equinumerous pattern-avoiding classes of permutationsMike D. Atkinson. dmtcs, 7(1):71-74, 2005. [doi]

Pattern Avoidance Classes and SubpermutationsMike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc. combinatorics, 12, 2005. [doi]

2004

Restricted permutations and queue jumpingMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton. DM, 287(1-3):129-133, 2004. [doi]

ForewordMike D. Atkinson. ENTCS, 91:1-2, 2004. [doi]

2003

Regular closed sets of permutationsMichael H. Albert, Mike D. Atkinson, Nikola Ruskuc. TCS, 306(1-3):85-100, 2003. [doi]

2002

Sorting with a ForkliftMichael H. Albert, Mike D. Atkinson. swat 2002: 368-377 [doi]

On Packing Densities of PermutationsMichael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist. combinatorics, 9(1), 2002. [doi]

Sorting with a ForkliftMichael H. Albert, Mike D. Atkinson. combinatorics, on(2), 2002. [doi]

Restricted permutations and the wreath productMike D. Atkinson, Timothy Stitt. DM, 259(1-3):19-36, 2002. [doi]

Sorting with two ordered stacks in seriesMike D. Atkinson, Max Murphy, Nikola Ruskuc. TCS, 289(1):205-223, 2002.

Partially Well-Ordered Closed Sets of PermutationsMike D. Atkinson, Max Murphy, Nikola Ruskuc. order, 19(2):101-113, 2002. [doi]

2001

Algorithms for Pattern Involvement in PermutationsMichael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton. isaac 2001: 355-366 [doi]

Permutations of a Multiset Avoiding Permutations of Length 3Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton. ejc, 22(8):1021-1031, 2001. [doi]

1986

On the integer complexity of Boolean matrix multiplicationMike D. Atkinson, Nicola Santoro, Jorge Urrutia. sigact, 18(1):53, 1986. [doi]

1981

Saving space in coset enumerationMike D. Atkinson. cca, 15(4):12-14, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL