BibTeX record conf/focs/AbboudKT20

download as .bib file

@inproceedings{DBLP:conf/focs/AbboudKT20,
  author       = {Amir Abboud and
                  Robert Krauthgamer and
                  Ohad Trabelsi},
  editor       = {Sandy Irani},
  title        = {Cut-Equivalent Trees are Optimal for Min-Cut Queries},
  booktitle    = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2020, Durham, NC, USA, November 16-19, 2020},
  pages        = {105--118},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/FOCS46700.2020.00019},
  doi          = {10.1109/FOCS46700.2020.00019},
  timestamp    = {Sat, 30 Sep 2023 09:41:22 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/AbboudKT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}