Author:
Chroman Zachary,Kwan Matthew,Singhal Mihir
Funder
National Science Foundation
Swiss National Science Foundation
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation;Albert;Random Struct. Algorithms,2007
2. Asymptotically optimal induced universal graphs;Alon;Geom. Funct. Anal.,2017
3. The Probabilistic Method;Alon,2016
4. Adjacency labeling schemes and induced-universal graphs;Alstrup,2015
5. On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern;Arratia;Electron. J. Comb.,1999
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Universal arrays;Discrete Mathematics;2021-12
2. Containing All Permutations;The American Mathematical Monthly;2021-01-02