Recent publications

1997 1998 1999 2000
2001 2002 2003
2004
2005 2006 2007 2008
2009 In press    
 

1997 [top]

M. D. Atkinson, M.J. Livesey, D. Tulley: Permutations generated by token passing in graphs. Theoretical Computer Science 178 (1997), 103-118.

M. D. Atkinson, D. Tulley: Bounded capacity priority queues. Theoretical Computer Science 182 (1997), 145-157.

M. D. Atkinson, S. van Willigenburg: The p-modular descent algebra of the symmetric group. Bull. London Math. Soc. 29 (1997), 407-414.

M. D. Atkinson, D. Tulley: The combinatorics of some abstract data types, Proceedings of the Institute of Mathematics and its Applications Conference on Combinatorics and its Applications (Oxford, December 1995), Clarendon Press (Oxford 1997), 1-13.

1998 [top]

M. D. Atkinson: Generalised Stack Permutations, Combinatorics, Probability and Computing 7 (1998), 239-246.

M. D. Atkinson: Permutations which are the union of an increasing and a decreasing sequence, Electronic J. Combinatorics 5 (1998), Paper R6 (13 pp.).

M. D. Atkinson: Restricted permutations, Discrete Math. 195 (1998), 27-38. (Available as an Editor's choice).

1999 [top]

M. D. Atkinson, J.-R. Sack: Sorting with parallel pop-stacks, Information Processing Letters, 70 (1999), 63-67.

M. D. Atkinson, R. Beals: Permuting mechanisms and closed classes of permutations, Australian Computer Science Communications, Volume 21 Number 3, Combinatorics, Computation & Logic, Proceedings of DMTCS '99 and CATS '99, Auckland, 18-21 Januray 1999, Editors C S Calude, M J Dineen, pp 117-127, Springer-Verlag Singapore (1999).

Michael H. Albert,, Ambar, Chowdhury, The rationals have an AZ-enumeration. J. London Math. Soc. (2) 59 (1999), no. 2, 385--395.

2000 [top]

M. D. Atkinson, N. D. Gilbert, J. Howie, S. A. Linton, E. F. Robertson: Computational and Geometric Aspects of Modern Algebra, Proceedings of the International ICMS Workshop (Heriot-Watt, 1998) Cambridge University Press, Cambridge 2000 (288 pages).

2001 [top]

Michael H. Albert, Derek Holton, Richard J. Nowakowski, The ultimate categorical matching in a graph. Discrete Math. 232 (2001), no. 1-3, 1-9.

Michael H. Albert and Richard J. Nowakowski: The Game of End-Nim: Paper R1, Electronic J. Combinatorics 8 (2001).

Michael H. Albert, R.E.L. Aldred, Derek Holton, and John Sheehan: 3*-connected graphs, Australasian Journal of Combinatorics, 24, 193-207. M. D. Atkinson, R. Beals: Permutation involvement and groups, Quarterly J. Maths. (Oxford) 52 (2001) 415-421.

Michael H. Albert, R. Aldred, M. D. Atkinson, C.C. Handley, D. A. Holton: Permutations of a multiset avoiding permutations of length $3$, European J. Combinatorics 22 ( 2001) 1021-1031.

Michael H. Albert, R. Aldred, M. D. Atkinson, D. A. Holton: Algorithms for pattern involvement in permutations: in Algorithms and Computation,
12th International Symposium, ISAAC 2001, Proceedings LNCS 2223, P. Eades, T. Takaoka (Eds.) p.355-366.

2002 [top]

Michael H. Albert, M. D. Atkinson, C.C. Handley, D. A. Holton, W Stromquist: The packing density of permutations, Electronic Journal of Combinatorics 9 (2002), Paper R5 (20pp.).

M. D. Atkinson, G. Pfeiffer, S. van Willigenburg: The p-modular descent algebras, Algebras and Representation Theory 5 (2002), 101-113.

Michael H. Albert, M D Atkinson: Sorting with a fork lift, Scandinavian Workshop on Algorithm Theory, Turku, July 2002.

M. D. Atkinson, M. Murphy, N. Ruskuc: Partially well-ordered closed sets of permutations, Journal of Order 19 (2002), 101-113.

M. D. Atkinson, N. Ruskuc, M. Murphy: Sorting with ordered stacks in series, Theoretical Computer Science 289 (2002), 205-223.

M. D. Atkinson, T. Stitt: Restricted permutations and the wreath product, Discrete Math. 259 (2002), 19-36.

2003 [top]

M.H. Albert, M.D. Atkinson: Sorting with a forklift, Electronic J. Combinatorics 9(2) (2003), Paper R9, 23 pages.

M.H. Albert, R.A. Aldred, M.D. Atkinson, H. van Ditmarsch, B. Handley, C.C. Handley, J. Opatrny:Longest subsequences in permutations, Australian J. Combinatorics 28 (2003), 225-238.

M.H. Albert, M.D. Atkinson, N. Ruskuc: Regular closed sets of permutations, Theoretical Computer Science 306 (2003), 85-100.

M.H. Albert, M.D. Atkinson, M. Klazar: The enumeration of simple permutations , Journal of Integer Sequences 6 (2003), article 03.4.4, 18 pages.

2004 [top]

M. D. Atkinson: Computing: The Australasian Theory Symposium (CATS) 2004, Electronic Notes in Theoretical Computer Science 91, 1-263.

M. H. Albert, R. Nowakowski: Nim restrictions. Integers, 4:G1 (2004)

Michael H. Albert, Alexander Golynski, Angele M. Hamel, Alejandro Lopez-Ortiz, S. Srinivasa Rao and Mohammad Ali Safari: Longest increasing subsequences in sliding windows. Theoretical Computer Science Volume 321 (2004) 405-414

M. H. Albert, R. E. L. Aldred, M. D. Atkinson, H. P. van Ditmarsch, C. C. Handley, D. A. Holton: Restricted permutations and queue jumping. Discrete Mathematics 287 (2004) 129-133.

2005 [top]

M. D. Atkinson, F. Dehne: Computing: The Australasian Theory Symposium (CATS) 2005, Volume 41, Conferences in Research and Practice in Information Technology.

M. D. Atkinson: Some equinumerous pattern-avoiding classes of permutations, Discrete Mathematics and Theoretical Computer Science 7 (2005) 71-74.

M. H. Albert, R.E. L. Aldred, M. D. Atkinson, H. P. van Ditmarsch, C. C. Handley, D. A. Holton, D. J. McCaughan: Sorting classes, Electronic J. Combinatorics 12(1) Paper R31 (25 pages).

M. H. Albert, N. Ruskuc, S. A. Linton: The insertion encoding, Electronic J. Combinatorics 12(1) Paper R47 (31 pages).

M. H. Albert, R. E. L. Aldred, M. D. Atkinson, H. P. van Ditmarsch, C. C. Handley: Safe communication for card players by combinatorial designs for two-step protocols, Australasian J. Combinatorics 33 (2005), 33-46.

M. H. Albert, M. D. Atkinson: Simple permutations and pattern restricted permutations, Discrete Math. 300 (2005), 1-15.

M. D. Atkinson, N. Ruskuc, M. M. Murphy: Pattern avoidance classes and subpermutations, Electronic J. Combinatorics 12 (2005).

R. E. L. Aldred, M. D. Atkinson, H. P. van Ditmarsch, C. C. Handley, D. A. Holton, D. J. McCaughan, Permuting machines and priority queues, Theoretical Computer Science 349 (2005), 309-317.

M. H. Albert and M. S. Paterson: Bounds for the growth rate of meander numbers, Journal of Combin. Theory (A) 112 (2005), 250-262.

M. H. Albert, J. P. Grossman, R. J. Nowakowski, D. Wolfe, An introduction to clobber. Integers 5 (2005), no. 2, A1, 12 pp.

2006 [top]

M.H. Albert, M. Elder, A. Rechnitzer, P. Westcott and M. Zabrocki: On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia, Advances in Applied Mathematics, Volume 36, Issue 2, February 2006, Pages 96-105.

2007 [top]

M. H. Albert, M. D. Atkinson, D. Nussbaum, J. Sack, N. Santoro: On the longest increasing subsequence of a circular list, Information Processing Letters 101 (2007) 55-59.

M. H. Albert, R. E. L. Aldred, M. D. Atkinson, H. P. van Ditmarsch, C. C. Handley, D. A. Holton, D. J. McCaughan: Compositions of pattern restricted sets of permutations, Australasian J. Combinatorics 37, 43-56.

M. D. Atkinson, M.H. Albert, R. E. L. Aldred, H.P. van Ditmarsch, C.C. Handley, D.A. Holton, D. J. McCaughan, C. Monteith: Cyclically closed pattern classes of permutations, Australasian J. Combinatorics 38, 87-100.

M. H. Albert, M. D. Atkinson, R. Brignall: Permutation classes of polynomial growth, Annals of Combinatorics 11 (2007), 249-264.

M. D. Atkinson: On permutation pattern classes with two restrictions only, Annals of Combinatorics 11 (2007), 271-283.

M. H. Albert: On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation, Random Structures and Algorithms, 31 (2007), no. 2, 227-238.

2008 [top]

2009 [top]

M. H. Albert, R. E. L. Aldred, M. D. Atkinson, C. C. Handley, D. A. Holton, D. J. Mccaughan, and B. E. Sagan: Monotonic sequence games, Article 15 in Games of No Chance 3, eds M. H. Albert, R. Nowakowski, Cambridge University Press

M. D. Atkinson, H. van Ditmarsch, S. Roehling: Avoiding bias in cards cryptography, Australasian J. Combinatorics 44 (2009), 3-17.

In Press [top]

M. H. Albert, M. D. Atkinson. S. A. Linton: Permutations generated by stacks and deques, Annals of Combinatorics.

R. E. L. Aldred, M. D. Atkinson, D. J. McCaughan: Avoiding consecutive patterns in permutations, Advances in Applied Mathematics

Back to top