Publication:4474102
From MaRDI portal
zbMath1077.68720MaRDI QIDQ4474102
M. D. Atkinson, R. E. L. Aldred, Derek Holton, Michael Henry Albert
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230355.htm
68W40: Analysis of algorithms
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
Related Items
Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations, Unnamed Item, Four Shorts Stories on Surprising Algorithmic Uses of Treewidth, Unnamed Item, Order-preserving indexing, A fast algorithm for permutation pattern matching based on alternating runs, A linear time algorithm for consecutive permutation pattern matching, On the sub-permutations of pattern avoiding permutations, Algorithms for testing occurrences of length 4 patterns in permutations, On the least exponential growth admitting uncountably many closed permutation classes, Finding and counting permutations via CSPs, An algorithm for deciding the finiteness of the number of simple permutations in permutation classes