Michael H. Albert

According to our database1, Michael H. Albert authored at least 48 papers between 1985 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Generating permutations with restricted containers.
J. Comb. Theory, Ser. A, 2018

Characterising inflations of monotone grid classes of permutations.
J. Comb. Theory, Ser. A, 2018

Universal Layered Permutations.
Electr. J. Comb., 2018

2016
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations.
Discrete Mathematics & Theoretical Computer Science, 2016

2×2 monotone grid classes are finitely based.
Discrete Mathematics & Theoretical Computer Science, 2016

Deflatability of permutation classes.
Australasian J. Combinatorics, 2016

2015
Equipopularity Classes in the Separable Permutations.
Electr. J. Comb., 2015

A General Theory of Wilf-Equivalence for Catalan Structures.
Electr. J. Comb., 2015

2014
Enumerating indices of Schubert varieties defined by inclusions.
J. Comb. Theory, Ser. A, 2014

Operators of Equivalent Sorting Power and Related Wilf-equivalences.
Electr. J. Comb., 2014

Inflations of geometric grid classes: three case studies.
Australasian J. Combinatorics, 2014

2013
Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations.
Electr. J. Comb., 2013

2012
Lattices of Games.
Order, 2012

The Enumeration of Three Pattern Classes using Monotone Grid Classes.
Electr. J. Comb., 2012

Young classes of permutations.
Australasian J. Combinatorics, 2012

2011
On convex permutations.
Discrete Mathematics, 2011

Secure Communication of Local States in Interpreted Systems.
Proceedings of the International Symposium on Distributed Computing and Artificial Intelligence, 2011

2010
Growth Rates for Subclasses of Av(321).
Electr. J. Comb., 2010

2009
Growing at a Perfect Speed.
Combinatorics, Probability & Computing, 2009

Counting 1324, 4231-Avoiding Permutations.
Electr. J. Comb., 2009

2007
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation.
Random Struct. Algorithms, 2007

On the longest increasing subsequence of a circular list.
Inf. Process. Lett., 2007

Cyclically closed pattern classes of permutations.
Australasian J. Combinatorics, 2007

Compositions of pattern restricted sets of permutations.
Australasian J. Combinatorics, 2007

2005
Bounds for the growth rate of meander numbers.
J. Comb. Theory, Ser. A, 2005

Simple permutations and pattern restricted permutations.
Discrete Mathematics, 2005

The Insertion Encoding of Permutations.
Electr. J. Comb., 2005

Sorting Classes.
Electr. J. Comb., 2005

Safe communication for card players by combinatorial designs for two-step protocols.
Australasian J. Combinatorics, 2005

2004
Longest increasing subsequences in sliding windows.
Theor. Comput. Sci., 2004

Restricted permutations and queue jumping.
Discrete Mathematics, 2004

2003
Regular closed sets of permutations.
Theor. Comput. Sci., 2003

Longest subsequences in permutations.
Australasian J. Combinatorics, 2003

2002
On Packing Densities of Permutations.
Electr. J. Comb., 2002

Sorting with a Forklift.
Proceedings of the Algorithm Theory, 2002

2001
Permutations of a Multiset Avoiding Permutations of Length 3.
Eur. J. Comb., 2001

The ultimate categorical matching in a graph.
Discrete Mathematics, 2001

The Game of End-Nim.
Electr. J. Comb., 2001

On 3*-connected graphs.
Australasian J. Combinatorics, 2001

Algorithms for Pattern Involvement in Permutations.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1995
Multicoloured Hamilton Cycles.
Electr. J. Comb., 1995

1991
Occupancy problems and random algebras.
Discrete Mathematics, 1991

1990
Rich Models.
J. Symb. Log., 1990

1988
Bounded Obstructions, Model Companions and Amalgamation Bases.
Math. Log. Q., 1988

1987
Injectives in Finitely Generated Universal Horn Classes.
J. Symb. Log., 1987

A Preservation Theorem for EC-Structures with Applications.
J. Symb. Log., 1987

1986
Test Sets for Finite Substitutions.
Theor. Comput. Sci., 1986

1985
A Proof of Ehrenfeucht's Conjecture.
Theor. Comput. Sci., 1985


  Loading...