{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:35Z","timestamp":1725543815693},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_24","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"310-318","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic Asymmetric Communication"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Adler, M.: Collecting correlated information from a sensor network. In: Proceedings of the 16th Symposium on Discrete Algorithms, pp. 479\u2013488 (2005)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Adler, M., Demaine, E.D., Harvey, N.J.A., P\u01cetra\u015fcu, M.: Lower bounds for asymmetric communication complexity and distributed source coding. In: Proceedings of the 17th Symposium on Discrete Algorithms, pp. 251\u2013260 (2006)","DOI":"10.1145\/1109557.1109586"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1006\/jcss.2001.1779","volume":"64","author":"M. Adler","year":"2001","unstructured":"Adler, M., Maggs, B.M.: Protocols for asymmetric communication channels. Journal of Computer and System Sciences\u00a064(4), 573\u2013596 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"J.L. Bentley","year":"1986","unstructured":"Bentley, J.L., Sleator, D.D., Tarjan, R.E., Wei, V.K.: A locally adaptive data compression scheme. Communications of the ACM\u00a029(4), 320\u2013330 (1986)","journal-title":"Communications of the ACM"},{"issue":"6","key":"24_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s00224-003-1126-2","volume":"36","author":"P. Bose","year":"2003","unstructured":"Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. Theory of Computing Systems\u00a036(6), 655\u2013661 (2003)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory\u00a021(2), 194\u2013203 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR7","unstructured":"Feamster, N., Balazinska, M., Harfst, G., Balakrishnan, H., Karger, D.: Infranet: Circumventing web censorship and surveillance. In: Proceedings of the 11th USENIX Security Symposium, pp. 247\u2013262 (2002)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Feamster, N., Balazinska, M., Wang, W., Balakrishnan, H., Karger, D.: Thwarting web censorship with untrusted messenger discovery. In: Proceedings of the 3rd International Workshop on Privacy Enhancing Technologies, pp. 125\u2013140 (2003)","DOI":"10.1007\/978-3-540-40956-4_9"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Gagie, T.: Dynamic Shannon coding. In: Proceedings of the 12th European Symposium on Algorithms, pp. 359\u2013370 (2004)","DOI":"10.1109\/DCC.2004.1281516"},{"issue":"4","key":"24_CR10","first-page":"297","volume":"8","author":"S. Ghazizadeh","year":"2001","unstructured":"Ghazizadeh, S., Ghodsi, M., Saberi, A.: A new protocol for asymmetric communication channels: Reaching the lower bounds. Scientia Iranica\u00a08(4), 297\u2013302 (2001)","journal-title":"Scientia Iranica"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"E.N. Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.: Variable-length binary encodings. Bell System Technical Journal\u00a038, 933\u2013968 (1959)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","author":"D.E. Knuth","year":"1985","unstructured":"Knuth, D.E.: Dynamic Huffman coding. Journal of Algorithms\u00a06(2), 163\u2013180 (1985)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(01)00332-5","volume":"83","author":"E.S. Laber","year":"2002","unstructured":"Laber, E.S., Holanda, L.G.: Improved bounds for asymmetric communication protocols. Information Processing Letters\u00a083(4), 205\u2013209 (2002)","journal-title":"Information Processing Letters"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423 (1948)","journal-title":"Bell System Technical Journal"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032, 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"key":"24_CR16","unstructured":"Wang, W.: Implementation and security analysis of the Infranet anti-censorship system. Master\u2019s thesis, Massachusetts Institute of Technology (2003)"},{"key":"24_CR17","unstructured":"Watkinson, J., Adler, M., Fich, F.: New protocols for asymmetric communication channels. In: Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, pp. 337\u2013350 (2001)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:13Z","timestamp":1619507833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11780823_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}