BibTeX record conf/focs/AbboudRW17

download as .bib file

@inproceedings{DBLP:conf/focs/AbboudRW17,
  author    = {Amir Abboud and
               Aviad Rubinstein and
               R. Ryan Williams},
  title     = {Distributed {PCP} Theorems for Hardness of Approximation in {P}},
  booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  pages     = {25--36},
  year      = {2017},
  crossref  = {DBLP:conf/focs/2017},
  url       = {https://doi.org/10.1109/FOCS.2017.12},
  doi       = {10.1109/FOCS.2017.12},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/AbboudRW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2017,
  editor    = {Chris Umans},
  title     = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  publisher = {{IEEE} Computer Society},
  year      = {2017},
  url       = {https://ieeexplore.ieee.org/xpl/conhome/8100284/proceeding},
  isbn      = {978-1-5386-3464-6},
  timestamp = {Wed, 16 Jun 2021 16:45:56 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/2017.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics