BibTeX record conf/fsttcs/AnshuGJKLMSS17

download as .bib file

@inproceedings{DBLP:conf/fsttcs/AnshuGJKLMSS17,
  author       = {Anurag Anshu and
                  Dmitry Gavinsky and
                  Rahul Jain and
                  Srijita Kundu and
                  Troy Lee and
                  Priyanka Mukhopadhyay and
                  Miklos Santha and
                  Swagato Sanyal},
  editor       = {Satya V. Lokam and
                  R. Ramanujam},
  title        = {A Composition Theorem for Randomized Query Complexity},
  booktitle    = {37th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
                  Kanpur, India},
  series       = {LIPIcs},
  volume       = {93},
  pages        = {10:1--10:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.10},
  doi          = {10.4230/LIPICS.FSTTCS.2017.10},
  timestamp    = {Mon, 03 Jan 2022 22:29:43 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/AnshuGJKLMSS17.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.