Michael H. Albert

Michael H. Albert's AcademicInfluence.com Rankings

Michael H. Albert

Mathematics

#2166

World Rank

#3385

Historical Rank

Measure Theory

#4054

World Rank

#4778

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Michael H. Albert Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michael Henry Albert is a mathematician and computer scientist, originally from Canada, and currently a professor in the computer science department at the University of Otago in Dunedin, New Zealand. His varied research interests include combinatorics and combinatorial game theory.

(See a Problem?)

Michael H. Albert's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Simple permutations and pattern restricted permutations (2005) (181)
Lessons in Play: An Introduction to Combinatorial Game Theory (2007) (178)
A Proof of Ehrenfeucht's Conjecture (1985) (94)
Multicoloured Hamilton Cycles (1995) (89)
The enumeration of simple permutations. (2003) (88)
Geometric grid classes of permutations (2011) (78)
Games of No Chance 3: Surveys (1998) (71)
The closure of a class of colimits (1988) (69)
The Insertion Encoding of Permutations (2005) (62)
On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia (2005) (53)
Algorithms for Pattern Involvement in Permutations (2001) (52)
On Packing Densities of Permutations (2002) (49)
On 3*-connected graphs (2001) (45)
Regular closed sets of permutations (2003) (40)
Inflations of geometric grid classes of permutations (2012) (39)
Random graph orders (1989) (38)
The Game of End-Nim (2001) (35)
Longest increasing subsequences in sliding windows (2004) (34)
An introduction to clobber. (2005) (34)
Safe communication for card players by combinatorial designs for two-step protocols (2005) (33)
Functions with bounded nth differences (1983) (32)
Permutations of a Multiset Avoiding Permutations of Length 3 (2001) (32)
Generating permutations with restricted containers (2015) (31)
Subclasses of the separable permutations (2010) (29)
Optimal link scheduling for delay-constrained periodic traffic over unreliable wireless links (2014) (26)
Finite axiomatizations for existentially closed posets and semilattices (1986) (24)
Growing at a Perfect Speed (2009) (23)
Permutations Generated by Stacks and Deques (2010) (22)
On the longest increasing subsequence of a circular list (2007) (21)
The enumeration of permutations avoiding 2143 and 4231 (2011) (20)
Growth Rates for Subclasses of Av(321) (2009) (20)
Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations (2013) (18)
Permutation Classes of Polynomial Growth (2006) (18)
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations (2015) (18)
Permutations sortable by two stacks in parallel and quarter plane walks (2013) (17)
Compositions of pattern restricted sets of permutations (2007) (17)
On the inverse image of pattern classes under bubble sort (2010) (17)
Two first-order logics of permutations (2018) (16)
Inflations of geometric grid classes: three case studies (2012) (16)
Equipopularity Classes in the Separable Permutations (2014) (16)
The Enumeration of Three Pattern Classes using Monotone Grid Classes (2012) (16)
Bounds for the growth rate of meander numbers (2005) (15)
Bounded Solutions of a Functional Inequality (1982) (15)
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation (2005) (13)
Enumerating indices of Schubert varieties defined by inclusions (2013) (13)
On convex permutations (2011) (13)
Longest subsequences in permutations (2003) (12)
Unification in Varieties of Groups: Nilpotent Varieties (1994) (12)
A General Theory of Wilf-Equivalence for Catalan Structures (2014) (12)
Secure Communication of Local States in Interpreted Systems (2011) (11)
Combining TDMA with Slotted Aloha for delay constrained traffic over lossy links (2012) (10)
On the growth of merges and staircases of permutation classes (2016) (9)
Rationality for subclasses of 321-avoiding permutations (2016) (9)
Counting 1324, 4231-Avoiding Permutations (2009) (9)
Permutations Containing Many Patterns (2006) (9)
How Many Pop-Stacks Does It Take To Sort A Permutation? (2020) (9)
The descending chain condition on solution sets for systems of equations in groups (1986) (9)
The Rationals have an AZ‐Enumeration (1999) (8)
Rich models (1990) (8)
Sorting Classes (2005) (8)
Lattices of Games (2012) (7)
Restricted permutations and queue jumping (2002) (7)
Measures on the Random Graph (1994) (6)
Sorting with a Forklift (2002) (6)
Assessing landmark influence on shape variation (2003) (6)
Large infinite antichains of permutations (2012) (5)
Universal cycles for permutation classes (2009) (5)
Test Sets for Finite Substitutions (1986) (5)
2×2 Monotone Grid Classes Are Finitely Based (2015) (5)
A Practical Algorithm for Reducing Non- deterministic Finite State Automata (2004) (4)
Bounded Obstructions, Model Companions and Amalgamation Bases (1988) (4)
Unsplittable Classes of Separable Permutations (2016) (3)
Isomorphisms between pattern classes (2013) (3)
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees (2019) (3)
Monotonic sequence games (2006) (3)
Permutation Patterns: On the permutational power of token passing networks (2010) (3)
Universal Layered Permutations (2017) (3)
The fine structure of 321 avoiding permutations (2002) (3)
Cyclically closed pattern classes of permutations (2007) (3)
Wilf-collapse in permutation classes having two basis elements of size three (2017) (3)
A preservation theorem for ec-structures with applications (1987) (3)
Operators of Equivalent Sorting Power and Related Wilf-equivalences (2014) (3)
Regular closed classes of permutations (2002) (3)
An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations (2016) (3)
Pattern classes and priority queues (2012) (3)
A sufficient condition for finite decidability (1996) (3)
Permutations in Binary Trees and Split Trees (2018) (2)
Deflatability of permutation classes (2014) (2)
Characterising inflations of monotone grid classes of permutations (2017) (2)
Category equivalence preserves unification type (1996) (2)
Impartial Games (2019) (2)
An introduction to structural methods in permutation patterns (2010) (2)
Injectives in finitely generated universal Horn classes (1987) (2)
Secure communication of local states in multi-agent systems (2010) (2)
Free groups and unification in $\mathfrak{U}_{m}\, \mathfrak{U}_{2}$ (1995) (2)
The ultimate categorical matching in a graph (2001) (2)
Occupancy problems and random algebras (1991) (2)
Optimal Packing in Simple-Family Codecs (2015) (2)
Prolific Compositions (2019) (1)
Convergence law for $231$-avoiding permutations (2022) (1)
Young classes of permutations (2010) (1)
Functions with boundednth differences (1981) (1)
Iteratively algebraic posets have the ACC (1984) (1)
The bubble sort operator (2010) (1)
Solving equations in free nilpotent groups (1991) (1)
Sorting with two stacks in parallel (2013) (1)
Wilf collapse in permutation classes (2019) (1)
Inflations of geometric grid classes of permutations (2014) (1)
’ s repository of research publications and other research outputs 22 monotone grid classes are finitely based Journal Item (2018) (0)
Elementary order varieties (1988) (0)
Fe b 20 06 MONOTONIC SEQUENCE GAMES (0)
The Algebra of Games (2019) (0)
The enumeration of three pattern classes (2012) (0)
Motivational Interlude: Sums of Games (2019) (0)
Values of Games (2019) (0)
A presentation of the free group on finitely many generators in the variety generated by Dm (1991) (0)
List of Participants (1999) (0)
Outcome Classes (2019) (0)
I NFLATIONS OF G EOMETRIC G RID C LASSES OF P ERMUTATIONS (2012) (0)
OUCS-2006-04 Monotonic Sequence Games (2006) (0)
The basis of 2 × 2 monotone grid classes (2015) (0)
OUCS-2010-03 Young classes of permutations (2010) (0)
TEsf S FOR INJECTIVITY IN i GENERATED UNIVERSAL HORN CLASSES (2005) (0)
UBCLASSES OF THE S EPARABLE P ERMUTATIONS (2011) (0)
Growth rates for subclasses of Av ( 321 ) Journal Item (2018) (0)
Proliﬁc Compositions (2019) (0)
C O ] 1 4 M ar 2 00 6 Permutation Classes of Polynomial Growth (2008) (0)
OUCS-2002-02 Integer root finding , a functional perspective (2002) (0)
Characterising when the simple permutations of a class are monotone griddable (2017) (0)
Trimming Game Trees (2019) (0)
The basis of $2\times 2$ monotone grid classes (2015) (0)
Tests for injectivity in finitely generated universal Horn classes (1990) (0)
Sorting classes – Extended Abstract (2004) (0)
Prolific Permutations (2021) (0)
Two examples of Wilf-collapse (2019) (0)
C O ] 4 D ec 2 01 7 Rationality For Subclasses of 321-Avoiding Permutations (2018) (0)
C O ] 1 J an 2 01 9 Rationality For Subclasses of 321-Avoiding Permutations (2019) (0)
All-Small Games (2019) (0)
Uniquely-Wilf classes (2019) (0)
Characterizing stability and superstability by unions of chains and saturated models (1989) (0)
ARGE I NFINITE A NTICHAINS OF P ERMUTATIONS (2012) (0)

This paper list is powered by the following services:

Other Resources About Michael H. Albert

en.wikipedia.org

What Schools Are Affiliated With Michael H. Albert?

Michael H. Albert is affiliated with the following schools: