BibTeX record conf/coco/BeamePSW05

download as .bib file

@inproceedings{DBLP:conf/coco/BeamePSW05,
  author       = {Paul Beame and
                  Toniann Pitassi and
                  Nathan Segerlind and
                  Avi Wigderson},
  title        = {A Direct Sum Theorem for Corruption and the Multiparty {NOF} Communication
                  Complexity of Set Disjointness},
  booktitle    = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
                  11-15 June 2005, San Jose, CA, {USA}},
  pages        = {52--66},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/CCC.2005.1},
  doi          = {10.1109/CCC.2005.1},
  timestamp    = {Sat, 30 Sep 2023 09:37:24 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/BeamePSW05.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.