Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Nikos Leonardos, Michael Saks. Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. Computational Complexity, 19(2):153-181, 2010. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: 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] A lower bound on the quantum query complexity of read-once functionsHoward Barnum, Michael E. Saks. eccc, (002), 2002. [doi]
The following publications are possibly variants of this publication: