BibTeX Export for Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs

Copy to Clipboard Download

@InProceedings{lincoln_et_al:LIPIcs.ITCS.2020.11,
  author =	{Lincoln, Andrea and Vyas, Nikhil},
  title =	{{Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs}},
  booktitle =	{11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
  pages =	{11:1--11:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-134-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{151},
  editor =	{Vidick, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.11},
  URN =		{urn:nbn:de:0030-drops-116969},
  doi =		{10.4230/LIPIcs.ITCS.2020.11},
  annote =	{Keywords: k-cycle, Space, Savitch, Sparse Graphs, Max-3-SAT}
}

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