The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mike D. Atkinson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton
    Algorithms for Pattern Involvement in Permutations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:355-366 [Conf]
  2. Michael H. Albert, Mike D. Atkinson
    Sorting with a Forklift. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:368-377 [Conf]
  3. Michael H. Albert, Mike D. Atkinson
    Sorting with a Forklift. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  4. Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist
    On Packing Densities of Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  5. Michael H. Albert, Mike D. Atkinson
    Sorting with a forklift [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  6. Michael H. Albert, Mike D. Atkinson
    Simple permutations and pattern restricted permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:1-15 [Journal]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:129-133 [Journal]
  8. Mike D. Atkinson, Timothy Stitt
    Restricted permutations and the wreath product. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:19-36 [Journal]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:8, pp:1021-1031 [Journal]
  10. Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
    On the longest increasing subsequence of a circular list. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:2, pp:55-59 [Journal]
  11. Mike D. Atkinson, Max Murphy, Nikola Ruskuc
    Partially Well-Ordered Closed Sets of Permutations. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:2, pp:101-113 [Journal]
  12. Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc
    Regular closed sets of permutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:85-100 [Journal]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:309-317 [Journal]
  14. Mike D. Atkinson, Max Murphy, Nikola Ruskuc
    Sorting with two ordered stacks in series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:205-223 [Journal]
  15. Mike D. Atkinson
    Some equinumerous pattern-avoiding classes of permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:71-74 [Journal]

  16. Pattern Avoidance Classes and Subpermutations. [Citation Graph (, )][DBLP]


  17. Sorting Classes. [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002