BibTeX record conf/avmfss/AggarwalBCG89

download as .bib file

@inproceedings{DBLP:conf/avmfss/AggarwalBCG89,
  author       = {Sudhir Aggarwal and
                  Daniel Barbar{\'{a}} and
                  Walter Cunto and
                  M. R. Garey},
  editor       = {Joseph Sifakis},
  title        = {The Complexity of Collapsing Reachability Graphs},
  booktitle    = {Automatic Verification Methods for Finite State Systems, International
                  Workshop, Grenoble, France, June 12-14, 1989, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {407},
  pages        = {264--274},
  publisher    = {Springer},
  year         = {1989},
  url          = {https://doi.org/10.1007/3-540-52148-8\_22},
  doi          = {10.1007/3-540-52148-8\_22},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/avmfss/AggarwalBCG89.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.