BibTeX record conf/mfcs/ChlebusDRS89

download as .bib file

@inproceedings{DBLP:conf/mfcs/ChlebusDRS89,
  author       = {Bogdan S. Chlebus and
                  Krzysztof Diks and
                  Wojciech Rytter and
                  Tomasz Szymacha},
  editor       = {Antoni Kreczmar and
                  Grazyna Mirkowska},
  title        = {Parallel Complexity of Lexicographically First Order Problems for
                  Tree-Structured Graphs (Extended Abstract)},
  booktitle    = {Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik,
                  Poland, August 28 - September 1, 1989, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {379},
  pages        = {185--195},
  publisher    = {Springer},
  year         = {1989},
  url          = {https://doi.org/10.1007/3-540-51486-4\_66},
  doi          = {10.1007/3-540-51486-4\_66},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/ChlebusDRS89.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.