BibTeX record conf/allerton/AcharyaJO11

download as .bib file

@inproceedings{DBLP:conf/allerton/AcharyaJO11,
  author       = {Jayadev Acharya and
                  Ashkan Jafarpour and
                  Alon Orlitsky},
  title        = {Expected query complexity of symmetric boolean functions},
  booktitle    = {49th Annual Allerton Conference on Communication, Control, and Computing,
                  Allerton 2011, Allerton Park {\&} Retreat Center, Monticello,
                  IL, USA, 28-30 September, 2011},
  pages        = {26--29},
  publisher    = {{IEEE}},
  year         = {2011},
  url          = {https://doi.org/10.1109/Allerton.2011.6120145},
  doi          = {10.1109/ALLERTON.2011.6120145},
  timestamp    = {Wed, 16 Oct 2019 14:14:55 +0200},
  biburl       = {https://dblp.org/rec/conf/allerton/AcharyaJO11.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.