{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:16:27Z","timestamp":1725804987881},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_24","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"406-423","source":"Crossref","is-referenced-by-count":1,"title":["The Arithmetic of Recursively Run-Length Compressed Natural Numbers"],"prefix":"10.1007","author":[{"given":"Paul","family":"Tarau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4271","key":"24_CR1","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1126\/science.194.4271.1235","volume":"194","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Mathematics and Computer Science: Coping with Finiteness. Science\u00a0194(4271), 1235\u20131242 (1976)","journal-title":"Science"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Goodstein, R.: On the restricted ordinal theorem. Journal of Symbolic Logic\u00a0(9), 33\u201341 (1944)","DOI":"10.2307\/2268019"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Conway, J.H.: On Numbers and Games, 2nd edn. AK Peters, Ltd. (2000)","DOI":"10.1201\/9781439864159"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Tarau, P., Buckles, B.: Arithmetic Algorithms for Hereditarily Binary Natural Numbers. In: Proceedings of SAC 2014, ACM Symposium on Applied Computing, PL track, Gyeongju, Korea. ACM (March 2014)","DOI":"10.1109\/SYNASC.2014.23"},{"key":"24_CR5","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics. Wadsworth Publ. Co., Belmont (1986)","DOI":"10.1007\/978-1-4615-9763-6"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-04921-2_46","volume-title":"Language and Automata Theory and Applications","author":"P. Tarau","year":"2014","unstructured":"Tarau, P.: Computing with Catalan Families. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol.\u00a08370, pp. 565\u2013575. Springer, Heidelberg (2014)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Kiselyov, O., Byrd, W.E., Shan, C.-C.: Pure, declarative, and constructive arithmetic relations (declarative pearl). In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol.\u00a04989, pp. 64\u201380. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78969-7_7"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Tarau, P., Haraburda, D.: On Computing with Types. In: Proceedings of SAC 2012, ACM Symposium on Applied Computing, PL track, Riva del Garda (Trento), Italy, pp. 1889\u20131896 (March 2012)","DOI":"10.1145\/2245276.2232087"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Vuillemin, J.: Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. In: 19th IEEE Symposium on Computer Arithmetic, ARITH 2009, pp. 7\u201314 (June 2009)","DOI":"10.1109\/ARITH.2009.25"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Tarau, P.: Declarative Modeling of Finite Mathematics. In: PPDP 2010: Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 131\u2013142. ACM, New York (2010)","DOI":"10.1145\/1836089.1836107"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications. Springer-Verlag New York, Inc., New York (1993)","DOI":"10.1007\/978-1-4757-3860-5"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T21:09:37Z","timestamp":1558991377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}