{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:18Z","timestamp":1725489318912},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442400"},{"type":"electronic","value":"9783540457930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45793-3_4","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:03:26Z","timestamp":1187251406000},"page":"44-58","source":"Crossref","is-referenced-by-count":1,"title":["Bijections between Partitions by Two-Directional Rewriting Techniques"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"4_CR1","unstructured":"George E. Andrews. The Theory of Partitions, Cambridge University Press, 1998"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, volume B, pp 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"41","key":"4_CR4","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1073\/pnas.78.4.2026","volume":"78","author":"A.M. Garsia","year":"1981","unstructured":"A.M. Garsia and S.C. Milne, Method for constructing bijections for classical partition identities. Proc. Nat. Acad. Sci. U.S.A. 78 (1981), no. 4(1), 2026\u20132028.","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(83)90043-2","volume":"34","author":"B. Gordon","year":"1983","unstructured":"Basil Gordon, Sieve-equivalence and explicit bijections, J. Combin. Theory Ser. A 34 (1983), no. 1, 90\u201393.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1112\/plms\/s2-17.1.75","volume":"17","author":"G. H. Hardy","year":"1918","unstructured":"G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. 17 (1918), 175\u2013115.","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0097-3165(88)90026-X","volume":"49","author":"K. M. OHara","year":"1988","unstructured":"Kathleen M. O\u2019Hara, Bijections for partition identities. J. Combin. Theory Ser. A 49 (1988), no. 1, 13\u201325.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4_CR8","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D.M. Gabbay, and T. S.E. Maibaum, ed., Handbook of Logic in Computer Science, volume 2, pp 1\u2013116. Oxford University Press, New York, 1992."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0097-3165(82)90040-1","volume":"33","author":"B. Jeffrey","year":"1982","unstructured":"Jeffrey B. Remmel, Bijective proofs of some classical partition identities, J. Combin. Theory Ser. A 33 (1982), 273\u2013286.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0097-3165(83)90042-0","volume":"34","author":"H. S. Wilf","year":"1983","unstructured":"Herbert S. Wilf, Sieve equivalence in generalized partition theory, J. Combin. Theory Ser. A 34 (1983), 80\u201389.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4_CR11","volume-title":"Lectures on Integer Partitions","author":"H. S. Wilf","year":"2000","unstructured":"Herbert S. Wilf, Lectures on Integer Partitions, University of Victoria, Victoria, B.C., Canada, 2000, (< http:\/\/cis.upenn.edu\/~wilf >)."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45793-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:33:57Z","timestamp":1556757237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45793-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442400","9783540457930"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45793-3_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}