Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Jenish C. Mehta. Tree Tribes and Lower Bounds for Switching Lemmas. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 70:1-70:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{mehta:LIPIcs.MFCS.2018.70, author = {Mehta, Jenish C.}, title = {{Tree Tribes and Lower Bounds for Switching Lemmas}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {70:1--70:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.70}, URN = {urn:nbn:de:0030-drops-96524}, doi = {10.4230/LIPIcs.MFCS.2018.70}, annote = {Keywords: Tree Tribes, Resilience, Switching lemmas, lower bounds, decision tree} }
Feedback for Dagstuhl Publishing