BibTeX record journals/toct/ItsyksonOO21

download as .bib file

@article{DBLP:journals/toct/ItsyksonOO21,
  author       = {Dmitry Itsykson and
                  Alexander Okhotin and
                  Vsevolod Oparin},
  title        = {Computational and Proof Complexity of Partial String Avoidability},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {13},
  number       = {1},
  pages        = {6:1--6:25},
  year         = {2021},
  url          = {https://doi.org/10.1145/3442365},
  doi          = {10.1145/3442365},
  timestamp    = {Mon, 26 Apr 2021 16:14:40 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/ItsyksonOO21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.