{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:12Z","timestamp":1725795012401},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_28","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T01:30:40Z","timestamp":1401672640000},"page":"365-374","source":"Crossref","is-referenced-by-count":0,"title":["Randomized Communication Complexity of Approximating Kolmogorov Complexity"],"prefix":"10.1007","author":[{"given":"Nikolay","family":"Vereshchagin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The probabilistic method, 2nd edn. John Wiley & Sons (2000)","DOI":"10.1002\/0471722154"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/jcss.2001.1761","volume":"63","author":"A. Ambainis","year":"2001","unstructured":"Ambainis, A., Buhrman, H., Gasarch, W.I., Kalyanasundaram, B., Torenvliet, L.: The communication complexity of enumeration, elimination and selection. Journal of Computer and System Sciences\u00a063, 148\u2013185 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-24749-4_3","volume-title":"STACS 2004","author":"H. Buhrman","year":"2004","unstructured":"Buhrman, H., Klauck, H., Vereshchagin, N.K., Vit\u00e1nyi, P.M.B.: Individual communication complexity. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 19\u201330. Springer, Heidelberg (2004)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Kouck\u00fd, M., Vereshchagin, N.: Randomized Individual Communication Complexity. In: IEEE Conference on Computational Complexity, pp. 321\u2013331 (2008)","DOI":"10.1109\/CCC.2008.33"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574948"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer (1997)","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: 18th Annual IEEE Symposium on Foundation of Computer Science, pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:48:26Z","timestamp":1558900106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}