BibTeX record conf/focs/AroraLMSS92

download as .bib file

@inproceedings{DBLP:conf/focs/AroraLMSS92,
  author    = {Sanjeev Arora and
               Carsten Lund and
               Rajeev Motwani and
               Madhu Sudan and
               Mario Szegedy},
  title     = {Proof Verification and Hardness of Approximation Problems},
  booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  pages     = {14--23},
  year      = {1992},
  crossref  = {DBLP:conf/focs/FOCS33},
  url       = {https://doi.org/10.1109/SFCS.1992.267823},
  doi       = {10.1109/SFCS.1992.267823},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/AroraLMSS92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS33,
  title     = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  publisher = {{IEEE} Computer Society},
  year      = {1992},
  url       = {https://ieeexplore.ieee.org/xpl/conhome/424/proceeding},
  isbn      = {0-8186-2900-2},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/FOCS33},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics