BibTeX record journals/corr/abs-1811-01672

download as .bib file

@article{DBLP:journals/corr/abs-1811-01672,
  author       = {Alkida Balliu and
                  Sebastian Brandt and
                  Yi{-}Jun Chang and
                  Dennis Olivetti and
                  Mika{\"{e}}l Rabie and
                  Jukka Suomela},
  title        = {The distributed complexity of locally checkable problems on paths
                  is decidable},
  journal      = {CoRR},
  volume       = {abs/1811.01672},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.01672},
  eprinttype    = {arXiv},
  eprint       = {1811.01672},
  timestamp    = {Thu, 28 Feb 2019 16:45:16 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-01672.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.