{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:16Z","timestamp":1725512416203},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797081"},{"type":"electronic","value":"9783540797098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79709-8_33","type":"book-chapter","created":{"date-parts":[[2008,5,13]],"date-time":"2008-05-13T10:33:17Z","timestamp":1210674797000},"page":"326-338","source":"Crossref","is-referenced-by-count":8,"title":["Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences"],"prefix":"10.1007","author":[{"given":"Marius","family":"Zimand","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73001-9_7","volume-title":"Computation and Logic in the Real World","author":"L. Bienvenu","year":"2007","unstructured":"Bienvenu, L., Doty, D., Stephan, F.: Constructive dimension and weak truth-table degrees. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol.\u00a04497, Springer, Heidelberg (to appear, 2007); Available as Technical Report arXiv:cs\/0701089 ar arxiv.org"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/978-3-540-31856-9_34","volume-title":"STACS 2005","author":"H. Buhrman","year":"2005","unstructured":"Buhrman, H., Fortnow, L., Newman, I., Vereshchagin, N.: Increasing Kolmogorov complexity. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 412\u2013421. Springer, Heidelberg (2005)"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 384\u2013393 (2004)","DOI":"10.1109\/FOCS.2004.29"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Calude, C., Zimand, M.: Algorithmically independent sequences, CORR Technical report arxiv:0802-0487 (2008)","DOI":"10.1007\/978-3-540-85780-8_14"},{"key":"33_CR5","unstructured":"Doty, D.: Dimension extractors and optimal decompression. Technical Report arXiv:cs\/0606078, Computing Research Repository, arXiv.org, Theory of Computing Systems (to appear, May 2007)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11786986_30","volume-title":"Automata, Languages and Programming","author":"L. Fortnow","year":"2006","unstructured":"Fortnow, L., Hitchcock, J., Pavan, A., Vinodchandran, N.V., Wang, F.: Extracting Kolmogorov complexity with applications to dimension zero-one laws. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 335\u2013345. Springer, Heidelberg (2006)"},{"key":"33_CR7","first-page":"49","volume":"187","author":"J. Lutz","year":"2003","unstructured":"Lutz, J.: The dimensions of individual strings and sequences. Information and Control\u00a0187, 49\u201379 (2003)","journal-title":"Information and Control"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(02)00343-5","volume":"84","author":"E. Mayordomo","year":"2002","unstructured":"Mayordomo, E.: A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters\u00a084, 1\u20133 (2002)","journal-title":"Information Processing Letters"},{"issue":"3","key":"33_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.2178\/bsl\/1154698740","volume":"12","author":"J. Miller","year":"2006","unstructured":"Miller, J., Nies, A.: Randomness and computability. Open questions. Bull. Symb. Logic\u00a012(3), 390\u2013410 (2006)","journal-title":"Bull. Symb. Logic"},{"key":"33_CR10","unstructured":"Nies, A., Reimann, J.: A lower cone in the wtt degrees of non-integral effective dimension. In: Proceedings of IMS workshop on Computational Prospects of Infinity, Singapore (to appear, 2006)"},{"key":"33_CR11","unstructured":"Reimann, J.: Computability and fractal dimension. Technical report, Universit\u00e4t Heidelberg, Ph.D. thesis (2004)"},{"key":"33_CR12","first-page":"1066","volume":"277","author":"B. Ryabko","year":"1984","unstructured":"Ryabko, B.: Coding of combinatorial sources and Hausdorff dimension. Doklady Akademii Nauk SSR\u00a0277, 1066\u20131070 (1984)","journal-title":"Doklady Akademii Nauk SSR"},{"key":"33_CR13","unstructured":"Shen, A.: Algorithmic information theory and Kolmogorov complexity. Technical Report 2000-034, Uppsala Universitet (December 2000)"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ipl.2004.09.023","volume":"93","author":"L. Staiger","year":"2005","unstructured":"Staiger, L.: Constructive dimension equals Kolmogorov complexity. Information Processing Letters\u00a093, 149\u2013153 (2005); Preliminary version: Research Report CDMTCS-210, Univ. of Auckland (January 2003)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79709-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T05:31:17Z","timestamp":1684387877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79709-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797081","9783540797098"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79709-8_33","relation":{},"subject":[]}}