{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:50Z","timestamp":1759847270693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_29","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"304-314","source":"Crossref","is-referenced-by-count":2,"title":["Dimension Spectra of Lines"],"prefix":"10.1007","author":[{"given":"Neil","family":"Lutz","sequence":"first","affiliation":[]},{"given":"D. M.","family":"Stull","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/S0097539703446912","volume":"37","author":"KB 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(3), 671\u2013705 (2007)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"29_CR2","doi-asserted-by":"crossref","first-page":"3027","DOI":"10.1090\/S0002-9947-2014-05912-6","volume":"366","author":"R Dougherty","year":"2014","unstructured":"Dougherty, R., Lutz, J., Mauldin, R.D., Teutsch, J.: Translating the Cantor set by a random real. Trans. Am. Math. Soc. 366(6), 3027\u20133041 (2014)","journal-title":"Trans. Am. Math. Soc."},{"key":"29_CR3","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, New York (2010)"},{"issue":"11","key":"29_CR4","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1016\/j.apal.2014.07.001","volume":"165","author":"G Xiaoyang","year":"2014","unstructured":"Xiaoyang, G., Lutz, J.H., Mayordomo, E., Moser, P.: Dimension spectra of random subfractals of self-similar fractals. Ann. Pure Appl. Logic 165(11), 1707\u20131726 (2014)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"5","key":"29_CR5","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s00224-004-1122-1","volume":"38","author":"JM Hitchcock","year":"2005","unstructured":"Hitchcock, J.M.: Correspondence principles for effective dimensions. Theory Comput. Syst. 38(5), 559\u2013571 (2005)","journal-title":"Theory Comput. Syst."},{"key":"29_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, New York (2008)","edition":"3"},{"issue":"1","key":"29_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Inf. Comput. 187(1), 49\u201379 (2003)","journal-title":"Inf. Comput."},{"key":"29_CR8","unstructured":"Lutz, J.H., Lutz, N.: Algorithmic information, plane Kakeya sets, and conditional dimension. In: Vollmer, H., Vallee, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol. 66, pp. 53:1\u201353:13. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Germany (2017)"},{"issue":"3","key":"29_CR9","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1137\/070684689","volume":"38","author":"JH Lutz","year":"2008","unstructured":"Lutz, J.H., Mayordomo, E.: Dimensions of points in self-similar fractals. SIAM J. Comput. 38(3), 1080\u20131112 (2008)","journal-title":"SIAM J. Comput."},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-55911-7_31","volume-title":"Theory and Applications of Models of Computation","author":"N Lutz","year":"2017","unstructured":"Lutz, N., Stull, D.M.: Bounding the dimension of points on a line. In: Gopal, T.V., J\u00e4ger, G., Steila, S. (eds.) TAMC 2017. LNCS, vol. 10185, pp. 425\u2013439. Springer, Cham (2017). doi:\n10.1007\/978-3-319-55911-7_31"},{"issue":"1","key":"29_CR11","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."},{"issue":"1","key":"29_CR12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.apal.2008.06.015","volume":"156","author":"J Reimann","year":"2008","unstructured":"Reimann, J.: Effectively closed classes of measures and randomness. Ann. Pure Appl. Logic 156(1), 170\u2013182 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"29","key":"29_CR13","doi-asserted-by":"crossref","first-page":"3598","DOI":"10.1016\/j.tcs.2011.03.006","volume":"412","author":"D Turetsky","year":"2011","unstructured":"Turetsky, D.: Connectedness properties of dimension level sets. Theor. Comput. Sci. 412(29), 3598\u20133603 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR14","unstructured":"Westrick, L.B.: Computability in ordinal ranks and symbolic dynamics. Ph.D. thesis, University of California, Berkeley (2014)"},{"key":"29_CR15","unstructured":"Wolff, T.: Recent work connected with the Kakeya problem. In: Prospects in Mathematics, pp. 129\u2013162 (1999)"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T09:04:09Z","timestamp":1504170249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}