{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:34Z","timestamp":1759638394696},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452772"},{"type":"electronic","value":"9783642452789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_33","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T15:35:18Z","timestamp":1385393718000},"page":"388-401","source":"Crossref","is-referenced-by-count":6,"title":["Universal Cycles for Weight-Range Binary Strings"],"prefix":"10.1007","author":[{"given":"Joe","family":"Sawada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Bechel, A., LaBounty-Lay, B., Godbole, A.: Universal cycles of discrete functions. In: Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol.\u00a0189, pp. 121\u2013128. Congressus Numerantium (2008)"},{"issue":"4","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/100805674","volume":"25","author":"A. Blanca","year":"2011","unstructured":"Blanca, A., Godbole, A.: On universal cycles for new classes of combinatorial structures. SIAM J. Discret. Math.\u00a025(4), 1832\u20131842 (2011)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"33_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.37236\/276","volume":"17","author":"G. Brockman","year":"2010","unstructured":"Brockman, G., Kay, B., Snively, E.: On universal cycles of labeled graphs. Electronic Journal of Combinatorics\u00a017(1), 9 (2010)","journal-title":"Electronic Journal of Combinatorics"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"5332","DOI":"10.1016\/j.disc.2009.03.002","volume":"309","author":"K. Casteels","year":"2009","unstructured":"Casteels, K., Stevens, B.: Universal cycles for (n\u2009\u2212\u20091)-partitions of an n-set. Discrete Mathematics\u00a0309, 5332\u20135340 (2009)","journal-title":"Discrete Mathematics"},{"key":"33_CR5","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_CR6","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Akademie v. Wetenschappen\u00a049, 758\u2013764 (1946)","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"key":"33_CR7","unstructured":"de Bruijn, N.G.: Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once. T.H. Report 75-WSK-06, p. 13 (1975)"},{"issue":"4","key":"33_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.P. Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H. Fredericksen","year":"1986","unstructured":"Fredericksen, H., Kessler, I.J.: An algorithm for generating necklaces of beads in two colors. Discrete Mathematics\u00a061, 181\u2013188 (1986)","journal-title":"Discrete Mathematics"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredericksen","year":"1978","unstructured":"Fredericksen, H., Maiorana, J.: Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Mathematics\u00a023, 207\u2013210 (1978)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C. Hierholzer","year":"1873","unstructured":"Hierholzer, C., Wiener, C.: Ueber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen\u00a06(1), 30\u201332 (1873)","journal-title":"Mathematische Annalen"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00453-011-9544-z","volume":"64","author":"A.E. Holroyd","year":"2012","unstructured":"Holroyd, A.E., Ruskey, F., Williams, A.: Shorthand universal cycles for permutations. Algorithmica\u00a064(2), 215\u2013245 (2012)","journal-title":"Algorithmica"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0895480191220861","volume":"7","author":"G. Hurlbert","year":"1994","unstructured":"Hurlbert, G.: On universal cycles for k-subets of an n-element set. Siam Journal on Discrete Mathematics\u00a07, 598\u2013604 (1994)","journal-title":"Siam Journal on Discrete Mathematics"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Hurlbert, G., Jackson, B., Stevens, B. (eds.): Generalisations of de Bruijn sequences and Gray codes. Discrete Mathematics\u00a0309, 5255\u20135348 (2009)","DOI":"10.1016\/j.disc.2009.04.002"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0012-365X(93)90330-V","volume":"117","author":"B. Jackson","year":"1993","unstructured":"Jackson, B.: Universal cycles of k-subsets and k-permutations. Discrete Mathematics\u00a0117, 114\u2013150 (1993)","journal-title":"Discrete Mathematics"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"5264","DOI":"10.1016\/j.disc.2007.11.004","volume":"309","author":"R. Johnson","year":"2009","unstructured":"Johnson, R.: Universal cycles for permutations. Discrete Mathematics\u00a0309, 5264\u20135270 (2009)","journal-title":"Discrete Mathematics"},{"key":"33_CR17","unstructured":"Knuth, D.E.: Generating all tuples and permutations, fascicle 2. The Art of Computer Programming\u00a04 (2005)"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1016\/j.disc.2010.07.016","volume":"310","author":"A. Leitner","year":"2010","unstructured":"Leitner, A., Godbole, A.: Universal cycles of classes of restricted words. Discrete Mathematics\u00a0310, 3303\u20133309 (2010)","journal-title":"Discrete Mathematics"},{"key":"33_CR19","unstructured":"Rosen, K.H.: Discrete Mathematics and Its Applications, 5th edn. McGraw-Hill Higher Education (2002)"},{"issue":"2","key":"33_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/100808782","volume":"26","author":"F. Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: De Bruijn sequences for fixed-weight binary strings. SIAM Journal on Discrete Mathematics\u00a026(2), 605\u2013617 (2012)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"33_CR21","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/1798596.1798598","volume":"6","author":"F. Ruskey","year":"2010","unstructured":"Ruskey, F., Williams, A.: An explicit universal cycle for the (n\u2009\u2212\u20091)-permutations of an n-set. ACM Transactions on Algorithms 6(3), 12 (2010)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"33_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","volume":"119","author":"F. Ruskey","year":"2012","unstructured":"Ruskey, F., Williams, A., Sawada, J.: Binary bubble languages and cool-lex order. J. Comb. Theory, Ser. A\u00a0119(1), 155\u2013169 (2012)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Sawada, J., Ruskey, F.: An efficient algorithm for generating necklaces with fixed density. In: Tarjan, R.E., Warnow, T. (eds.) SODA, pp. 752\u2013758. ACM\/SIAM (1999)","DOI":"10.1137\/S0097539798344112"},{"key":"33_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-19094-0_19","volume-title":"WALCOM: Algorithms and Computation","author":"J. Sawada","year":"2011","unstructured":"Sawada, J., Stevens, B., Williams, A.: De bruijn sequences for the binary strings with maximum density. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol.\u00a06552, pp. 182\u2013190. Springer, Heidelberg (2011)"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-30347-0_32","volume-title":"Fun with Algorithms","author":"B. Stevens","year":"2012","unstructured":"Stevens, B., Williams, A.: The coolest order of binary strings. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol.\u00a07288, pp. 322\u2013333. Springer, Heidelberg (2012)"},{"key":"33_CR26","doi-asserted-by":"crossref","unstructured":"Stevens, B., Williams, A.: The coolest way to generate binary strings. Theory of Computing Systems, 1\u201327 (2013)","DOI":"10.1007\/s00224-013-9486-8"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T10:03:14Z","timestamp":1716199394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}