Mike D. Atkinson

Vincent Vatter

Australas. J Comb., 2014

2012

Counting s(3+1)-avoiding permutations.

[BibT_eX]

[DOI]

Bruce E. Sagan

Vincent R. Vatter

Eur. J. Comb., 2012

Pattern classes and priority queues

[BibT_eX]

[DOI]

CoRR, 2012

The Enumeration of Three Pattern Classes using Monotone Grid Classes.

[BibT_eX]

[DOI]

Robert Brignall

Electron. J. Comb., 2012

2011

Substitution-closed pattern classes.

[BibT_eX]

[DOI]

Rebecca Smith

J. Comb. Theory, Ser. A, 2011

2010

Growth Rates for Subclasses of Av(321).

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Avoiding consecutive patterns in permutations.

[BibT_eX]

[DOI]

D. J. McCaughan

Adv. Appl. Math., 2010

2009

Counting 1324, 4231-Avoiding Permutations.

[BibT_eX]

[DOI]

Vincent Vatter

Electron. J. Comb., 2009

Avoiding bias in cards cryptography.

[BibT_eX]

[DOI]

Sigrid Roehling

Australas. J Comb., 2009

2007

On the longest increasing subsequence of a circular list.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Cyclically closed pattern classes of permutations.

[BibT_eX]

[DOI]

Australas. J Comb., 2007

Compositions of pattern restricted sets of permutations.

[BibT_eX]

[DOI]

Derek A. Holton

D. J. McCaughan

Australas. J Comb., 2007

2005

Permuting machines and priority queues.

[BibT_eX]

[DOI]

Derek A. Holton

D. J. McCaughan

Theor. Comput. Sci., 2005

Some equinumerous pattern-avoiding classes of permutations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2005

Simple permutations and pattern restricted permutations.

[BibT_eX]

[DOI]

Discret. Math., 2005

Pattern Avoidance Classes and Subpermutations.

[BibT_eX]

[DOI]

Maximillian M. Murphy

Electron. J. Comb., 2005

Sorting Classes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

Safe communication for card players by combinatorial designs for two-step protocols.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

2004

Foreword.

[BibT_eX]

[DOI]

Proceedings of Computing: The Australasian Theory Symposium, 2004

Restricted permutations and queue jumping.

[BibT_eX]

[DOI]

Derek A. Holton

Discret. Math., 2004

2003

Regular closed sets of permutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Longest subsequences in permutations.

[BibT_eX]

[DOI]

Michael D. Atkinson

B. D. Handley

Jaroslav Opatrny

Australas. J Comb., 2003

2002

Sorting with two ordered stacks in series.

[BibT_eX]

[DOI]

Max Murphy

Theor. Comput. Sci., 2002

Partially Well-Ordered Closed Sets of Permutations.

[BibT_eX]

[DOI]

Max Murphy

Order, 2002

Restricted permutations and the wreath product.

[BibT_eX]

[DOI]

Timothy Stitt

Discret. Math., 2002

On Packing Densities of Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

Sorting with a Forklift.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

Permutations of a Multiset Avoiding Permutations of Length 3.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

Algorithms for Pattern Involvement in Permutations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1999

Pop-Stacks in Parallel.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Restricted permutations.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Generalized Stack Permutations.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Permutations which are the Union of an Increasing and a Decreasing Subsequence.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

1997

Bounded Capacity Priority Queues.

[BibT_eX]

[DOI]

D. Tulley

Theor. Comput. Sci., 1997

Permutations Generated by Token Passing in Graphs.

[BibT_eX]

[DOI]

Mike Livesey

D. Tulley

Theor. Comput. Sci., 1997

1995

Priority Queues and Multisets.

[BibT_eX]

[DOI]

Stephen A. Linton

L. A. Walker

Electron. J. Comb., 1995

1994

Priority Queues and Permutations.

[BibT_eX]

[DOI]

Robert Beals

SIAM J. Comput., 1994

Uniform Generation of Binary Trees in Parallel.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Uniform Generation of Forests of Restricted Height.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

1993

Enumerating k-Way Trees.

[BibT_eX]

[DOI]

Louise Walker

Inf. Process. Lett., 1993

Uniform Generation of Rooted Ordered Trees with Prescribed Degrees.

[BibT_eX]

[DOI]

Comput. J., 1993

The Permutational Power of a Priority Queue.

[BibT_eX]

[DOI]

Murali Thiyagarajah

BIT, 1993

1992

Generating Binary Trees at Random.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

The Recursive Structure of Some Ordering Problems.

[BibT_eX]

[DOI]

BIT, 1991

1990

Sums of lexicographically ordered sets.

[BibT_eX]

[DOI]

Alberto Negro

Discret. Math., 1990

A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygons.

[BibT_eX]

[DOI]

J. S. Heslop-Harrison

Comput. Appl. Biosci., 1990

1988

A Practical Algorithm for Boolean Matrix Multiplication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

1987

An Optimal Algorithm for Geometrical Congruence.

[BibT_eX]

[DOI]

J. Algorithms, 1987

Computing the Number of Mergings with Constraints.

[BibT_eX]

[DOI]

H. W. Chang

Inf. Process. Lett., 1987

1986

Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters.

[BibT_eX]

[DOI]

Michael D. Atkinson

Jorge Urrutia

IEEE Trans. Commun., 1986

On the integer complexity of Boolean matrix multiplication.

[BibT_eX]

[DOI]

Jorge Urrutia

SIGACT News, 1986

On the Computation of Group Characters.

[BibT_eX]

[DOI]

R. A. Hassan

J. Symb. Comput., 1986

Min-Max Heaps and Generalized Priority Queues.

[BibT_eX]

[DOI]

Commun. ACM, 1986

1983

The Ranks of m * n * (mn-2) Tensors.

[BibT_eX]

[DOI]

S. Lloyd

SIAM J. Comput., 1983

1981

The Cyclic Towers of Hanoi.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Saving space in coset enumeration.

[BibT_eX]

[DOI]

SIGSAM Bull., 1981

1980

Permutation Groups and Set Union Algorithms.

[BibT_eX]

[DOI]

Comput. J., 1980

1977

The Complexity of Group Algebra Computations.

[BibT_eX]

[DOI]