{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:05:20Z","timestamp":1649181920170},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:00:00Z","timestamp":1342828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00224-012-9417-0","type":"journal-article","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T13:07:57Z","timestamp":1342789677000},"page":"95-112","source":"Crossref","is-referenced-by-count":1,"title":["Dimension Is Compression"],"prefix":"10.1007","volume":"52","author":[{"given":"Mar\u00eda","family":"L\u00f3pez-Vald\u00e9s","sequence":"first","affiliation":[]},{"given":"Elvira","family":"Mayordomo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,21]]},"reference":[{"key":"9417_CR1","unstructured":"Albert, P., Mayordomo, E., Moser, P.: Bounded pushdown dimension vs Lempel Ziv information density. Technical Report TR07-051, ECCC: Electronic Coloquium on Computational Complexity (2007)"},{"key":"9417_CR2","first-page":"210","volume-title":"Proceedings of the 16th IEEE Conference on Computational Complexity","author":"K. Ambos-Spies","year":"2001","unstructured":"Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.: Hausdorff dimension in exponential time. In: Proceedings of the 16th IEEE Conference on Computational Complexity, pp.\u00a0210\u2013217 (2001)"},{"key":"9417_CR3","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/S0097539703446912","volume":"37","author":"K.B. Athreya","year":"2007","unstructured":"Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM J. Comput. 37, 671\u2013705 (2007)","journal-title":"SIAM J. Comput."},{"key":"9417_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-540-24587-2_12","volume-title":"Proceedings of the 14th Annual International Symposium on Algorithms and Computation","author":"R. Beigel","year":"2003","unstructured":"Beigel, R., Fortnow, L., Stephan, F.: Infinitely-often autoreducible sets. In: Proceedings of the 14th Annual International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 2906, pp. 98\u2013107. Springer, Berlin (2003)"},{"issue":"3","key":"9417_CR5","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1137\/S0097539797317123","volume":"31","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., Longpr\u00e9, L.: Compressibility and resource bounded measure. SIAM J. Comput. 31(3), 876\u2013886 (2002)","journal-title":"SIAM J. Comput."},{"key":"9417_CR6","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0022-0000(05)80073-X","volume":"49","author":"J. Cai","year":"1994","unstructured":"Cai, J., Hartmanis, J.: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. J. Comput. Syst. Sci. 49, 605\u2013619 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"9417_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"9417_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(03)00244-5","volume":"310","author":"J.J. Dai","year":"2004","unstructured":"Dai, J.J., Lathrop, J.I., Lutz, J.H., Mayordomo, E.: Finite-state dimension. Theor. Comput. Sci. 310, 1\u201333 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9417_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R. Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)"},{"issue":"1","key":"9417_CR10","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/S0304-3975(01)00340-1","volume":"289","author":"J.M. Hitchcock","year":"2002","unstructured":"Hitchcock, J.M.: MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theor. Comput. Sci. 289(1), 861\u2013869 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9417_CR11","unstructured":"Hitchcock, J.M.: Effective fractal dimension: foundations and applications. PhD thesis, Iowa State University (2003)"},{"issue":"1\u20133","key":"9417_CR12","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0304-3975(03)00138-5","volume":"304","author":"J.M. Hitchcock","year":"2003","unstructured":"Hitchcock, J.M.: Fractal dimension and logarithmic loss unpredictability. Theor. Comput. Sci. 304(1\u20133), 431\u2013441 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9417_CR13","first-page":"24","volume":"36","author":"J.M. Hitchcock","year":"2005","unstructured":"Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: The fractal geometry of complexity classes. SIGACT News 36, 24\u201338 (2005)","journal-title":"SIGACT News"},{"key":"9417_CR14","first-page":"174","volume-title":"Proceedings of the 19th IEEE Conference on Computational Complexity","author":"J.M. Hitchcock","year":"2004","unstructured":"Hitchcock, J.M., Vinodchandran, N.V.: Dimension, entropy rates, and compression. In: Proceedings of the 19th IEEE Conference on Computational Complexity, pp. 174\u2013183 (2004)"},{"key":"9417_CR15","first-page":"41","volume":"CT-6","author":"D.A. Huffman","year":"1959","unstructured":"Huffman, D.A.: Canonical forms for information-lossless finite-state logical machines. IRE Trans. Circuit Theory CT-6, 41\u201359 (1959). Also available in E.F. Moore (ed.), Sequential Machine: Selected Papers, pp.\u00a0866\u2013871. Addison-Wesley (1964)","journal-title":"IRE Trans. Circuit Theory"},{"key":"9417_CR16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"A. Lempel","year":"1977","unstructured":"Lempel, A., Ziv, J.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23, 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9417_CR17","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"A. Lempel","year":"1978","unstructured":"Lempel, A., Ziv, J.: Compression of individual sequences via variable rate coding. IEEE Trans. Inf. Theory 24, 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9417_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-1-4612-1872-2_10","volume-title":"Complexity Theory Retrospective II","author":"J.H. Lutz","year":"1997","unstructured":"Lutz, J.H.: The quantitative structure of exponential time. In: Hemaspaandra, L.A., Selman, A.L. (eds.) Complexity Theory Retrospective II, pp. 225\u2013254. Springer, Berlin (1997)"},{"key":"9417_CR19","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1137\/S0097539701417723","volume":"32","author":"J.H. Lutz","year":"2003","unstructured":"Lutz, J.H.: Dimension in complexity classes. SIAM J. Comput. 32, 1236\u20131259 (2003)","journal-title":"SIAM J. Comput."},{"key":"9417_CR20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"J.H. Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Inf. Comput. 187, 49\u201379 (2003)","journal-title":"Inf. Comput."},{"key":"9417_CR21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1002\/malq.200310127","volume":"51","author":"J.H. Lutz","year":"2005","unstructured":"Lutz, J.H.: Effective fractal dimensions. Math. Log. Q. 51, 62\u201372 (2005)","journal-title":"Math. Log. Q."},{"key":"9417_CR22","unstructured":"Mayordomo, E.: Contributions to the study of resource-bounded measure. PhD thesis, Universitat Polit\u00e8cnica de Catalunya (1994)"},{"issue":"1","key":"9417_CR23","doi-asserted-by":"crossref","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. Inf. Process. Lett. 84(1), 1\u20133 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9417_CR24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-0-387-68546-5_12","volume-title":"New Computational Paradigms: Changing Conceptions of What Is Computable","author":"E. Mayordomo","year":"2008","unstructured":"Mayordomo, E.: Effective fractal dimension in algorithmic information theory. In: New Computational Paradigms: Changing Conceptions of What Is Computable, pp. 259\u2013285. Springer, Berlin (2008)"},{"key":"9417_CR25","first-page":"219","volume":"30","author":"B.Ya. Ryabko","year":"1984","unstructured":"Ryabko, B.Ya.: Coding of combinatorial sources and Hausdorff dimension. Sov. Math. Dokl. 30, 219\u2013222 (1984)","journal-title":"Sov. Math. Dokl."},{"key":"9417_CR26","first-page":"170","volume":"22","author":"B.Ya. Ryabko","year":"1986","unstructured":"Ryabko, B.Ya.: Noiseless coding of combinatorial sources. Probl. Inf. Transm. 22, 170\u2013179 (1986)","journal-title":"Probl. Inf. Transm."},{"key":"9417_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1017","volume":"103","author":"L. Staiger","year":"1993","unstructured":"Staiger, L.: Kolmogorov complexity and Hausdorff dimension. Inf. Comput. 103, 159\u2013194 (1993)","journal-title":"Inf. Comput."},{"key":"9417_CR28","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s002240000086","volume":"31","author":"L. Staiger","year":"1998","unstructured":"Staiger, L.: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory Comput. Syst. 31, 215\u2013229 (1998)","journal-title":"Theory Comput. Syst."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9417-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9417-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9417-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:24Z","timestamp":1558684464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9417-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,21]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9417"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9417-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,21]]}}}