A Proof of Ehrenfeucht's Conjecture. - Michael H. Albert; John Lawrence (Theor. Comput. Sci., 1985)

Test Sets for Finite Substitutions. - Michael H. Albert; John Lawrence (Theor. Comput. Sci., 1986)

A Preservation Theorem for EC-Structures with Applications. - Michael H. Albert (J. Symb. Log., 1987)

Injectives in Finitely Generated Universal Horn Classes. - Michael H. Albert; Ross Willard (J. Symb. Log., 1987)

Bounded Obstructions, Model Companions and Amalgamation Bases. - Michael H. Albert; Stanley Burris (Math. Log. Q., 1988)

Rich Models. - Michael H. Albert; Rami P. Grossberg (J. Symb. Log., 1990)

Occupancy problems and random algebras. - Michael H. Albert; Alan M. Frieze (Discret. Math., 1991)

Multicoloured Hamilton Cycles. - Michael H. Albert; Alan M. Frieze; Bruce A. Reed (Electron. J. Comb., 1995)

Algorithms for Pattern Involvement in Permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Derek A. Holton (ISAAC, 2001)

On 3*-connected graphs. - Michael H. Albert; Robert E. L. Aldred; Derek A. Holton (Australas. J Comb., 2001)

The Game of End-Nim. - Michael H. Albert; Richard J. Nowakowski (Electron. J. Comb., 2001)

The ultimate categorical matching in a graph. - Michael H. Albert; Derek A. Holton; Richard J. Nowakowski (Discret. Math., 2001)

Permutations of a Multiset Avoiding Permutations of Length 3. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Chris C. Handley; Derek A. Holton (Eur. J. Comb., 2001)

Sorting with a Forklift. - Michael H. Albert; Mike D. Atkinson (Electron. J. Comb., 2002)

On Packing Densities of Permutations. - Michael H. Albert; Mike D. Atkinson; Chris C. Handley; Derek A. Holton; Walter Stromquist (Electron. J. Comb., 2002)

Longest subsequences in permutations. - Michael H. Albert; Robert E. L. Aldred; Michael D. Atkinson; Hans P. van Ditmarsch; B. D. Handley; Chris C. Handley; Jaroslav Opatrny (Australas. J Comb., 2003)

Regular closed sets of permutations. - Michael H. Albert; Mike D. Atkinson; Nikola Ruskuc (Theor. Comput. Sci., 2003)

Restricted permutations and queue jumping. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton (Discret. Math., 2004)

Longest increasing subsequences in sliding windows. - Michael H. Albert; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; S. Srinivasa Rao 001; Mohammad Ali Safari (Theor. Comput. Sci., 2004)

Safe communication for card players by combinatorial designs for two-step protocols. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley (Australas. J Comb., 2005)

Sorting Classes. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Chris C. Handley; Derek A. Holton; D. J. McCaughan; Hans P. van Ditmarsch (Electron. J. Comb., 2005)

The Insertion Encoding of Permutations. - Michael H. Albert; Steve Linton; Nikola Ruskuc (Electron. J. Comb., 2005)

Simple permutations and pattern restricted permutations. - Michael H. Albert; Mike D. Atkinson (Discret. Math., 2005)

Bounds for the growth rate of meander numbers. - Michael H. Albert; M. S. Paterson (J. Comb. Theory A, 2005)

On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia. - Michael H. Albert; Murray Elder; Andrew Rechnitzer; P. Westcott; Mike Zabrocki (Adv. Appl. Math., 2006)

Compositions of pattern restricted sets of permutations. - Michael H. Albert; Robert E. L. Aldred; Mike D. Atkinson; Hans P. van Ditmarsch; Chris C. Handley; Derek A. Holton; D. J. McCaughan (Australas. J Comb., 2007)

Cyclically closed pattern classes of permutations. - 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 (Australas. J Comb., 2007)

On the longest increasing subsequence of a circular list. - Michael H. Albert; Mike D. Atkinson; Doron Nussbaum; Jörg-Rüdiger Sack; Nicola Santoro (Inf. Process. Lett., 2007)

On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation. - Michael H. Albert (Random Struct. Algorithms, 2007)

Distance functions for categorical and mixed variables. - Brendan McCane; Michael H. Albert (Pattern Recognit. Lett., 2008)

Counting 1324, 4231-Avoiding Permutations. - Michael H. Albert; M. D. Atkinson; Vincent Vatter (Electron. J. Comb., 2009)

Growing at a Perfect Speed. - Michael H. Albert; Steve Linton (Comb. Probab. Comput., 2009)

Growth Rates for Subclasses of Av(321). - Michael H. Albert; M. D. Atkinson; Robert Brignall; Nikola Ruskuc; Rebecca Smith 001; J. West (Electron. J. Comb., 2010)

Secure Communication of Local States in Interpreted Systems. - Michael H. Albert; Andrés Cordón-Franco; Hans van Ditmarsch; David Fernández-Duque; Joost J. Joosten; Fernando Soler-Toscano (DCAI, 2011)

On convex permutations. - Michael H. Albert; Steve Linton; Nikola Ruskuc; Vincent Vatter; Steve Waton (Discret. Math., 2011)

Combining TDMA with Slotted Aloha for delay constrained traffic over lossy links. - Haibo Zhang 001; Michael H. Albert; Andreas Willig (ICARCV, 2012)

Young classes of permutations. - Michael H. Albert (Australas. J Comb., 2012)

The Enumeration of Three Pattern Classes using Monotone Grid Classes. - Michael H. Albert; Mike D. Atkinson; Robert Brignall (Electron. J. Comb., 2012)

Pattern classes and priority queues - Michael H. Albert; M. D. Atkinson (CoRR, 2012)

Lattices of Games. - Michael Henry Albert; Richard J. Nowakowski (Order, 2012)

Action recognition based on principal geodesic analysis. - Xiping Fu; Brendan McCane; Michael H. Albert; Steven Mills (IVCNZ, 2013)

Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations. - Michael H. Albert; Vincent Vatter (Electron. J. Comb., 2013)

NOKMeans: Non-Orthogonal K-means Hashing. - Xiping Fu; Brendan McCane; Steven Mills; Michael H. Albert (ACCV (1), 2014)

Optimal link scheduling for delay-constrained periodic traffic over unreliable wireless links. - Yan Li; Haibo Zhang 001; Zhiyi Huang 001; Michael H. Albert (INFOCOM, 2014)

Inflations of geometric grid classes: three case studies. - Michael H. Albert; M. D. Atkinson; Vincent Vatter (Australas. J Comb., 2014)

Operators of Equivalent Sorting Power and Related Wilf-equivalences. - Michael H. Albert; Mathilde Bouvel (Electron. J. Comb., 2014)

Enumerating indices of Schubert varieties defined by inclusions. - Michael H. Albert; Robert Brignall (J. Comb. Theory A, 2014)

Optimal Packing in Simple-Family Codecs. - Andrew Trotman; Michael H. Albert; Blake Burgess (ICTIR, 2015)

How to select hashing bits? A direct measurement approach. - Xiping Fu; Brendan McCane; Steven Mills; Michael H. Albert (IVCNZ, 2015)

A General Theory of Wilf-Equivalence for Catalan Structures. - Michael H. Albert; Mathilde Bouvel (Electron. J. Comb., 2015)

Equipopularity Classes in the Separable Permutations. - Michael H. Albert; Cheyne Homberger; Jay Pantone (Electron. J. Comb., 2015)

Permutations sortable by two stacks in parallel and quarter plane walks. - Michael H. Albert; Mireille Bousquet-Mélou (Eur. J. Comb., 2015)

Deflatability of permutation classes. - Michael H. Albert; M. D. Atkinson; Cheyne Homberger; Jay Pantone (Australas. J Comb., 2016)

Unsplittable Classes of Separable Permutations. - Michael Albert 001; Vít Jelínek (Electron. J. Comb., 2016)

Auto-JacoBin: Auto-encoder Jacobian Binary Hashing. - Xiping Fu; Brendan McCane; Steven Mills; Michael H. Albert; Lech Szymanski (CoRR, 2016)

Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071). - Michael Albert 001; Miklós Bóna; István Miklós; Einar Steingrímsson (Dagstuhl Reports, 2016)

2×2 monotone grid classes are finitely based. - Michael H. Albert; Robert Brignall (Discret. Math. Theor. Comput. Sci., 2016)

The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. - Michael H. Albert; Marie-Louise Lackner; Martin Lackner; Vincent Vatter (Discret. Math. Theor. Comput. Sci., 2016)

SIFT10M. - Xiping Fu; Brendan McCane; Steven Mills; Michael H. Albert; Lech Szymanski (UCI Machine Learning Repository, 2016)

Permutations in Binary Trees and Split Trees. - Michael Albert 001; Cecilia Holmgren; Tony Johansson; Fiona Skerman (AofA, 2018)

Universal Layered Permutations. - Michael H. Albert; Michael Engen; Jay Pantone; Vincent Vatter (Electron. J. Comb., 2018)

The effect of the choice of neural network depth and breadth on the size of its hypothesis space. - Lech Szymanski; Brendan McCane; Michael H. Albert (CoRR, 2018)

Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451). - Michael Albert 001; David I. Bevan; Miklós Bóna; István Miklós (Dagstuhl Reports, 2018)

Characterising inflations of monotone grid classes of permutations. - Michael H. Albert; Aistis Atminas; Robert Brignall (J. Comb. Theory A, 2018)

Generating permutations with restricted containers. - Michael H. Albert; Cheyne Homberger; Jay Pantone; Nathaniel Shar; Vincent Vatter (J. Comb. Theory A, 2018)

Wilf-collapse in permutation classes having two basis elements of size three. - Michael Albert 001; Jinge Li (Australas. J Comb., 2019)

Uniquely-Wilf classes. - Michael Albert 001; Jinge Li (Discret. Math. Theor. Comput. Sci., 2019)

Prolific Compositions. - Murray Tannock; Michael Albert 001 (Discret. Math. Theor. Comput. Sci., 2019)

Rationality for subclasses of 321-avoiding permutations. - Michael H. Albert; Robert Brignall; Nik Ruskuc; Vincent Vatter (Eur. J. Comb., 2019)

Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. - Michael Albert 001; Cecilia Holmgren; Tony Johansson; Fiona Skerman (Algorithmica, 2020)

Two first-order logics of permutations. - Michael H. Albert; Mathilde Bouvel; Valentin Féray (J. Comb. Theory A, 2020)

Prolific Permutations. - Michael Albert 001; Murray Tannock (Electron. J. Comb., 2021)

Two examples of Wilf-collapse. - Michael Albert 001; Vít Jelínek; Michal Opler (Discret. Math. Theor. Comput. Sci., 2021)

How Many Pop-Stacks Does It Take To Sort A Permutation? - Michael H. Albert; Vincent Vatter (Comput. J., 2022)

A logical limit law for 231-avoiding permutations. - Michael Albert 001; Mathilde Bouvel; Valentin Féray; Marc Noy (Discret. Math. Theor. Comput. Sci., 2023)