| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter |
Counting s(3+1)-avoiding permutations.  |
Eur. J. Comb.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. Albert, M. D. Atkinson |
Pattern classes and priority queues |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson, Nikola Ruskuc, Rebecca Smith |
Substitution-closed pattern classes. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West |
Growth Rates for Subclasses of Av(321). |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael H. Albert, M. D. Atkinson, Vincent Vatter |
Counting 1324, 4231-Avoiding Permutations. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson, Hans P. van Ditmarsch, S. Roehling |
Avoiding bias in cards cryptography |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. Albert, Mike D. Atkinson |
Simple permutations and pattern restricted permutations. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike D. Atkinson |
Some equinumerous pattern-avoiding classes of permutations. |
Discrete Mathematics & Theoretical Computer Science |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc |
Pattern Avoidance Classes and Subpermutations. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
CATS |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike D. Atkinson |
Foreword. |
Electr. Notes Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc |
Regular closed sets of permutations. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike D. Atkinson, Max Murphy, Nikola Ruskuc |
Sorting with two ordered stacks in series. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike D. Atkinson, Timothy Stitt |
Restricted permutations and the wreath product. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. Albert, Mike D. Atkinson |
Sorting with a Forklift. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist |
On Packing Densities of Permutations. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael H. Albert, Mike D. Atkinson |
Sorting with a forklift |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Mike D. Atkinson, Max Murphy, Nikola Ruskuc |
Partially Well-Ordered Closed Sets of Permutations. |
Order |
2002 |
DBLP DOI BibTeX RDF |
finite basis, partial well-order, pattern containment, permutation, involvement |
| 1 | Michael H. Albert, Mike D. Atkinson |
Sorting with a Forklift. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton |
Algorithms for Pattern Involvement in Permutations. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Jörg-Rüdiger Sack |
Pop-Stacks in Parallel. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
Restricted permutations. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
Permutations which are the Union of an Increasing and a Decreasing Subsequence. |
Electr. J. Comb. |
1998 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson |
Generalized Stack Permutations. |
Combinatorics, Probability & Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson, D. Tulley |
Bounded Capacity Priority Queues. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Mike Livesey, D. Tulley |
Permutations Generated by Token Passing in Graphs. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, S. A. Linton, L. A. Walker |
Priority Queues and Multisets. |
Electr. J. Comb. |
1995 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson, Jörg-Rüdiger Sack |
Uniform Generation of Forests of Restricted Height. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Jörg-Rüdiger Sack |
Uniform Generation of Binary Trees in Parallel. |
J. Parallel Distrib. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Robert Beals |
Priority Queues and Permutations. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Louise Walker |
Enumerating k-Way Trees. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. |
Comput. J. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Murali Thiyagarajah |
The Permutational Power of a Priority Queue. |
BIT |
1993 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson, Jörg-Rüdiger Sack |
Generating Binary Trees at Random. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
The Recursive Structure of Some Ordering Problems. |
BIT |
1991 |
DBLP BibTeX RDF |
|
| 1 | M. D. Atkinson, Alberto Negro, Nicola Santoro |
Sums of lexicographically ordered sets. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Nicola Santoro |
A Practical Algorithm for Boolean Matrix Multiplication. |
Inf. Process. Lett. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, H. W. Chang |
Computing the Number of Mergings with Constraints. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
An Optimal Algorithm for Geometrical Congruence. |
J. Algorithms |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, R. A. Hassan |
On the Computation of Group Characters. |
J. Symb. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte |
Min-Max Heaps and Generalized Priority Queues. |
Commun. ACM |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson, S. Lloyd |
The Ranks of m * n * (mn-2) Tensors. |
SIAM J. Comput. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
The Cyclic Towers of Hanoi. |
Inf. Process. Lett. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
Permutation Groups and Set Union Algorithms. |
Comput. J. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | M. D. Atkinson |
The Complexity of Group Algebra Computations. |
Theor. Comput. Sci. |
1977 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")