Min-max heaps and generalized priority queues MD Atkinson, JR Sack, N Santoro, T Strothotte Communications of the ACM 29 (10), 996-1000, 1986 | 240 | 1986 |
Simple permutations and pattern restricted permutations MH Albert, MD Atkinson Discrete Mathematics 300 (1-3), 1-15, 2005 | 215 | 2005 |
Restricted permutations MD Atkinson Discrete Mathematics 195 (1-3), 27-38, 1999 | 134 | 1999 |
An optimal algorithm for geometrical congruence MD Atkinson Journal of Algorithms 8 (2), 159-172, 1987 | 102 | 1987 |
The enumeration of simple permutations MH Albert, MD Atkinson, M Klazar arXiv preprint math/0304213, 2003 | 101 | 2003 |
Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters M Atkinson, N Santoro, J Urrutia IEEE Transactions on Communications 34 (6), 614-617, 1986 | 96 | 1986 |
Restricted permutations and the wreath product MD Atkinson, T Stitt Discrete Mathematics 259 (1-3), 19-36, 2002 | 91 | 2002 |
An algorithm for finding the blocks of a permutation group MD Atkinson Mathematics of computation 29 (131), 911-913, 1975 | 88 | 1975 |
The cyclic towers of Hanoi MD Atkinson Information Processing Letters 13 (3), 118-119, 1981 | 83 | 1981 |
Geometric grid classes of permutations M Albert, M Atkinson, M Bouvel, N Ruškuc, V Vatter Transactions of the American Mathematical Society 365 (11), 5859-5881, 2013 | 79 | 2013 |
Partially well-ordered closed sets of permutations MD Atkinson, MM Murphy, N Ruškuc Order 19, 101-113, 2002 | 74 | 2002 |
Safe communication for card players by combinatorial designs for two-step protocols CCH MH Albert, REL Aldred, MD Atkinson, HPv Ditmarsch Australasian Journal of Combinatorics 33, 33-46, 2005 | 64* | 2005 |
On packing densities of permutations MH Albert, MD Atkinson, CC Handley, DA Holton, W Stromquist the electronic journal of combinatorics 9 (1), R5, 2002 | 63 | 2002 |
Sorting with two ordered stacks in series MD Atkinson, MM Murphy, N Ruškuc Theoretical Computer Science 289 (1), 205-223, 2002 | 62 | 2002 |
Primitive spaces of matrices of bounded rank. II MD Atkinson Journal of the Australian Mathematical Society 34 (3), 306-315, 1983 | 59 | 1983 |
Permutations which are the union of an increasing and a decreasing subsequence MD Atkinson Electronic Journal of Combinatorics 5, 87-100, 1998 | 57 | 1998 |
Algorithms for pattern involvement in permutations MH Albert, REL Aldred, MD Atkinson, DA Holton Algorithms and Computation: 12th International Symposium, ISAAC 2001 …, 2001 | 56 | 2001 |
Regular closed sets of permutations MH Albert, MD Atkinson, N Ruškuc Theoretical Computer Science 306 (1-3), 85-100, 2003 | 55 | 2003 |
Large spaces of matrices of bounded rank MD Atkinson, S Lloyd The Quarterly Journal of Mathematics 31 (3), 253-262, 1980 | 55 | 1980 |
Generating binary trees at random MD Atkinson, JR Sack Information Processing Letters 41 (1), 21-23, 1992 | 53 | 1992 |