{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:03Z","timestamp":1725558783007},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_33","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"298-307","source":"Crossref","is-referenced-by-count":5,"title":["Faster Generation of Shorthand Universal Cycles for Permutations"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Holroyd","sequence":"first","affiliation":[]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F. Chung","year":"1992","unstructured":"Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Mathematics\u00a0110, 43\u201359 (1992)","journal-title":"Discrete Mathematics"},{"key":"33_CR2","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A Combinatorial Problem. Koninkl. Nederl. Acad. Wetensch. Proc. Ser A\u00a049, 758\u2013764 (1946)","journal-title":"Koninkl. Nederl. Acad. Wetensch. Proc. Ser A"},{"key":"33_CR3","unstructured":"Duckworth, R., Stedman, F.: Tintinnalogia (1668)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(94)00314-9","volume":"149","author":"B. Jackson","year":"1996","unstructured":"Jackson, B.: Universal cycles of k-subsets and k-permutations. Discrete Mathematics\u00a0149, 123\u2013129 (1996)","journal-title":"Discrete Mathematics"},{"key":"33_CR5","series-title":"Generating All Tuples and Permutations, Fascicle 2","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming. Generating All Tuples and Permutations, Fascicle 2, vol.\u00a04. Addison-Wesley, Reading (2005)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F. Ruskey","year":"2009","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discrete Mathematics\u00a0309, 5305\u20135320 (2009)","journal-title":"Discrete Mathematics"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Ruskey, F., Williams, A.: An explicit universal cycle for the (n\u2009\u2212\u20091)-permutations of an n-set. ACM Transactions on Algorithms (in press)","DOI":"10.1145\/1798596.1798598"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"771","DOI":"10.2307\/2974446","volume":"103","author":"A.T. White","year":"1996","unstructured":"White, A.T.: Fabian Stedman: The First Group Theorist? The American Mathematical Monthly\u00a0103, 771\u2013778 (1996)","journal-title":"The American Mathematical Monthly"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Williams, A.: Loopless Generation of Multiset Permutations Using a Constant Number of Variables by Prefix Shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, pp. 987\u2013996.","DOI":"10.1137\/1.9781611973068.107"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:28Z","timestamp":1619784988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}