M. D. Atkinson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2016

Deflatability of permutation classesMichael H. Albert, M. D. Atkinson, Cheyne Homberger, Jay Pantone. ajc, 64:252-276, 2016. [doi]

2014

Inflations of geometric grid classes: three case studiesMichael H. Albert, M. D. Atkinson, Vincent Vatter. ajc, 58:27-47, 2014. [doi]

2012

Counting s(3+1)-avoiding permutationsM. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter. ejc, 33(1):49-61, 2012. [doi]

2011

Substitution-closed pattern classesM. D. Atkinson, Nikola Ruskuc, Rebecca Smith. JCT, 118(2):317-340, 2011. [doi]

2010

Growth Rates for Subclasses of Av(321)Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West. combinatorics, 17(1), 2010. [doi]

2009

Counting 1324, 4231-Avoiding PermutationsMichael H. Albert, M. D. Atkinson, Vincent Vatter. combinatorics, 16(1), 2009. [doi]

1999

Pop-Stacks in ParallelM. D. Atkinson, Jörg-Rüdiger Sack. ipl, 70(2):63-67, 1999. [doi]

Restricted permutationsM. D. Atkinson. DM, 195(1-3):27-38, 1999. [doi]

1998

Permutations which are the Union of an Increasing and a Decreasing SubsequenceM. D. Atkinson. combinatorics, 5, 1998. [doi]

Generalized Stack PermutationsM. D. Atkinson. cpc, 7(3):239-246, 1998.

1997

Bounded Capacity Priority QueuesM. D. Atkinson, D. Tulley. TCS, 182(1-2):145-157, 1997. [doi]

Permutations Generated by Token Passing in GraphsM. D. Atkinson, Mike Livesey, D. Tulley. TCS, 178(1-2):103-118, 1997. [doi]

1995

Priority Queues and MultisetsM. D. Atkinson, S. A. Linton, L. A. Walker. combinatorics, 2, 1995. [doi]

1994

Priority Queues and PermutationsM. D. Atkinson, Robert Beals. SICOMP, 23(6):1225-1230, 1994.

Uniform Generation of Binary Trees in ParallelM. D. Atkinson, Jörg-Rüdiger Sack. jpdc, 23(1):101-103, 1994.

Uniform Generation of Forests of Restricted HeightM. D. Atkinson, Jörg-Rüdiger Sack. ipl, 50(6):323-327, 1994.

1993

Uniform Generation of Rooted Ordered Trees with Prescribed DegreesM. D. Atkinson. cj, 36(6):593-594, 1993.

Enumerating k-Way TreesM. D. Atkinson, Louise Walker. ipl, 48(2):73-75, 1993.

The Permutational Power of a Priority QueueM. D. Atkinson, Murali Thiyagarajah. bit, 33(1):2-6, 1993.

1992

Generating Binary Trees at RandomM. D. Atkinson, Jörg-Rüdiger Sack. ipl, 41(1):21-23, 1992.

1991

The Recursive Structure of Some Ordering ProblemsM. D. Atkinson. bit, 31(2):194-201, 1991.

1990

A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygonsM. D. Atkinson, J. S. Heslop-Harrison. bioinformatics, 6(1):55-56, 1990.

Sums of lexicographically ordered setsM. D. Atkinson, Alberto Negro, Nicola Santoro. DM, 80(2):115-122, 1990. [doi]

1988

A Practical Algorithm for Boolean Matrix MultiplicationM. D. Atkinson, Nicola Santoro. ipl, 29(1):37-38, 1988.

1987

Computing the Number of Mergings with ConstraintsM. D. Atkinson, H. W. Chang. ipl, 24(5):289-292, 1987.

An Optimal Algorithm for Geometrical CongruenceM. D. Atkinson. jal, 8(2):159-172, 1987.

1986

On the Computation of Group CharactersM. D. Atkinson, R. A. Hassan. JSC, 2(1):45-50, 1986.

Min-Max Heaps and Generalized Priority QueuesM. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte. CACM, 29(10):996-1000, 1986.

1983

The Ranks of m * n * (mn-2) TensorsM. D. Atkinson, S. Lloyd. SICOMP, 12(4):611-615, 1983.

1981

The Cyclic Towers of HanoiM. D. Atkinson. ipl, 13(3):118-119, 1981.

1980

Permutation Groups and Set Union AlgorithmsM. D. Atkinson. cj, 23(2):187, 1980.

1977

The Complexity of Group Algebra ComputationsM. D. Atkinson. TCS, 5(2):205-209, 1977.

Sign in or sign up to see more results.

runs on WebDSL