Search dblp for Publications

export results for "Polynomial versus Exponential Growth in Repetition-Free Binary Words"

 download as .bib file

@article{DBLP:journals/jct/KarhumakiS04,
  author       = {Juhani Karhum{\"{a}}ki and
                  Jeffrey O. Shallit},
  title        = {Polynomial versus exponential growth in repetition-free binary words},
  journal      = {J. Comb. Theory {A}},
  volume       = {105},
  number       = {2},
  pages        = {335--347},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jcta.2003.12.004},
  doi          = {10.1016/J.JCTA.2003.12.004},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/KarhumakiS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/math-CO-0304095,
  author       = {Juhani Karhum{\"{a}}ki and
                  Jeffrey O. Shallit},
  title        = {Polynomial versus Exponential Growth in Repetition-Free Binary Words},
  journal      = {CoRR},
  volume       = {math.CO/0304095},
  year         = {2003},
  url          = {http://arxiv.org/abs/math/0304095},
  timestamp    = {Mon, 09 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/math-CO-0304095.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.