@inproceedings{Nisan1989,
  author    = {Nisan, Noam},
  title     = {{CREW PRAMs} and Decision Trees},
  booktitle = {Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing},
  series    = {STOC '89},
  pages     = {327--335},
  publisher = {ACM},
  year      = {1989},
  doi       = {10.1145/73007.73038},
  note      = {\href{https://doi.org/10.1145/73007.73038}{doi:10.1145/73007.73038}},
  url       = {https://www.cs.huji.ac.il/~noam/crew.pdf}
}

@article{Virza2011,
  author  = {Virza, Madars},
  title   = {Sensitivity versus block sensitivity of {Boolean} functions},
  journal = {Information Processing Letters},
  volume  = {111},
  number  = {9},
  pages   = {433--435},
  year    = {2011},
  doi     = {10.1016/j.ipl.2011.02.001},
  note    = {\href{https://doi.org/10.1016/j.ipl.2011.02.001}{doi:10.1016/j.ipl.2011.02.001}},
  url     = {https://doi.org/10.1016/j.ipl.2011.02.001}
}

@article{NisanSzegedy1994,
  author  = {Nisan, Noam and Szegedy, Mario},
  title   = {On the degree of {Boolean} functions as real polynomials},
  journal = {Computational Complexity},
  volume  = {4},
  number  = {4},
  pages   = {301--313},
  year    = {1994},
  doi     = {10.1007/BF01263419},
  note    = {\href{https://doi.org/10.1007/BF01263419}{doi:10.1007/BF01263419}},
  url     = {https://doi.org/10.1007/BF01263419}
}

@article{Huang2019,
  author  = {Huang, Hao},
  title   = {Induced subgraphs of hypercubes and a proof of the {Sensitivity Conjecture}},
  journal = {Annals of Mathematics},
  volume  = {190},
  number  = {3},
  pages   = {949--955},
  year    = {2019},
  doi     = {10.4007/annals.2019.190.3.6},
  note    = {\href{https://doi.org/10.4007/annals.2019.190.3.6}{doi:10.4007/annals.2019.190.3.6}},
  url     = {https://annals.math.princeton.edu/2019/190-3/p06}
}

@article{Rubinstein1995,
  author  = {Rubinstein, David},
  title   = {Sensitivity vs.\ block sensitivity of {Boolean} functions},
  journal = {Combinatorica},
  volume  = {15},
  number  = {2},
  pages   = {297--299},
  year    = {1995},
  doi     = {10.1007/BF01200762},
  note    = {\href{https://doi.org/10.1007/BF01200762}{doi:10.1007/BF01200762}},
  url     = {https://doi.org/10.1007/BF01200762}
}

@techreport{AmbainisSun2011,
  author      = {Ambainis, Andris and Sun, Xiaoming},
  title       = {New separation between {$s(f)$} and {$bs(f)$}},
  institution = {Electronic Colloquium on Computational Complexity},
  number      = {TR11-116},
  year        = {2011},
  eprint      = {1108.3494},
  archivePrefix = {arXiv},
  primaryClass  = {cs.CC},
  note        = {\href{https://arxiv.org/abs/1108.3494v1}{arXiv:1108.3494v1}},
  doi         = {10.48550/arXiv.1108.3494},
  url         = {https://arxiv.org/abs/1108.3494v1}
}

@misc{Meiburg2026,
  author        = {Meiburg, Alexander},
  title         = {{Block Sensitivity can exceed Spectral Sensitivity Squared}},
  year          = {2026},
  eprint        = {2608.00851},
  archivePrefix = {arXiv},
  primaryClass  = {cs.CC},
  note          = {\href{https://arxiv.org/html/2608.00851v1}{arXiv:2608.00851v1}, 1 August 2026},
  doi           = {10.48550/arXiv.2608.00851},
  url           = {https://arxiv.org/html/2608.00851v1}
}

@article{Wellens2022,
  author        = {Wellens, Jake},
  title         = {Relationships between the number of inputs and other complexity measures of {Boolean} functions},
  journal       = {Discrete Analysis},
  year          = {2022},
  note          = {Paper No. 20, 21 pp.; arXiv:2005.00566v2},
  eprint        = {2005.00566},
  archivePrefix = {arXiv},
  primaryClass  = {math.CO},
  doi           = {10.19086/da.57741},
  url           = {https://arxiv.org/abs/2005.00566v2}
}

@inproceedings{Tal2013,
  author    = {Tal, Avishay},
  title     = {Properties and Applications of {Boolean} Function Composition},
  booktitle = {Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science},
  series    = {ITCS '13},
  pages     = {441--454},
  publisher = {ACM},
  year      = {2013},
  doi       = {10.1145/2422436.2422485},
  note      = {\href{https://doi.org/10.1145/2422436.2422485}{doi:10.1145/2422436.2422485}},
  url       = {https://web.vu.lt/mif/s.jukna/boolean/Tal2013.pdf}
}


@inproceedings{AaronsonEtAl2021,
  author    = {Aaronson, Scott and Ben-David, Shalev and Kothari, Robin and Rao, Shravas and Tal, Avishay},
  title     = {Degree vs. Approximate Degree and Quantum Implications of {Huang}'s Sensitivity Theorem},
  booktitle = {Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing},
  series    = {STOC '21},
  pages     = {1330--1342},
  publisher = {ACM},
  year      = {2021},
  doi       = {10.1145/3406325.3451047},
  note      = {\href{https://doi.org/10.1145/3406325.3451047}{doi:10.1145/3406325.3451047}},
  eprint    = {2010.12629},
  archivePrefix = {arXiv},
  url       = {https://arxiv.org/abs/2010.12629v1}
}

@techreport{AmbainisPrusis2014,
  author      = {Ambainis, Andris and Pr{\=u}sis, Kri{\v{s}}j{\=a}nis},
  title       = {A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity},
  institution = {Electronic Colloquium on Computational Complexity},
  number      = {TR14-027},
  year        = {2014},
  month       = jul,
  note        = {Revision 1, July 31, 2014; \href{https://eccc.weizmann.ac.il/report/2014/027/revision/1/download}{revised report}},
  url         = {https://eccc.weizmann.ac.il/report/2014/027/revision/1/download}
}