2009 |
25 | EE | Michael H. Albert,
Steve Linton:
Growing at a Perfect Speed.
Combinatorics, Probability & Computing 18(3): 301-308 (2009) |
2007 |
24 | EE | 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) |
23 | EE | Michael H. Albert:
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation.
Random Struct. Algorithms 31(2): 227-238 (2007) |
2005 |
22 | EE | Michael H. Albert,
Mike D. Atkinson:
Simple permutations and pattern restricted permutations.
Discrete Mathematics 300(1-3): 1-15 (2005) |
21 | EE | 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. 12: (2005) |
20 | EE | Michael H. Albert,
Steve Linton,
Nikola Ruskuc:
The Insertion Encoding of Permutations.
Electr. J. Comb. 12: (2005) |
19 | EE | Michael H. Albert,
M. S. Paterson:
Bounds for the growth rate of meander numbers.
J. Comb. Theory, Ser. A 112(2): 250-262 (2005) |
2004 |
18 | EE | 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 287(1-3): 129-133 (2004) |
17 | EE | Michael H. Albert,
Alexander Golynski,
Angèle M. Hamel,
Alejandro López-Ortiz,
S. Srinivasa Rao,
Mohammad Ali Safari:
Longest increasing subsequences in sliding windows.
Theor. Comput. Sci. 321(2-3): 405-414 (2004) |
2003 |
16 | EE | Michael H. Albert,
Mike D. Atkinson,
Nikola Ruskuc:
Regular closed sets of permutations.
Theor. Comput. Sci. 306(1-3): 85-100 (2003) |
2002 |
15 | EE | Michael H. Albert,
Mike D. Atkinson:
Sorting with a Forklift.
SWAT 2002: 368-377 |
14 | EE | Michael H. Albert,
Mike D. Atkinson:
Sorting with a forklift
CoRR cs.DM/0209016: (2002) |
13 | EE | Michael H. Albert,
Mike D. Atkinson,
Chris C. Handley,
Derek A. Holton,
Walter Stromquist:
On Packing Densities of Permutations.
Electr. J. Comb. 9(1): (2002) |
12 | EE | Michael H. Albert,
Mike D. Atkinson:
Sorting with a Forklift.
Electr. J. Comb. on(2): (2002) |
2001 |
11 | EE | Michael H. Albert,
Robert E. L. Aldred,
Mike D. Atkinson,
Derek A. Holton:
Algorithms for Pattern Involvement in Permutations.
ISAAC 2001: 355-366 |
10 | EE | Michael H. Albert,
Derek A. Holton,
Richard J. Nowakowski:
The ultimate categorical matching in a graph.
Discrete Mathematics 232(1-3): 1-9 (2001) |
9 | EE | Michael H. Albert,
Richard J. Nowakowski:
The Game of End-Nim.
Electr. J. Comb. 8(2): (2001) |
8 | EE | 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) |
1995 |
7 | EE | Michael H. Albert,
Alan M. Frieze,
Bruce A. Reed:
Multicoloured Hamilton Cycles.
Electr. J. Comb. 2: (1995) |
1991 |
6 | EE | Michael H. Albert,
Alan M. Frieze:
Occupancy problems and random algebras.
Discrete Mathematics 87(1): 1-8 (1991) |
1990 |
5 | | Michael H. Albert,
Rami P. Grossberg:
Rich Models.
J. Symb. Log. 55(3): 1292-1298 (1990) |
1987 |
4 | | Michael H. Albert:
A Preservation Theorem for EC-Structures with Applications.
J. Symb. Log. 52(3): 779-785 (1987) |
3 | | Michael H. Albert,
Ross Willard:
Injectives in Finitely Generated Universal Horn Classes.
J. Symb. Log. 52(3): 786-792 (1987) |
1986 |
2 | | Michael H. Albert,
J. Lawrence:
Test Sets for Finite Substitutions.
Theor. Comput. Sci. 43: 117-122 (1986) |
1985 |
1 | | Michael H. Albert,
J. Lawrence:
A Proof of Ehrenfeucht's Conjecture.
Theor. Comput. Sci. 41: 121-123 (1985) |