M. D. Atkinson

List of publications from the DBLP Bibliography Server - FAQAsk others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2007 | ||
---|---|---|

45 | M. D. Atkinson, Hans P. van Ditmarsch, S. Roehling: Avoiding bias in cards cryptography CoRR abs/cs/0702097: (2007) | |

44 | 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 | ||

43 | 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 | |

42 | Michael H. Albert, Mike D. Atkinson: Simple permutations and pattern restricted permutations. Discrete Mathematics 300(1-3): 1-15 (2005) | |

41 | Mike D. Atkinson: Some equinumerous pattern-avoiding classes of permutations. Discrete Mathematics & Theoretical Computer Science 7(1): 71-74 (2005) | |

40 | Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc: Pattern Avoidance Classes and Subpermutations. Electr. J. Comb. 12: (2005) | |

39 | 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) | |

38 | 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 | ||

37 | 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) | |

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) |

1 | Michael H. Albert | [27] [28] [31] [32] [34] [35] [36] [37] [39] [42] [44] |

2 | Robert E. L. Aldred | [27] [28] [37] [38] [39] |

3 | Robert Beals | [17] |

4 | H. W. Chang | [8] |

5 | Frank K. H. A. Dehne | [43] |

6 | Hans P. van Ditmarsch | [37] [38] [39] [45] |

7 | Chris C. Handley | [27] [32] [37] [38] [39] |

8 | R. A. Hassan | [5] |

9 | J. S. Heslop-Harrison | [11] |

10 | Derek A. Holton | [27] [28] [32] [37] [38] [39] |

11 | S. A. Linton | [20] |

12 | Mike Livesey | [22] |

13 | S. Lloyd | [4] |

14 | D. J. McCaughan | [38] [39] |

15 | Maximillian M. Murphy (Max Murphy) | [29] [30] [40] |

16 | Alberto Negro | [10] |

17 | Doron Nussbaum | [44] |

18 | S. Roehling | [45] |

19 | Nikola Ruskuc | [29] [30] [36] [40] |

20 | Jörg-Rüdiger Sack | [6] [13] [18] [19] [25] [44] |

21 | Nicola Santoro | [6] [9] [10] [44] |

22 | Timothy Stitt | [33] |

23 | Walter Stromquist | [32] |

24 | Thomas Strothotte | [6] |

25 | Murali Thiyagarajah | [16] |

26 | D. Tulley | [21] [22] |

27 | L. A. Walker | [20] |

28 | Louise Walker | [14] |