@article{LS10,
  author    = {Nikos Leonardos and
               Michael Saks},
  title     = {Lower Bounds on the Randomized Communication Complexity
               of Read-Once Functions},
  journal   = {Computational Complexity},
  volume    = {19},
  number    = {2},
  year      = {2010},
  pages     = {153-181},
  ee        = {http://springerlink.metapress.com/content/y42hkrn487280635/},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

{"_id":{"_str":"534243ba0e946d920a000483"},"__v":1,"authorIDs":[],"author_short":["Leonardos, N.","Saks, M."],"bibbaseid":"leonardos-saks-lowerboundsontherandomizedcommunicationcomplexityofreadoncefunctions-2010","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Nikos"],"propositions":[],"lastnames":["Leonardos"],"suffixes":[]},{"firstnames":["Michael"],"propositions":[],"lastnames":["Saks"],"suffixes":[]}],"title":"Lower Bounds on the Randomized Communication Complexity of Read-Once Functions","journal":"Computational Complexity","volume":"19","number":"2","year":"2010","pages":"153-181","ee":"http://springerlink.metapress.com/content/y42hkrn487280635/","bibsource":"DBLP, http://dblp.uni-trier.de","bibtex":"@article{LS10,\n author = {Nikos Leonardos and\n Michael Saks},\n title = {Lower Bounds on the Randomized Communication Complexity\n of Read-Once Functions},\n journal = {Computational Complexity},\n volume = {19},\n number = {2},\n year = {2010},\n pages = {153-181},\n ee = {http://springerlink.metapress.com/content/y42hkrn487280635/},\n bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n\n","author_short":["Leonardos, N.","Saks, M."],"key":"LS10","id":"LS10","bibbaseid":"leonardos-saks-lowerboundsontherandomizedcommunicationcomplexityofreadoncefunctions-2010","role":"author","urls":{"Link":"http://springerlink.metapress.com/content/y42hkrn487280635/"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","downloads":0,"keywords":[],"search_terms":["lower","bounds","randomized","communication","complexity","read","once","functions","leonardos","saks"],"title":"Lower Bounds on the Randomized Communication Complexity of Read-Once Functions","year":2010,"dataSources":["Te9pFfTBkQvusPFGk","6sSgqzaHAPRWvSxTP"]}