BibTeX record conf/mfcs/Mehta18

download as .bib file

@inproceedings{DBLP:conf/mfcs/Mehta18,
  author       = {Jenish C. Mehta},
  editor       = {Igor Potapov and
                  Paul G. Spirakis and
                  James Worrell},
  title        = {Tree Tribes and Lower Bounds for Switching Lemmas},
  booktitle    = {43rd International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series       = {LIPIcs},
  volume       = {117},
  pages        = {70:1--70:11},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2018.70},
  doi          = {10.4230/LIPICS.MFCS.2018.70},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/Mehta18.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.