Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mike D. Atkinson
M. D. Atkinson
2010 – today
- 2012
[j46]Michael H. Albert, Mike D. Atkinson, Robert Brignall: The Enumeration of Three Pattern Classes using Monotone Grid Classes. Electr. J. Comb. 19(3): P20 (2012)- [j45]M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter: Counting s(3+1)-avoiding permutations. Eur. J. Comb. 33(1): 49-61 (2012)
- [i3]
- 2011
- [j44]M. D. Atkinson, Nikola Ruskuc, Rebecca Smith: Substitution-closed pattern classes. J. Comb. Theory, Ser. A 118(2): 317-340 (2011)
- 2010
- [j43]Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West: Growth Rates for Subclasses of Av(321). Electr. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j42]Michael H. Albert, M. D. Atkinson, Vincent Vatter: Counting 1324, 4231-Avoiding Permutations. Electr. J. Comb. 16(1) (2009)
- 2007
- [j41]Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro: On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2): 55-59 (2007)
- [i2]M. D. Atkinson, Hans P. van Ditmarsch, S. Roehling: Avoiding bias in cards cryptography. CoRR abs/cs/0702097 (2007)
- 2005
- [j40]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, D. J. McCaughan, Hans P. van Ditmarsch: Sorting Classes. Electr. J. Comb. 12 (2005)
- [j39]Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc: Pattern Avoidance Classes and Subpermutations. Electr. J. Comb. 12 (2005)
- [j38]Michael H. Albert, Mike D. Atkinson: Simple permutations and pattern restricted permutations. Discrete Mathematics 300(1-3): 1-15 (2005)
- [j37]Mike D. Atkinson: Some equinumerous pattern-avoiding classes of permutations. Discrete Mathematics & Theoretical Computer Science 7(1): 71-74 (2005)
- [j36]Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan: Permuting machines and priority queues. Theor. Comput. Sci. 349(3): 309-317 (2005)
- [e1]Mike D. Atkinson, Frank K. H. A. Dehne (Eds.): Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005. CRPIT 41, Australian Computer Society 2005, ISBN 1-920682-23-6
- 2004
- [j35]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton: Restricted permutations and queue jumping. Discrete Mathematics 287(1-3): 129-133 (2004)
- [j34]
- 2003
- [j33]Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc: Regular closed sets of permutations. Theor. Comput. Sci. 306(1-3): 85-100 (2003)
- 2002
- [j32]Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist: On Packing Densities of Permutations. Electr. J. Comb. 9(1) (2002)
- [j31]
- [j30]Mike D. Atkinson, Timothy Stitt: Restricted permutations and the wreath product. Discrete Mathematics 259(1-3): 19-36 (2002)
- [j29]Mike D. Atkinson, Max Murphy, Nikola Ruskuc: Partially Well-Ordered Closed Sets of Permutations. Order 19(2): 101-113 (2002)
- [j28]Mike D. Atkinson, Max Murphy, Nikola Ruskuc: Sorting with two ordered stacks in series. Theor. Comput. Sci. 289(1): 205-223 (2002)
- [c2]
- [i1]
- 2001
- [j27]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton: Permutations of a Multiset Avoiding Permutations of Length 3. Eur. J. Comb. 22(8): 1021-1031 (2001)
- [c1]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton: Algorithms for Pattern Involvement in Permutations. ISAAC 2001: 355-366
1990 – 1999
- 1999
- [j26]
- [j25]
- 1998
- [j24]M. D. Atkinson: Permutations which are the Union of an Increasing and a Decreasing Subsequence. Electr. J. Comb. 5 (1998)
- [j23]M. D. Atkinson: Generalized Stack Permutations. Combinatorics, Probability & Computing 7(3): 239-246 (1998)
- 1997
- [j22]M. D. Atkinson, Mike Livesey, D. Tulley: Permutations Generated by Token Passing in Graphs. Theor. Comput. Sci. 178(1-2): 103-118 (1997)
- [j21]M. D. Atkinson, D. Tulley: Bounded Capacity Priority Queues. Theor. Comput. Sci. 182(1-2): 145-157 (1997)
- 1995
- [j20]M. D. Atkinson, S. A. Linton, L. A. Walker: Priority Queues and Multisets. Electr. J. Comb. 2 (1995)
- 1994
- [j19]M. D. Atkinson, Jörg-Rüdiger Sack: Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. 50(6): 323-327 (1994)
- [j18]M. D. Atkinson, Jörg-Rüdiger Sack: Uniform Generation of Binary Trees in Parallel. J. Parallel Distrib. Comput. 23(1): 101-103 (1994)
- [j17]M. D. Atkinson, Robert Beals: Priority Queues and Permutations. SIAM J. Comput. 23(6): 1225-1230 (1994)
- 1993
- [j16]M. D. Atkinson, Murali Thiyagarajah: The Permutational Power of a Priority Queue. BIT 33(1): 2-6 (1993)
- [j15]M. D. Atkinson: Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. Comput. J. 36(6): 593-594 (1993)
- [j14]
- 1992
- [j13]M. D. Atkinson, Jörg-Rüdiger Sack: Generating Binary Trees at Random. Inf. Process. Lett. 41(1): 21-23 (1992)
- 1991
- [j12]
- 1990
- [j11]M. D. Atkinson, J. S. Heslop-Harrison: A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygons. Computer Applications in the Biosciences 6(1): 55-56 (1990)
- [j10]M. D. Atkinson, Alberto Negro, Nicola Santoro: Sums of lexicographically ordered sets. Discrete Mathematics 80(2): 115-122 (1990)
1980 – 1989
- 1988
- [j9]M. D. Atkinson, Nicola Santoro: A Practical Algorithm for Boolean Matrix Multiplication. Inf. Process. Lett. 29(1): 37-38 (1988)
- 1987
- [j8]M. D. Atkinson, H. W. Chang: Computing the Number of Mergings with Constraints. Inf. Process. Lett. 24(5): 289-292 (1987)
- [j7]
- 1986
- [j6]M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte: Min-Max Heaps and Generalized Priority Queues. Commun. ACM 29(10): 996-1000 (1986)
- [j5]M. D. Atkinson, R. A. Hassan: On the Computation of Group Characters. J. Symb. Comput. 2(1): 45-50 (1986)
- 1983
- [j4]M. D. Atkinson, S. Lloyd: The Ranks of m * n * (mn-2) Tensors. SIAM J. Comput. 12(4): 611-615 (1983)
- 1981
- [j3]
- 1980
- [j2]
1970 – 1979
- 1977
- [j1]M. D. Atkinson: The Complexity of Group Algebra Computations. Theor. Comput. Sci. 5(2): 205-209 (1977)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team