BibTeX record conf/soda/CarlsonKST19

download as .bib file

@inproceedings{DBLP:conf/soda/CarlsonKST19,
  author       = {Charles Carlson and
                  Alexandra Kolla and
                  Nikhil Srivastava and
                  Luca Trevisan},
  editor       = {Timothy M. Chan},
  title        = {Optimal Lower Bounds for Sketching Graph Cuts},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {2565--2569},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.158},
  doi          = {10.1137/1.9781611975482.158},
  timestamp    = {Tue, 29 Nov 2022 15:55:03 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CarlsonKST19.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.