The following publications are possibly variants of this publication:
- A lower bound on the quantum query complexity of read-once functionsHoward Barnum, Michael E. Saks. jcss, 69(2):244-258, 2004. [doi]
- Lower Bounds on the Randomized Communication Complexity of Read-Once FunctionsNikos Leonardos, Michael Saks. coco 2009: 341-350 [doi]
- Lower bounds on the randomized communication complexity of read-once functionsNikos Leonardos, Michael E. Saks. eccc, 16:10, 2009. [doi]
- Lower Bounds on the Randomized Communication Complexity of Read-Once FunctionsNikos Leonardos, Michael Saks. cc, 19(2):153-181, 2010. [doi]