{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:45Z","timestamp":1760202705698,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"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_10","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"129-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Resource-Bounded Versions of the van Lambalgen Theorem"],"prefix":"10.1007","author":[{"given":"Diptarka","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyadev","family":"Nandakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Himanshu","family":"Shukla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"10_CR1","volume-title":"Random Sequences","author":"M Lambalgen van","year":"1987","unstructured":"van Lambalgen, M.: Random Sequences. Academish Proefschri\u2019t, Amsterdam (1987)"},{"key":"10_CR2","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., Oxford (2009)"},{"key":"10_CR3","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic randomness and complexity. Book Draft (2006)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1090\/S0002-9939-06-08541-8","volume":"135","author":"L Yu","year":"2007","unstructured":"Yu, L.: When van Lambalgen\u2019s theorem fails. Proc. Am. Math. Soc. 135(3), 861\u2013864 (2007)","journal-title":"Proc. Am. Math. Soc."},{"key":"10_CR5","series-title":"Basic Techniques","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Techniques, vol. 1. Cambridge University Press, Cambridge (2001)"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1006\/inco.1995.1120","volume":"121","author":"L Longpr\u00e9","year":"1995","unstructured":"Longpr\u00e9, L., Watanabe, O.: On symmetry of information and polynomial-time invertibility. Inf. Comput. 121, 14\u201322 (1995)","journal-title":"Inf. Comput."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.tcs.2005.07.017","volume":"345","author":"T Lee","year":"2005","unstructured":"Lee, T., Romaschenko, A.: Resource-bounded symmetry of information revisited. Theor. Comput. Sci. 345, 386\u2013405 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","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, Berlin (2008)","edition":"3"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Lutz, J.H.: Resource-bounded measure. In: Proceedings of the 13th IEEE Conference on Computational Complexity, pp. 236\u2013248. IEEE Computer Society Press, New York (1998)","DOI":"10.1109\/CCC.1998.694611"},{"issue":"4","key":"10_CR10","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1137\/050628994","volume":"35","author":"E Allender","year":"2006","unstructured":"Allender, E., Buhrman, H., Kouck\u00fd, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(4), 1467\u20131493 (2006)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10_CR11","doi-asserted-by":"crossref","first-page":"3193","DOI":"10.1090\/S0002-9947-08-04395-X","volume":"360","author":"JS Miller","year":"2008","unstructured":"Miller, J.S., Yu, L.: On initial segment complexity and degrees of randomness. Trans. Am. Math. Soc. 360(6), 3193\u20133210 (2008)","journal-title":"Trans. Am. Math. Soc."}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T03:59:42Z","timestamp":1511323182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}