Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations

William Kuszmaul. Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations. Math. Comput., 87(310):987-1011, 2018. [doi]

@article{Kuszmaul18,
  title = {Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations},
  author = {William Kuszmaul},
  year = {2018},
  doi = {10.1090/mcom/3216},
  url = {https://doi.org/10.1090/mcom/3216},
  researchr = {https://researchr.org/publication/Kuszmaul18},
  cites = {0},
  citedby = {0},
  journal = {Math. Comput.},
  volume = {87},
  number = {310},
  pages = {987-1011},
}