BibTeX Export for An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences

Copy to Clipboard Download

@InProceedings{nowotka_et_al:LIPIcs.ICALP.2018.136,
  author =	{Nowotka, Dirk and Saarela, Aleksi},
  title =	{{An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences}},
  booktitle =	{45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
  pages =	{136:1--136:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.136},
  URN =		{urn:nbn:de:0030-drops-91404},
  doi =		{10.4230/LIPIcs.ICALP.2018.136},
  annote =	{Keywords: combinatorics on words, word equations, systems of equations}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode