BibTeX record conf/coco/LeonardosS09

download as .bib file

@inproceedings{DBLP:conf/coco/LeonardosS09,
  author       = {Nikos Leonardos and
                  Michael E. Saks},
  title        = {Lower Bounds on the Randomized Communication Complexity of Read-Once
                  Functions},
  booktitle    = {Proceedings of the 24th Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages        = {341--350},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/CCC.2009.32},
  doi          = {10.1109/CCC.2009.32},
  timestamp    = {Fri, 24 Mar 2023 00:04:21 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LeonardosS09.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.