{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:00Z","timestamp":1759639080596},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_31","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"327-338","source":"Crossref","is-referenced-by-count":0,"title":["Multisource Algorithmic Information Theory"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inform. Theory\u00a046, 1004\u20131016 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"#cr-split#-31_CR2.1","unstructured":"Bennett, C., G??cs, P., Li, M., Vitanyi, P., Zurek, W.: Information distance. In: Proc. 25th ACM Symp. Theory of Comput., pp. 21???30 (1993);"},{"key":"#cr-split#-31_CR2.2","doi-asserted-by":"crossref","unstructured":"Final version: IEEE Trans. Inform. Theory IT-44(4), 1407???1423 (1998)","DOI":"10.1109\/18.681318"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Muchnik, A., Romashchenko, A., Vereshagin, N., Shen, A.: Upper semi-lattice of binary strings with relation x is simple conditional to y. DIMACS Tech. Report, 97-74 (December 1997). Revised version: Proceedings of 1999 Computational Complexity conference, Atlanta. Final version (with A. Chernov): Theoretical Computer Science 271(1\u20132), 69\u201395 (2002)","DOI":"10.1016\/S0304-3975(01)00032-9"},{"key":"31_CR4","volume-title":"Information theory: Coding Theorems for Discrete Memoryless Systems","author":"I. Cziszar","year":"1997","unstructured":"Cziszar, I., Korner, J.: Information theory: Coding Theorems for Discrete Memoryless Systems, 2nd edn. Academic Press, New York (1997)","edition":"2"},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1137\/S009753979834388X","volume":"31","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., Fortnow, L., Laplante, S.: Resource-bounded Kolmogorov complexity revisited. SIAM Journalin Computing\u00a031(3), 887\u2013905 (2002)","journal-title":"SIAM Journalin Computing"},{"key":"31_CR6","unstructured":"G\u00e1cs, P., K\u00f6rner, J.: Common information is far less than mutual information. Problems of Control and Information Theory\u00a02(2), 149\u2013162"},{"key":"31_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Application","author":"M. Li","year":"1997","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Application, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.-Y.R. Li","year":"2003","unstructured":"Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory\u00a049, 371\u2013381 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1\u20132","key":"31_CR9","first-page":"91","volume":"271","author":"A. Muchnik","year":"2002","unstructured":"Muchnik, A.: Conditional complexity and codes. Theoretical Computer Science\u00a0271(1\u20132), 91\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"31_CR10","unstructured":"Muchnik, A., Shen, N., Vereshchagin, M.: Vyugin, Non-reducible descriptions for conditional Kolmogorov complexity. Report TR04-054, Electronic Colloqium on Computational Complexity, ISSN 1433-8092"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Hammer, D., Romashenko, A., Shen, A., Vereshchagin, N.: Inequalities for Shannon entropies and Kolmogorov complexities. In: Proceedings of CCC 1997 Conference, Ulm. Final version: Inequalities for Shannon entropy and Kolmogorov Complexity, Journal of Computer and System Sciences, vol.\u00a060, pp. 442\u2013464 (2000)","DOI":"10.1006\/jcss.1999.1677"},{"key":"#cr-split#-31_CR12.1","unstructured":"Romashchenko, A., Shen, A., Vereshchagin, N.: Combinatorial interpretation of Kolmogorov complexity. ECCC Report??7(26) (2000);"},{"key":"#cr-split#-31_CR12.2","doi-asserted-by":"crossref","unstructured":"IEEE conference on Computational Complexity, published in Theoretical Computer Science, vol. 271(1???2), pp. 111???123 (2002)","DOI":"10.1016\/S0304-3975(01)00034-2"},{"key":"31_CR13","unstructured":"Shen, A.: Algorithmic Information Theory and Kolmogorov Complexity. Lecture notes of an introductory course. Uppsala University Technical Report (2000-034), Available online at http:\/\/www.it.uu.se\/research\/publications\/reports\/2000-034"},{"key":"31_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","volume-title":"A First Course in Information Theory","author":"R. Yeung","year":"2002","unstructured":"Yeung, R.: A First Course in Information Theory. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:32Z","timestamp":1619506592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11750321_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}