BibTeX record conf/rp/DayGHMN18

download as .bib file

@inproceedings{DBLP:conf/rp/DayGHMN18,
  author    = {Joel D. Day and
               Vijay Ganesh and
               Paul He and
               Florin Manea and
               Dirk Nowotka},
  title     = {The Satisfiability of Word Equations: Decidable and Undecidable Theories},
  booktitle = {Reachability Problems - 12th International Conference, {RP} 2018,
               Marseille, France, September 24-26, 2018, Proceedings},
  pages     = {15--29},
  year      = {2018},
  crossref  = {DBLP:conf/rp/2018},
  url       = {https://doi.org/10.1007/978-3-030-00250-3\_2},
  doi       = {10.1007/978-3-030-00250-3\_2},
  timestamp = {Thu, 13 Sep 2018 15:02:16 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/rp/DayGHMN18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/rp/2018,
  editor    = {Igor Potapov and
               Pierre{-}Alain Reynier},
  title     = {Reachability Problems - 12th International Conference, {RP} 2018,
               Marseille, France, September 24-26, 2018, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {11123},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-030-00250-3},
  doi       = {10.1007/978-3-030-00250-3},
  isbn      = {978-3-030-00249-7},
  timestamp = {Thu, 13 Sep 2018 14:59:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/rp/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier