Model Checking Lower Bounds for Simple Graphs

Michael Lampis. Model Checking Lower Bounds for Simple Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Volume 7965 of Lecture Notes in Computer Science, pages 673-683, Springer, 2013. [doi]

@inproceedings{Lampis13-0,
  title = {Model Checking Lower Bounds for Simple Graphs},
  author = {Michael Lampis},
  year = {2013},
  doi = {10.1007/978-3-642-39206-1_57},
  url = {http://dx.doi.org/10.1007/978-3-642-39206-1_57},
  researchr = {https://researchr.org/publication/Lampis13-0},
  cites = {0},
  citedby = {0},
  pages = {673-683},
  booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I},
  editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg},
  volume = {7965},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-39205-4},
}