Mike D. Atkinson

M. D. Atkinson

	2012
51		Michael H. Albert, M. D. Atkinson: Pattern classes and priority queues CoRR abs/1202.1542: (2012)
50		M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter: Counting s(3+1)-avoiding permutations. Eur. J. Comb. 33(1): 49-61 (2012)
	2011
49		M. D. Atkinson, Nikola Ruskuc, Rebecca Smith: Substitution-closed pattern classes. J. Comb. Theory, Ser. A 118(2): 317-340 (2011)
	2010
48		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)
	2009
47		Michael H. Albert, M. D. Atkinson, Vincent Vatter: Counting 1324, 4231-Avoiding Permutations. Electr. J. Comb. 16(1): (2009)
	2007
46		M. D. Atkinson, Hans P. van Ditmarsch, S. Roehling: Avoiding bias in cards cryptography CoRR abs/cs/0702097: (2007)
45		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)
	2005
44		Mike D. Atkinson, Frank K. H. A. Dehne: Theory of Computing 2005, Eleventh CATS 2005, Computing: The Australasian Theory Symposium, Newcastle, NSW, Australia, January/February 2005 Australian Computer Society 2005
43		Michael H. Albert, Mike D. Atkinson: Simple permutations and pattern restricted permutations. Discrete Mathematics 300(1-3): 1-15 (2005)
42		Mike D. Atkinson: Some equinumerous pattern-avoiding classes of permutations. Discrete Mathematics & Theoretical Computer Science 7(1): 71-74 (2005)
41		Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc: Pattern Avoidance Classes and Subpermutations. Electr. J. Comb. 12: (2005)
40		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)
39		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)
	2004
38		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)
37		Mike D. Atkinson: Foreword. Electr. Notes Theor. Comput. Sci. 91: 1-2 (2004)
	2003
36		Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc: Regular closed sets of permutations. Theor. Comput. Sci. 306(1-3): 85-100 (2003)
	2002
35		Michael H. Albert, Mike D. Atkinson: Sorting with a Forklift. SWAT 2002: 368-377
34		Michael H. Albert, Mike D. Atkinson: Sorting with a forklift CoRR cs.DM/0209016: (2002)
33		Mike D. Atkinson, Timothy Stitt: Restricted permutations and the wreath product. Discrete Mathematics 259(1-3): 19-36 (2002)
32		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)
31		Michael H. Albert, Mike D. Atkinson: Sorting with a Forklift. Electr. J. Comb. on(2): (2002)
30		Mike D. Atkinson, Max Murphy, Nikola Ruskuc: Partially Well-Ordered Closed Sets of Permutations. Order 19(2): 101-113 (2002)
29		Mike D. Atkinson, Max Murphy, Nikola Ruskuc: Sorting with two ordered stacks in series. Theor. Comput. Sci. 289(1): 205-223 (2002)
	2001
28		Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton: Algorithms for Pattern Involvement in Permutations. ISAAC 2001: 355-366
27		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)
	1999
26		M. D. Atkinson: Restricted permutations. Discrete Mathematics 195(1-3): 27-38 (1999)
25		M. D. Atkinson, Jörg-Rüdiger Sack: Pop-Stacks in Parallel. Inf. Process. Lett. 70(2): 63-67 (1999)
	1998
24		M. D. Atkinson: Generalized Stack Permutations. Combinatorics, Probability & Computing 7(3): 239-246 (1998)
23		M. D. Atkinson: Permutations which are the Union of an Increasing and a Decreasing Subsequence. Electr. J. Comb. 5: (1998)
	1997
22		M. D. Atkinson, Mike Livesey, D. Tulley: Permutations Generated by Token Passing in Graphs. Theor. Comput. Sci. 178(1-2): 103-118 (1997)
21		M. D. Atkinson, D. Tulley: Bounded Capacity Priority Queues. Theor. Comput. Sci. 182(1-2): 145-157 (1997)
	1995
20		M. D. Atkinson, S. A. Linton, L. A. Walker: Priority Queues and Multisets. Electr. J. Comb. 2: (1995)
	1994
19		M. D. Atkinson, Jörg-Rüdiger Sack: Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. 50(6): 323-327 (1994)
18		M. D. Atkinson, Jörg-Rüdiger Sack: Uniform Generation of Binary Trees in Parallel. J. Parallel Distrib. Comput. 23(1): 101-103 (1994)
17		M. D. Atkinson, Robert Beals: Priority Queues and Permutations. SIAM J. Comput. 23(6): 1225-1230 (1994)
	1993
16		M. D. Atkinson, Murali Thiyagarajah: The Permutational Power of a Priority Queue. BIT 33(1): 2-6 (1993)
15		M. D. Atkinson: Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. Comput. J. 36(6): 593-594 (1993)
14		M. D. Atkinson, Louise Walker: Enumerating k-Way Trees. Inf. Process. Lett. 48(2): 73-75 (1993)
	1992
13		M. D. Atkinson, Jörg-Rüdiger Sack: Generating Binary Trees at Random. Inf. Process. Lett. 41(1): 21-23 (1992)
	1991
12		M. D. Atkinson: The Recursive Structure of Some Ordering Problems. BIT 31(2): 194-201 (1991)
	1990
11		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)
10		M. D. Atkinson, Alberto Negro, Nicola Santoro: Sums of lexicographically ordered sets. Discrete Mathematics 80(2): 115-122 (1990)
	1988
9		M. D. Atkinson, Nicola Santoro: A Practical Algorithm for Boolean Matrix Multiplication. Inf. Process. Lett. 29(1): 37-38 (1988)
	1987
8		M. D. Atkinson, H. W. Chang: Computing the Number of Mergings with Constraints. Inf. Process. Lett. 24(5): 289-292 (1987)
7		M. D. Atkinson: An Optimal Algorithm for Geometrical Congruence. J. Algorithms 8(2): 159-172 (1987)
	1986
6		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)
5		M. D. Atkinson, R. A. Hassan: On the Computation of Group Characters. J. Symb. Comput. 2(1): 45-50 (1986)
	1983
4		M. D. Atkinson, S. Lloyd: The Ranks of m * n * (mn-2) Tensors. SIAM J. Comput. 12(4): 611-615 (1983)
	1981
3		M. D. Atkinson: The Cyclic Towers of Hanoi. Inf. Process. Lett. 13(3): 118-119 (1981)
	1980
2		M. D. Atkinson: Permutation Groups and Set Union Algorithms. Comput. J. 23(2): 187 (1980)
	1977
1		M. D. Atkinson: The Complexity of Group Algebra Computations. Theor. Comput. Sci. 5(2): 205-209 (1977)

Coauthor Index

1	Michael H. Albert (Michael Henry Albert)	[27] [28] [31] [32] [34] [35] [36] [38] [40] [43] [45] [47] [48] [51]
2	Robert E. L. Aldred	[27] [28] [38] [39] [40]
3	Robert Beals	[17]
4	Robert Brignall	[48]
5	H. W. Chang	[8]
6	Frank K. H. A. Dehne (Frank Dehne)	[44]
7	Hans P. van Ditmarsch	[38] [39] [40] [46]
8	Chris C. Handley	[27] [32] [38] [39] [40]
9	R. A. Hassan	[5]
10	J. S. Heslop-Harrison	[11]
11	Derek A. Holton	[27] [28] [32] [38] [39] [40]
12	S. A. Linton	[20]
13	Mike Livesey	[22]
14	S. Lloyd	[4]
15	D. J. McCaughan	[39] [40]
16	Maximillian M. Murphy (Max Murphy)	[29] [30] [41]
17	Alberto Negro	[10]
18	Doron Nussbaum	[45]
19	S. Roehling	[46]
20	Nikola Ruskuc	[29] [30] [36] [41] [48] [49]
21	Jörg-Rüdiger Sack	[6] [13] [18] [19] [25] [45]
22	Bruce E. Sagan	[50]
23	Nicola Santoro	[6] [9] [10] [45]
24	Rebecca Smith	[48] [49]
25	Timothy Stitt	[33]
26	Walter Stromquist	[32]
27	Thomas Strothotte	[6]
28	Murali Thiyagarajah	[16]
29	D. Tulley	[21] [22]
30	Vincent Vatter (Vincent R. Vatter)	[47] [50]
31	L. A. Walker	[20]
32	Louise Walker	[14]
33	J. West	[48]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page