@article{dhulipala_silence_2010,
 abstract = {Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.},
 type={2},
 author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},
 journal = {IEEE Transactions on Information Theory},
 tags = {sensor_networks},
 title = {Silence based communication},
 volume = {56},
 year = {2010}
}

{"_id":"amdxKmKFWZNcs7fhH","bibbaseid":"dhulipala-fragouli-orlitsky-silencebasedcommunication-2010","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Dhulipala, A.","Fragouli, C.","Orlitsky, A."],"bibdata":{"bibtype":"article","type":"2","abstract":"Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.","author":[{"propositions":[],"lastnames":["Dhulipala"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Orlitsky"],"firstnames":["A."],"suffixes":[]}],"journal":"IEEE Transactions on Information Theory","tags":"sensor_networks","title":"Silence based communication","volume":"56","year":"2010","bibtex":"@article{dhulipala_silence_2010,\n abstract = {Communication complexity—the minimum amount of communication required—of computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst-case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst-case complexities are determined and the protocols achieving them are described. For functions of non-binary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multi-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst-case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size.},\n type={2},\n author = {Dhulipala, A. and Fragouli, C. and Orlitsky, A.},\n journal = {IEEE Transactions on Information Theory},\n tags = {sensor_networks},\n title = {Silence based communication},\n volume = {56},\n year = {2010}\n}\n\n","author_short":["Dhulipala, A.","Fragouli, C.","Orlitsky, A."],"key":"dhulipala_silence_2010","id":"dhulipala_silence_2010","bibbaseid":"dhulipala-fragouli-orlitsky-silencebasedcommunication-2010","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&noBootstrap=1&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner="}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.487Z","downloads":0,"keywords":[],"search_terms":["silence","based","communication","dhulipala","fragouli","orlitsky"],"title":"Silence based communication","year":2010,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}