M. D. Atkinson

34 papers Journal 34
YearRankTypeTitle / Venue / Authors
2016 J jnl
Deflatability of permutation classes.
Australas. J Comb.
Michael H. Albert, M. D. Atkinson, Cheyne Homberger, Jay Pantone
2014 J jnl
Inflations of geometric grid classes: three case studies.
Australas. J Comb.
Michael H. Albert, M. D. Atkinson, Vincent Vatter
2012 J jnl
Counting s(3+1)-avoiding permutations.
Eur. J. Comb.
M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter
2012 J jnl
Pattern classes and priority queues
CoRR
Michael H. Albert, M. D. Atkinson
2011 J jnl
Substitution-closed pattern classes.
J. Comb. Theory A
M. D. Atkinson, Nikola Ruskuc, Rebecca Smith
2010 J jnl
Growth Rates for Subclasses of Av(321).
Electron. J. Comb.
Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West
2009 J jnl
Counting 1324, 4231-Avoiding Permutations.
Electron. J. Comb.
Michael H. Albert, M. D. Atkinson, Vincent Vatter
2007 J jnl
Avoiding bias in cards cryptography
CoRR
M. D. Atkinson, Hans P. van Ditmarsch, Sigrid Roehling
1999 J jnl
Pop-Stacks in Parallel.
Inf. Process. Lett.
M. D. Atkinson, Jörg-Rüdiger Sack
1999 J jnl
Restricted permutations.
Discret. Math.
M. D. Atkinson
1998 J jnl
Generalized Stack Permutations.
Comb. Probab. Comput.
M. D. Atkinson
1998 J jnl
Permutations which are the Union of an Increasing and a Decreasing Subsequence.
Electron. J. Comb.
M. D. Atkinson
1997 J jnl
Bounded Capacity Priority Queues.
Theor. Comput. Sci.
M. D. Atkinson, D. Tulley
1997 J jnl
Permutations Generated by Token Passing in Graphs.
Theor. Comput. Sci.
M. D. Atkinson, Mike Livesey, D. Tulley
1995 J jnl
Priority Queues and Multisets.
Electron. J. Comb.
M. D. Atkinson, Stephen A. Linton, L. A. Walker
1994 J jnl
Priority Queues and Permutations.
SIAM J. Comput.
M. D. Atkinson, Robert Beals
1994 J jnl
Uniform Generation of Binary Trees in Parallel.
J. Parallel Distributed Comput.
M. D. Atkinson, Jörg-Rüdiger Sack
1994 J jnl
Uniform Generation of Forests of Restricted Height.
Inf. Process. Lett.
M. D. Atkinson, Jörg-Rüdiger Sack
1993 J jnl
Enumerating k-Way Trees.
Inf. Process. Lett.
M. D. Atkinson, Louise Walker
1993 J jnl
The Permutational Power of a Priority Queue.
BIT
M. D. Atkinson, Murali Thiyagarajah
1993 J jnl
Uniform Generation of Rooted Ordered Trees with Prescribed Degrees.
Comput. J.
M. D. Atkinson
1992 J jnl
Generating Binary Trees at Random.
Inf. Process. Lett.
M. D. Atkinson, Jörg-Rüdiger Sack
1991 J jnl
The Recursive Structure of Some Ordering Problems.
BIT
M. D. Atkinson
1990 J jnl
A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygons.
Comput. Appl. Biosci.
M. D. Atkinson, J. S. Heslop-Harrison
1990 J jnl
Sums of lexicographically ordered sets.
Discret. Math.
M. D. Atkinson, Alberto Negro, Nicola Santoro
1988 J jnl
A Practical Algorithm for Boolean Matrix Multiplication.
Inf. Process. Lett.
M. D. Atkinson, Nicola Santoro
1987 J jnl
An Optimal Algorithm for Geometrical Congruence.
J. Algorithms
M. D. Atkinson
1987 J jnl
Computing the Number of Mergings with Constraints.
Inf. Process. Lett.
M. D. Atkinson, H. W. Chang
1986 J jnl
Min-Max Heaps and Generalized Priority Queues.
Commun. ACM
M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte
1986 J jnl
On the Computation of Group Characters.
J. Symb. Comput.
M. D. Atkinson, R. A. Hassan
1983 J jnl
The Ranks of m * n * (mn-2) Tensors.
SIAM J. Comput.
M. D. Atkinson, S. Lloyd
1981 J jnl
The Cyclic Towers of Hanoi.
Inf. Process. Lett.
M. D. Atkinson
1980 J jnl
Permutation Groups and Set Union Algorithms.
Comput. J.
M. D. Atkinson
1977 J jnl
The Complexity of Group Algebra Computations.
Theor. Comput. Sci.
M. D. Atkinson