BibTeX record conf/coco/BeameM11

download as .bib file

@inproceedings{DBLP:conf/coco/BeameM11,
  author       = {Paul Beame and
                  Widad Machmouchi},
  title        = {Making Branching Programs Oblivious Requires Superlogarithmic Overhead},
  booktitle    = {Proceedings of the 26th Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011},
  pages        = {12--22},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/CCC.2011.35},
  doi          = {10.1109/CCC.2011.35},
  timestamp    = {Sat, 30 Sep 2023 09:37:24 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/BeameM11.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.