@inproceedings{dhulipala_single_2007,
 abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},
 type={4},
 author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},
 booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},
 doi = {10.1109/isit.2007.4557296},
 month = {June},
 pages = {636 --640},
 tags = {CC},
 title = {Single versus multiple rounds for distributed function computation},
 year = {2007}
}

{"_id":"8aLgQB6JNPRnZ3ihm","bibbaseid":"dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Dhulipala, A. K.","Fragouli, C.","Orlitsky, A."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.","author":[{"propositions":[],"lastnames":["Dhulipala"],"firstnames":["Anand","K."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Orlitsky"],"firstnames":["Alon"],"suffixes":[]}],"booktitle":"Information Theory, 2007. ISIT 2007. IEEE International Symposium on","doi":"10.1109/isit.2007.4557296","month":"June","pages":"636 –640","tags":"CC","title":"Single versus multiple rounds for distributed function computation","year":"2007","bibtex":"@inproceedings{dhulipala_single_2007,\n abstract = {Communication complexity of computing functions using unrestricted communication and one-round communication are compared. In the standard unrestricted communication each party could potentially communicate several times while in one-round communication each party is restricted to communicate at most once. Results on the ratio of these two complexities are provided for symmetric and asymmetric functions under different scenarios. These results are suitably illustrated with examples.},\n type={4},\n author = {Dhulipala, Anand K. and Fragouli, C. and Orlitsky, Alon},\n booktitle = {Information {Theory}, 2007. {ISIT} 2007. {IEEE} {International} {Symposium} on},\n doi = {10.1109/isit.2007.4557296},\n month = {June},\n pages = {636 --640},\n tags = {CC},\n title = {Single versus multiple rounds for distributed function computation},\n year = {2007}\n}\n\n","author_short":["Dhulipala, A. K.","Fragouli, C.","Orlitsky, A."],"key":"dhulipala_single_2007-1","id":"dhulipala_single_2007-1","bibbaseid":"dhulipala-fragouli-orlitsky-singleversusmultipleroundsfordistributedfunctioncomputation-2007","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1"}},"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.487Z","downloads":0,"keywords":[],"search_terms":["single","versus","multiple","rounds","distributed","function","computation","dhulipala","fragouli","orlitsky"],"title":"Single versus multiple rounds for distributed function computation","year":2007,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}