BibTeX record conf/stacs/ChoffrutC84

download as .bib file

@inproceedings{DBLP:conf/stacs/ChoffrutC84,
  author       = {Christian Choffrut and
                  Karel Cul{\'{\i}}k II},
  editor       = {Max Fontet and
                  Kurt Mehlhorn},
  title        = {On Extendibility of Unavoidable Sets},
  booktitle    = {{STACS} 84, Symposium of Theoretical Aspects of Computer Science,
                  Paris, France, 11-13 April, 1984, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {166},
  pages        = {326--338},
  publisher    = {Springer},
  year         = {1984},
  url          = {https://doi.org/10.1007/3-540-12920-0\_30},
  doi          = {10.1007/3-540-12920-0\_30},
  timestamp    = {Wed, 24 Mar 2021 11:05:33 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/ChoffrutC84.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.