BibTeX record conf/coco/RamamoorthyR18

download as .bib file

@inproceedings{DBLP:conf/coco/RamamoorthyR18,
  author       = {Sivaramakrishnan Natarajan Ramamoorthy and
                  Anup Rao},
  editor       = {Rocco A. Servedio},
  title        = {Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers,
                  from Sunflowers},
  booktitle    = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
                  2018, San Diego, CA, {USA}},
  series       = {LIPIcs},
  volume       = {102},
  pages        = {27:1--27:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2018.27},
  doi          = {10.4230/LIPICS.CCC.2018.27},
  timestamp    = {Thu, 02 Feb 2023 13:27:05 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/RamamoorthyR18.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.