%0 Conference Paper %1 conf/coco/LeonardosS09 %A Leonardos, Nikos %A Saks, Michael E. %B CCC %D 2009 %I IEEE Computer Society %K dblp %P 341-350 %T Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. %U http://dblp.uni-trier.de/db/conf/coco/coco2009.html#LeonardosS09 %@ 978-0-7695-3717-7

@inproceedings{conf/coco/LeonardosS09, added-at = {2023-03-24T00:00:00.000+0100}, author = {Leonardos, Nikos and Saks, Michael E.}, biburl = {https://www.bibsonomy.org/bibtex/2d292849ded9c470375dfa9edc884b602/dblp}, booktitle = {CCC}, crossref = {conf/coco/2009}, ee = {https://doi.ieeecomputersociety.org/10.1109/CCC.2009.32}, interhash = {711c94d7315f8941ce1531364e91cbbd}, intrahash = {d292849ded9c470375dfa9edc884b602}, isbn = {978-0-7695-3717-7}, keywords = {dblp}, pages = {341-350}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T01:30:22.000+0200}, title = {Lower Bounds on the Randomized Communication Complexity of Read-Once Functions.}, url = {http://dblp.uni-trier.de/db/conf/coco/coco2009.html#LeonardosS09}, year = 2009 }