{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:35Z","timestamp":1775638475724,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319559100","type":"print"},{"value":"9783319559117","type":"electronic"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_31","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"425-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Bounding the Dimension of Points on a Line"],"prefix":"10.1007","author":[{"given":"Neil","family":"Lutz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. M.","family":"Stull","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2786566","volume":"7","author":"A Case","year":"2015","unstructured":"Case, A., Lutz, J.H.: Mutual dimension. ACM Trans. Comput. Theory 7(3), 12 (2015)","journal-title":"ACM Trans. Comput. Theory"},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0305004100046867","volume":"69","author":"RO Davies","year":"1971","unstructured":"Davies, R.O.: Some remarks on the Kakeya problem. Proc. Cambridge Philos. Soc. 69, 417\u2013421 (1971)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"31_CR3","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.H., Mauldin, R.D., Teutsch, J.: Translating the Cantor set by a random real. Trans. Am. Math. Soc. 366, 3027\u20133041 (2014)","journal-title":"Trans. Am. Math. Soc."},{"key":"31_CR4","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)"},{"key":"31_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623738","volume-title":"The Geometry of Fractal Sets","author":"KJ Falconer","year":"1985","unstructured":"Falconer, K.J.: The Geometry of Fractal Sets. Cambridge University Press, Cambridge (1985)"},{"key":"31_CR6","first-page":"1477","volume":"15","author":"P G\u00e1cs","year":"1974","unstructured":"G\u00e1cs, P.: On the symmetry of algorithmic information. Sov. Math. Dokl. 15, 1477\u20131480 (1974)","journal-title":"Sov. Math. Dokl."},{"issue":"11","key":"31_CR7","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1016\/j.apal.2014.07.001","volume":"165","author":"X Gu","year":"2014","unstructured":"Gu, X., 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":"31_CR8","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":"31_CR9","first-page":"149","volume":"7","author":"NH Katz","year":"2001","unstructured":"Katz, N.H., Tao, T.: Some connections between Falconer\u2019s distance set conjecture and sets of Furstenburg type. N. Y. J. Math. 7, 149\u2013187 (2001)","journal-title":"N. Y. J. Math."},{"key":"31_CR10","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":"5","key":"31_CR11","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1137\/S0097539701417723","volume":"32","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: Dimension in complexity classes. SIAM J. Comput. 32(5), 1236\u20131259 (2003)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"31_CR12","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."},{"issue":"2","key":"31_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/COM-150038","volume":"4","author":"JH Lutz","year":"2015","unstructured":"Lutz, J.H., Lutz, N.: Lines missing every random point. Computability 4(2), 85\u2013102 (2015)","journal-title":"Computability"},{"key":"31_CR14","unstructured":"Lutz, J.H., Lutz, N.: Algorithmic information, plane Kakeya sets, and conditional dimension. In: Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany (to appear)"},{"issue":"3","key":"31_CR15","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":"31_CR16","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1002\/malq.200710060","volume":"54","author":"JH Lutz","year":"2008","unstructured":"Lutz, J.H., Weihrauch, K.: Connectivity properties of dimension level sets. Math. Logic Q. 54, 483\u2013491 (2008)","journal-title":"Math. Logic Q."},{"key":"31_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623813","volume-title":"Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability","author":"P Mattila","year":"1995","unstructured":"Mattila, P.: Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"31_CR18","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":"31_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-0-387-68546-5_12","volume-title":"New Computational Paradigms: Changing Conceptions of What is Computable, Observation of Strains","author":"E Mayordomo","year":"2008","unstructured":"Mayordomo, E.: Effective fractal dimension in algorithmic information theory. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms: Changing Conceptions of What is Computable, Observation of Strains, pp. 259\u2013285. Springer, New York (2008). doi:\n10.1007\/978-0-387-68546-5_12"},{"key":"31_CR20","unstructured":"Mayordomo, E.: Effective dimension in some general metric spaces. In: Proceedings of the 8th International Workshop on Developments in Computational Models, DCM 2012, Cambridge, United Kingdom, 17 June 2012, pp. 67\u201375 (2012)"},{"key":"31_CR21","unstructured":"Miller, J.S.: \u201cOpen Questions\u201d section of personal webpage. \nhttp:\/\/www.math.wisc.edu\/jmiller\/open.html\n\n. Accessed 30 Oct 2016"},{"key":"31_CR22","doi-asserted-by":"crossref","first-page":"2753","DOI":"10.1090\/S0002-9939-2011-11111-0","volume":"140","author":"U Molter","year":"2012","unstructured":"Molter, U., Rela, E.: Furstenberg sets for a fractal set of directions. Proc. Am. Math. Soc. 140, 2753\u20132765 (2012)","journal-title":"Proc. Am. Math. Soc."},{"key":"31_CR23","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press Inc., New York (2009)"},{"key":"31_CR24","series-title":"Operator Theory: Advances and Applications","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-0348-0648-0_27","volume-title":"Concrete Operators, Spectral Theory, Operators in Harmonic Analysis and Approximation","author":"E Rela","year":"2014","unstructured":"Rela, E.: Refined size estimates for Furstenberg sets via Hausdorff measures: a survey of some recent results. In: Cepedello Boiso, M., Hedenmalm, H., Kaashoek, M.A., Montes Rodr\u00edguez, A., Treil, S. (eds.) Concrete Operators, Spectral Theory, Operators in Harmonic Analysis and Approximation. OTAA, vol. 236, pp. 421\u2013454. Springer, Basel (2014). doi:\n10.1007\/978-3-0348-0648-0_27"},{"issue":"29","key":"31_CR25","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":"31_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K., Analysis, C.: Computable Analysis: An Introduction. Springer, Heidelberg (2000)"},{"key":"31_CR27","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","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T04:13:42Z","timestamp":1511324022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}