Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin. Computational and proof complexity of partial string avoidability. Electronic Colloquium on Computational Complexity (ECCC), 27:67, 2020. [doi]
Abstract is missing.