Sensitivity vs. block sensitivity of Boolean functions

This publication has 4 references indexed in Scilit:

• On the degree of Boolean functions as real polynomials
  Published by Association for Computing Machinery (ACM) ,1992
• CREW PRAMS and decision trees
  Published by Association for Computing Machinery (ACM) ,1989
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
  SIAM Journal on Computing, 1986
• A tight Ω(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions
  Published by Springer Nature ,1983