S. Chakraborty, On the Sensitivity of Cyclically-Invariant Boolean Functions, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005.
DOI : 10.1109/CCC.2005.38

URL : https://hal.archives-ouvertes.fr/hal-00990492

S. Cook, C. Dwork, and R. Reischuk, Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes, SIAM Journal on Computing, vol.15, issue.1, pp.87-97, 1986.
DOI : 10.1137/0215006

C. Kenyon and S. Kutin, Sensitivity, block sensitivity, and ???-block sensitivity of boolean functions, Information and Computation, vol.189, issue.1, pp.43-53, 2004.
DOI : 10.1016/j.ic.2002.12.001

N. Nisan, and Decision Trees, SIAM Journal on Computing, vol.20, issue.6, pp.999-1070, 1991.
DOI : 10.1137/0220062

D. Rubinstein, Sensitivity vs. block sensitivity of Boolean functions, Combinatorica, vol.15, issue.2, pp.297-299, 1995.
DOI : 10.1007/BF01200762

H. Simon, A tight ?(log log n)-bound on the time for parallel ram's to compute nondegenerated boolean functions, FCT, Lecture notes in Comp. Sci, p.4, 1983.

X. Sun, Block sensitivity of weakly symmetric functions, Proceedings of Theory and Applications of Models of Computation, pp.339-344, 2006.

G. Turán, The critical complexity of graph properties, Information Processing Letters, vol.18, issue.3, pp.151-153, 1984.
DOI : 10.1016/0020-0190(84)90019-X