default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMike D. Atkinson
Person information
- affiliation: University of Otago, Dunedin, New Zealand
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j56]Michael H. Albert, M. D. Atkinson, Cheyne Homberger, Jay Pantone:
Deflatability of permutation classes. Australas. J Comb. 64: 252-276 (2016)- 2014
- [j55]Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Inflations of geometric grid classes: three case studies. Australas. J Comb. 58: 27-47 (2014) - 2012
- [j54]Michael H. Albert, Mike D. Atkinson, Robert Brignall:
The Enumeration of Three Pattern Classes using Monotone Grid Classes. Electron. J. Comb. 19(3): 20 (2012) - [j53]M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter
:
Counting s(3+1)-avoiding permutations. Eur. J. Comb. 33(1): 49-61 (2012) - [i3]Michael H. Albert, M. D. Atkinson:
Pattern classes and priority queues. CoRR abs/1202.1542 (2012) - 2011
- [j52]M. D. Atkinson, Nikola Ruskuc, Rebecca Smith:
Substitution-closed pattern classes. J. Comb. Theory A 118(2): 317-340 (2011) - 2010
- [j51]Robert E. L. Aldred, Mike D. Atkinson, D. J. McCaughan:
Avoiding consecutive patterns in permutations. Adv. Appl. Math. 45(3): 449-461 (2010) - [j50]Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West:
Growth Rates for Subclasses of Av(321). Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j49]Mike D. Atkinson, Hans P. van Ditmarsch, Sigrid Roehling:
Avoiding bias in cards cryptography. Australas. J Comb. 44: 3-18 (2009) - [j48]Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Counting 1324, 4231-Avoiding Permutations. Electron. J. Comb. 16(1) (2009) - 2007
- [j47]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Compositions of pattern restricted sets of permutations. Australas. J Comb. 37: 43-56 (2007) - [j46]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan, C. W. Monteith:
Cyclically closed pattern classes of permutations. Australas. J Comb. 38: 87-100 (2007) - [j45]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, Sigrid Roehling:
Avoiding bias in cards cryptography. CoRR abs/cs/0702097 (2007) - 2005
- [j44]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley:
Safe communication for card players by combinatorial designs for two-step protocols. Australas. J Comb. 33: 33-46 (2005) - [j43]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. Electron. J. Comb. 12 (2005) - [j42]Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc:
Pattern Avoidance Classes and Subpermutations. Electron. J. Comb. 12 (2005) - [j41]Michael H. Albert, Mike D. Atkinson:
Simple permutations and pattern restricted permutations. Discret. Math. 300(1-3): 1-15 (2005) - [j40]Mike D. Atkinson:
Some equinumerous pattern-avoiding classes of permutations. Discret. Math. Theor. Comput. Sci. 7(1): 71-74 (2005) - [j39]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) - [e2]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. CRPIT 41, Australian Computer Society 2005, ISBN 1-920682-23-6 [contents] - 2004
- [j38]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. Discret. Math. 287(1-3): 129-133 (2004) - [c3]Mike D. Atkinson:
Foreword. CATS 2004: 1-2 - [e1]Mike D. Atkinson:
Proceedings of Computing: The Australasian Theory Symposium, CATS 2004, Dunedin, New Zealand, January 19-20, 2004. Electronic Notes in Theoretical Computer Science 91, Elsevier 2004 [contents] - 2003
- [j37]Michael H. Albert, Robert E. L. Aldred, Michael D. Atkinson, Hans P. van Ditmarsch, B. D. Handley, Chris C. Handley, Jaroslav Opatrny:
Longest subsequences in permutations. Australas. J Comb. 28: 225-238 (2003) - [j36]Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc:
Regular closed sets of permutations. Theor. Comput. Sci. 306(1-3): 85-100 (2003) - 2002
- [j35]Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist:
On Packing Densities of Permutations. Electron. J. Comb. 9(1) (2002) - [j34]Michael H. Albert, Mike D. Atkinson:
Sorting with a Forklift. Electron. J. Comb. 9(2) (2002) - [j33]Mike D. Atkinson, Timothy Stitt:
Restricted permutations and the wreath product. Discret. Math. 259(1-3): 19-36 (2002) - [j32]Mike D. Atkinson, Max Murphy, Nikola Ruskuc:
Partially Well-Ordered Closed Sets of Permutations. Order 19(2): 101-113 (2002) - [j31]Mike D. Atkinson, Max Murphy, Nikola Ruskuc:
Sorting with two ordered stacks in series. Theor. Comput. Sci. 289(1): 205-223 (2002) - [c2]Michael H. Albert, Mike D. Atkinson:
Sorting with a Forklift. SWAT 2002: 368-377 - [i1]Michael H. Albert, Mike D. Atkinson:
Sorting with a forklift. CoRR cs.DM/0209016 (2002) - 2001
- [j30]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
- [j29]M. D. Atkinson:
Restricted permutations. Discret. Math. 195(1-3): 27-38 (1999) - [j28]M. D. Atkinson, Jörg-Rüdiger Sack:
Pop-Stacks in Parallel. Inf. Process. Lett. 70(2): 63-67 (1999) - 1998
- [j27]M. D. Atkinson:
Permutations which are the Union of an Increasing and a Decreasing Subsequence. Electron. J. Comb. 5 (1998) - [j26]M. D. Atkinson:
Generalized Stack Permutations. Comb. Probab. Comput. 7(3): 239-246 (1998) - 1997
- [j25]M. D. Atkinson, Mike Livesey, D. Tulley:
Permutations Generated by Token Passing in Graphs. Theor. Comput. Sci. 178(1-2): 103-118 (1997) - [j24]M. D. Atkinson, D. Tulley:
Bounded Capacity Priority Queues. Theor. Comput. Sci. 182(1-2): 145-157 (1997) - 1995
- [j23]M. D. Atkinson, Stephen A. Linton, L. A. Walker:
Priority Queues and Multisets. Electron. J. Comb. 2 (1995) - 1994
- [j22]M. D. Atkinson, Jörg-Rüdiger Sack:
Uniform Generation of Forests of Restricted Height. Inf. Process. Lett. 50(6): 323-327 (1994) - [j21]M. D. Atkinson, Jörg-Rüdiger Sack:
Uniform Generation of Binary Trees in Parallel. J. Parallel Distributed Comput. 23(1): 101-103 (1994) - [j20]M. D. Atkinson, Robert Beals:
Priority Queues and Permutations. SIAM J. Comput. 23(6): 1225-1230 (1994) - 1993
- [j19]M. D. Atkinson, Murali Thiyagarajah:
The Permutational Power of a Priority Queue. BIT 33(1): 1-6 (1993) - [j18]M. D. Atkinson:
Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. Comput. J. 36(6): 593-594 (1993) - [j17]M. D. Atkinson, Louise Walker:
Enumerating k-Way Trees. Inf. Process. Lett. 48(2): 73-75 (1993) - 1992
- [j16]M. D. Atkinson, Jörg-Rüdiger Sack:
Generating Binary Trees at Random. Inf. Process. Lett. 41(1): 21-23 (1992) - 1991
- [j15]M. D. Atkinson:
The Recursive Structure of Some Ordering Problems. BIT 31(2): 194-201 (1991) - 1990
- [j14]M. D. Atkinson, J. S. Heslop-Harrison:
A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygons. Comput. Appl. Biosci. 6(1): 55-56 (1990) - [j13]M. D. Atkinson, Alberto Negro, Nicola Santoro:
Sums of lexicographically ordered sets. Discret. Math. 80(2): 115-122 (1990)
1980 – 1989
- 1988
- [j12]M. D. Atkinson, Nicola Santoro:
A Practical Algorithm for Boolean Matrix Multiplication. Inf. Process. Lett. 29(1): 37-38 (1988) - 1987
- [j11]M. D. Atkinson, H. W. Chang:
Computing the Number of Mergings with Constraints. Inf. Process. Lett. 24(5): 289-292 (1987) - [j10]M. D. Atkinson:
An Optimal Algorithm for Geometrical Congruence. J. Algorithms 8(2): 159-172 (1987) - 1986
- [j9]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) - [j8]M. D. Atkinson, R. A. Hassan:
On the Computation of Group Characters. J. Symb. Comput. 2(1): 45-50 (1986) - [j7]Mike D. Atkinson, Nicola Santoro, Jorge Urrutia:
On the integer complexity of Boolean matrix multiplication. SIGACT News 18(1): 53 (1986) - [j6]Michael D. Atkinson, Nicola Santoro, Jorge Urrutia:
Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters. IEEE Trans. Commun. 34(6): 614-617 (1986) - 1983
- [j5]M. D. Atkinson, S. Lloyd:
The Ranks of m * n * (mn-2) Tensors. SIAM J. Comput. 12(4): 611-615 (1983) - 1981
- [j4]Mike D. Atkinson:
Saving space in coset enumeration. SIGSAM Bull. 15(4): 12-14 (1981) - [j3]M. D. Atkinson:
The Cyclic Towers of Hanoi. Inf. Process. Lett. 13(3): 118-119 (1981) - 1980
- [j2]M. D. Atkinson:
Permutation Groups and Set Union Algorithms. Comput. J. 23(2): 187 (1980)
1970 – 1979
- 1977
- [j1]M. D. Atkinson:
The Complexity of Group Algebra Computations. Theor. Comput. Sci. 5(2): 205-209 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
