{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:31Z","timestamp":1761621031787},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,23]],"date-time":"2010-03-23T00:00:00Z","timestamp":1269302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10852-010-9131-3","type":"journal-article","created":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T11:04:53Z","timestamp":1269255893000},"page":"343-356","source":"Crossref","is-referenced-by-count":4,"title":["Loop-Free Gray Code Algorithms for the Set of Compositions"],"prefix":"10.1007","volume":"9","author":[{"given":"Toufik","family":"Mansour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghalib","family":"Nassar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,23]]},"reference":[{"key":"9131_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.dam.2003.06.002","volume":"140","author":"J-L Baril","year":"2004","unstructured":"Baril, J.-L., Vajnovszki, V.: Gray code for derangements. Disc. App. Math. 140, 207\u2013221 (2004)","journal-title":"Disc. App. Math."},{"key":"9131_CR2","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. Assoc. Comput. Mach. 20, 500\u2013513 (1973)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9131_CR3","doi-asserted-by":"crossref","DOI":"10.1201\/9781420072686","volume-title":"Combinatorics of Compositions and Words, Discrete Mathematics and its Applications (Boca Raton)","author":"S Heubach","year":"2009","unstructured":"Heubach, S., Mansour, T.: Combinatorics of Compositions and Words, Discrete Mathematics and its Applications (Boca Raton). CRC, Boca Raton (2009)"},{"key":"9131_CR4","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"SM Johson","year":"1963","unstructured":"Johson, S.M.: Generating of permutations by adjacent transposition. Math. Comput. 17, 282\u2013285 (1963)","journal-title":"Math. Comput."},{"key":"9131_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0196-6774(82)90006-2","volume":"3","author":"P Klingsberg","year":"1982","unstructured":"Klingsberg, P.: A Gray code for compositions. J Algorithm 3, 41\u201344 (1982)","journal-title":"J Algorithm"},{"key":"9131_CR6","volume-title":"The Art of Computer Programming, vol. 3, (soring and searching)","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3, (soring and searching). Addison-Wesley, Reading (1973)"},{"key":"9131_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(92)90170-Z","volume":"41","author":"CW Ko","year":"1992","unstructured":"Ko, C.W., Ruskey, F.: Generating permutations of a bag by interchanges. Inform. Processing Lett. 41, 263\u2013269 (1992)","journal-title":"Inform. Processing Lett."},{"key":"9131_CR8","unstructured":"Korsh, J.F., LaFollette, P.S.: Loopless array generation of multiset permutations. Technical Report, Department of CIS , PA, USA (2002)"},{"key":"9131_CR9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jagm.1997.0889","volume":"25","author":"JF Korsh","year":"1997","unstructured":"Korsh, J.F., Lipschutz, S.: Generating multiset permutations in constant time. J. Algorithm 25, 321\u2013335 (1997)","journal-title":"J. Algorithm"},{"key":"9131_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10852-008-9086-9","volume":"7.3","author":"T Mansour","year":"2008","unstructured":"Mansour, T., Nassar, G.: Gray codes, loopless algorithm and partitions. J. Math. Model Algor. 7.3, 291\u2013310 (2008)","journal-title":"J. Math. Model Algor."},{"key":"9131_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(92)90204-N","volume":"36:1","author":"D Roelants van Baronaigien","year":"1992","unstructured":"Roelants van Baronaigien, D., Ruskey, F.: Generating permutations with given ups and downs. Disc. Appl. Math. 36:1, 57\u201365 (1992)","journal-title":"Disc. Appl. Math."},{"key":"9131_CR12","first-page":"85","volume":"10","author":"F Ruskey","year":"1994","unstructured":"Ruskey, F., Savage, C.D.: Gray codes for set partitions and restricted growth tails. Aust. J. Combin. 10, 85\u201396 (1994)","journal-title":"Aust. J. Combin."},{"key":"9131_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-46632-0_25","volume":"1741","author":"T Takaoka","year":"1999","unstructured":"Takaoka, T.: An O(1) time algorithm for generating multiset permutations. Lect. Notes Comp. Sci. 1741, 237\u2013246 (1999)","journal-title":"Lect. Notes Comp. Sci."},{"key":"9131_CR14","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"HF Trotter","year":"1962","unstructured":"Trotter, H.F.: Algorithm 115, permutations. Comm. ACM 5, 434\u2013435 (1962)","journal-title":"Comm. ACM"},{"key":"9131_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(98)00155-0","volume":"68","author":"V Vajnovszki","year":"1998","unstructured":"Vajnovszki, V.: On the loopless generation of binary tree sequences. Inform. Process. Lett. 68, 113\u2013117 (1998)","journal-title":"Inform. Process. Lett."},{"key":"9131_CR16","doi-asserted-by":"crossref","unstructured":"Vajnovszki, V.: A loopless generation of bitstrings without p consecutive ones. In: Combinatorics, computability and logic, pp. 227\u2013240. Springer Ser. Discrete Math. Theor. Comput. Sci. Springer, London (2001)","DOI":"10.1007\/978-1-4471-0717-0_19"},{"key":"9131_CR17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0304-3975(03)00228-7","volume":"307","author":"V Vajnovszki","year":"2003","unstructured":"Vajnovszki, V.: A loopless algorithm for generating the permutations of a multiset. Theoret. Comput. Sci. 307, 415\u2013431 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"9131_CR18","first-page":"323","volume":"33","author":"T Walsh","year":"2000","unstructured":"Walsh, T.: Loop-free sequencing of bounded integer compositions. J. Combin. Math. and Combin. Comput. 33, 323\u2013345 (2000)","journal-title":"J. Combin. Math. and Combin. Comput."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9131-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-010-9131-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9131-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T04:12:14Z","timestamp":1685506334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-010-9131-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,23]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9131"],"URL":"https:\/\/doi.org\/10.1007\/s10852-010-9131-3","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,23]]}}}