BibTeX record journals/rsa/MagniezNSSTX16

download as .bib file

@article{DBLP:journals/rsa/MagniezNSSTX16,
  author       = {Fr{\'{e}}d{\'{e}}ric Magniez and
                  Ashwin Nayak and
                  Miklos Santha and
                  Jonah Sherman and
                  G{\'{a}}bor Tardos and
                  David Xiao},
  title        = {Improved bounds for the randomized decision tree Complexity of recursive
                  majority},
  journal      = {Random Struct. Algorithms},
  volume       = {48},
  number       = {3},
  pages        = {612--638},
  year         = {2016},
  url          = {https://doi.org/10.1002/rsa.20598},
  doi          = {10.1002/RSA.20598},
  timestamp    = {Mon, 18 Sep 2023 07:51:50 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/MagniezNSSTX16.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.