default search action
Michael H. Albert
Person information
- affiliation: University of Otago, Dunedin, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j52]Michael H. Albert, Vincent Vatter
:
How Many Pop-Stacks Does It Take To Sort A Permutation? Comput. J. 65(10): 2610-2614 (2022) - 2020
- [j51]Michael H. Albert, Mathilde Bouvel, Valentin Féray
Two first-order logics of permutations. J. Comb. Theory A 171 (2020)
2010 – 2019
- 2019
- [j50]Michael H. Albert, Robert Brignall
Rationality for subclasses of 321-avoiding permutations. Eur. J. Comb. 78: 44-72 (2019) - 2018
- [j49]Michael H. Albert, Michael Engen, Jay Pantone
Universal Layered Permutations. Electron. J. Comb. 25(3): 3 (2018) - [j48]Michael H. Albert, Aistis Atminas, Robert Brignall
Characterising inflations of monotone grid classes of permutations. J. Comb. Theory A 154: 444-463 (2018) - [j47]Michael H. Albert, Cheyne Homberger
Generating permutations with restricted containers. J. Comb. Theory A 157: 205-232 (2018) - [i6]Lech Szymanski, Brendan McCane, Michael H. Albert:
The effect of the choice of neural network depth and breadth on the size of its hypothesis space. CoRR abs/1806.02460 (2018) - 2016
- [j46]Michael H. Albert, M. D. Atkinson, Cheyne Homberger, Jay Pantone:
Deflatability of permutation classes. Australas. J Comb. 64: 252-276 (2016) - [j45]Michael H. Albert, Robert Brignall:
2×2 monotone grid classes are finitely based. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j44]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [d1]Xiping Fu, Brendan McCane, Steven Mills, Michael H. Albert, Lech Szymanski:
SIFT10M. UCI Machine Learning Repository, 2016 - [i5]Xiping Fu, Brendan McCane, Steven Mills, Michael H. Albert, Lech Szymanski:
Auto-JacoBin: Auto-encoder Jacobian Binary Hashing. CoRR abs/1602.08127 (2016) - 2015
- [j43]Michael H. Albert, Cheyne Homberger, Jay Pantone
Equipopularity Classes in the Separable Permutations. Electron. J. Comb. 22(2): 2 (2015) - [j42]Michael H. Albert, Mathilde Bouvel:
A General Theory of Wilf-Equivalence for Catalan Structures. Electron. J. Comb. 22(4): 4 (2015) - [j41]Michael H. Albert, Mireille Bousquet-Mélou:
Permutations sortable by two stacks in parallel and quarter plane walks. Eur. J. Comb. 43: 131-164 (2015) - [c9]Andrew Trotman
Optimal Packing in Simple-Family Codecs. ICTIR 2015: 337-340 - [c8]Xiping Fu, Brendan McCane
How to select hashing bits? A direct measurement approach. IVCNZ 2015: 1-6 - [i4]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. CoRR abs/1510.06051 (2015) - 2014
- [j40]Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Inflations of geometric grid classes: three case studies. Australas. J Comb. 58: 27-47 (2014) - [j39]Michael H. Albert, Mathilde Bouvel:
Operators of Equivalent Sorting Power and Related Wilf-equivalences. Electron. J. Comb. 21(4): 4 (2014) - [j38]Michael H. Albert, Robert Brignall
Enumerating indices of Schubert varieties defined by inclusions. J. Comb. Theory A 123(1): 154-168 (2014) - [c7]Xiping Fu, Brendan McCane
NOKMeans: Non-Orthogonal K-means Hashing. ACCV (1) 2014: 162-177 - [c6]Yan Li, Haibo Zhang
Optimal link scheduling for delay-constrained periodic traffic over unreliable wireless links. INFOCOM 2014: 1465-1473 - [i3]Michael H. Albert, Mathilde Bouvel:
Operators of equivalent sorting power and related Wilf-equivalences. CoRR abs/1402.2034 (2014) - 2013
- [j37]Michael H. Albert, Vincent Vatter:
Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations. Electron. J. Comb. 20(2): 44 (2013) - [c5]Xiping Fu, Brendan McCane
Action recognition based on principal geodesic analysis. IVCNZ 2013: 259-264 - 2012
- [j36]Michael H. Albert:
Young classes of permutations. Australas. J Comb. 54: 49-58 (2012) - [j35]Michael H. Albert, Mike D. Atkinson, Robert Brignall:
The Enumeration of Three Pattern Classes using Monotone Grid Classes. Electron. J. Comb. 19(3): 20 (2012) - [j34]Michael Henry Albert, Richard J. Nowakowski
Lattices of Games. Order 29(1): 75-84 (2012) - [c4]Haibo Zhang
Combining TDMA with Slotted Aloha for delay constrained traffic over lossy links. ICARCV 2012: 701-706 - [i2]Michael H. Albert, M. D. Atkinson:
Pattern classes and priority queues. CoRR abs/1202.1542 (2012) - 2011
- [j33]Michael H. Albert, Steve Linton, Nikola Ruskuc
On convex permutations. Discret. Math. 311(8-9): 715-722 (2011) - [c3]Michael H. Albert, Andrés Cordón-Franco
Secure Communication of Local States in Interpreted Systems. DCAI 2011: 117-124 - 2010
- [j32]Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West:
Growth Rates for Subclasses of Av(321). Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j31]Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Counting 1324, 4231-Avoiding Permutations. Electron. J. Comb. 16(1) (2009) - [j30]Michael H. Albert, Steve Linton:
Growing at a Perfect Speed. Comb. Probab. Comput. 18(3): 301-308 (2009) - 2008
- [j29]Brendan McCane
Distance functions for categorical and mixed variables. Pattern Recognit. Lett. 29(7): 986-993 (2008) - 2007
- [j28]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Compositions of pattern restricted sets of permutations. Australas. J Comb. 37: 43-56 (2007) - [j27]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:
Cyclically closed pattern classes of permutations. Australas. J Comb. 38: 87-100 (2007) - [j26]Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack
On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2): 55-59 (2007) - [j25]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) - 2006
- [j24]Michael H. Albert, Murray Elder
On the Stanley-Wilf limit of 4231-avoiding permutations and a conjecture of Arratia. Adv. Appl. Math. 36(2): 96-105 (2006) - 2005
- [j23]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley:
Safe communication for card players by combinatorial designs for two-step protocols. Australas. J Comb. 33: 33-46 (2005) - [j22]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. Electron. J. Comb. 12 (2005) - [j21]Michael H. Albert, Steve Linton, Nikola Ruskuc:
The Insertion Encoding of Permutations. Electron. J. Comb. 12 (2005) - [j20]Michael H. Albert, Mike D. Atkinson:
Simple permutations and pattern restricted permutations. Discret. Math. 300(1-3): 1-15 (2005) - [j19]Michael H. Albert, M. S. Paterson:
Bounds for the growth rate of meander numbers. J. Comb. Theory A 112(2): 250-262 (2005) - 2004
- [j18]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. Discret. Math. 287(1-3): 129-133 (2004) - [j17]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
- [j16]Michael H. Albert, Robert E. L. Aldred, Michael D. Atkinson, Hans P. van Ditmarsch, B. D. Handley, Chris C. Handley, Jaroslav Opatrny:
Longest subsequences in permutations. Australas. J Comb. 28: 225-238 (2003) - [j15]Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc:
Regular closed sets of permutations. Theor. Comput. Sci. 306(1-3): 85-100 (2003) - 2002
- [j14]Michael H. Albert, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, Walter Stromquist:
On Packing Densities of Permutations. Electron. J. Comb. 9(1) (2002) - [j13]Michael H. Albert, Mike D. Atkinson:
Sorting with a Forklift. Electron. J. Comb. 9(2) (2002) - [c2]Michael H. Albert, Mike D. Atkinson:
Sorting with a Forklift. SWAT 2002: 368-377 - [i1]Michael H. Albert, Mike D. Atkinson:
Sorting with a forklift. CoRR cs.DM/0209016 (2002) - 2001
- [j12]Michael H. Albert, Robert E. L. Aldred, Derek A. Holton:
On 3*-connected graphs. Australas. J Comb. 24: 193-208 (2001) - [j11]Michael H. Albert, Richard J. Nowakowski:
The Game of End-Nim. Electron. J. Comb. 8(2) (2001) - [j10]Michael H. Albert, Derek A. Holton, Richard J. Nowakowski
The ultimate categorical matching in a graph. Discret. Math. 232(1-3): 1-9 (2001) - [j9]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) - [c1]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton:
Algorithms for Pattern Involvement in Permutations. ISAAC 2001: 355-366
1990 – 1999
- 1995
- [j8]Michael H. Albert, Alan M. Frieze, Bruce A. Reed:
Multicoloured Hamilton Cycles. Electron. J. Comb. 2 (1995) - 1991
- [j7]Michael H. Albert, Alan M. Frieze
Occupancy problems and random algebras. Discret. Math. 87(1): 1-8 (1991) - 1990
- [j6]Michael H. Albert, Rami P. Grossberg
Rich Models. J. Symb. Log. 55(3): 1292-1298 (1990)
1980 – 1989
- 1988
- [j5]Michael H. Albert, Stanley Burris:
Bounded Obstructions, Model Companions and Amalgamation Bases. Math. Log. Q. 34(2): 109-115 (1988) - 1987
- [j4]Michael H. Albert:
A Preservation Theorem for EC-Structures with Applications. J. Symb. Log. 52(3): 779-785 (1987) - [j3]Michael H. Albert, Ross Willard:
Injectives in Finitely Generated Universal Horn Classes. J. Symb. Log. 52(3): 786-792 (1987) - 1986
- [j2]Michael H. Albert, John Lawrence:
Test Sets for Finite Substitutions. Theor. Comput. Sci. 43: 117-122 (1986) - 1985
- [j1]Michael H. Albert, John Lawrence:
A Proof of Ehrenfeucht's Conjecture. Theor. Comput. Sci. 41: 121-123 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: