BibTeX record conf/coco/BlaisB19

download as .bib file

@inproceedings{DBLP:conf/coco/BlaisB19,
  author       = {Eric Blais and
                  Joshua Brody},
  editor       = {Amir Shpilka},
  title        = {Optimal Separation and Strong Direct Sum for Randomized Query Complexity},
  booktitle    = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
                  2019, New Brunswick, NJ, {USA}},
  series       = {LIPIcs},
  volume       = {137},
  pages        = {29:1--29:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2019.29},
  doi          = {10.4230/LIPICS.CCC.2019.29},
  timestamp    = {Thu, 02 Feb 2023 13:27:04 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BlaisB19.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.