{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:13:38Z","timestamp":1725578018221},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_19","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T01:21:40Z","timestamp":1297300900000},"page":"182-190","source":"Crossref","is-referenced-by-count":8,"title":["De Bruijn Sequences for the Binary Strings with Maximum Density"],"prefix":"10.1007","author":[{"given":"Joe","family":"Sawada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brett","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_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":"19_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"},{"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, Technological University Eindhoven, 13 pages (1975)","key":"19_CR3"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","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 kary de Bruijn sequences. Discrete Mathematics\u00a023(3), 207\u2013210 (1978)","journal-title":"Discrete Mathematics"},{"key":"19_CR5","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":"19_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0012-365X(99)00230-7","volume":"215","author":"S.G. Hartke","year":"2000","unstructured":"Hartke, S.G.: Binary De Bruijn Cycles under Different Equivalence Relations. Discrete Mathematics\u00a0215, 93\u2013102 (2000)","journal-title":"Discrete Mathematics"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"5255","DOI":"10.1016\/j.disc.2008.04.050","volume":"309","author":"G. Hurlbert","year":"2009","unstructured":"Hurlbert, G., Jackson, B., Stevens, B.(eds.): Generalisations of de Bruijn sequences and Gray codes. Discrete Mathematics\u00a0309, 5255\u20135348 (2009)","journal-title":"Discrete Mathematics"},{"key":"19_CR8","volume-title":"The Art of Computer Programming, Volume 4, Generating all tuples and permutations, Fascicle","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Generating all tuples and permutations, Fascicle, vol.\u00a02. Addison-Wesley, Reading (2005)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/0196-6774(92)90047-G","volume":"13","author":"F. Ruskey","year":"1992","unstructured":"Ruskey, F., Savage, C., Wang, T.M.Y.: Generating necklaces. J. Algorithms\u00a013, 414\u2013430 (1992)","journal-title":"J. Algorithms"},{"unstructured":"Ruskey, F., Sawada, J., Williams, A.: Fixed-density de Bruijn sequences (submitted, 2010)","key":"19_CR10"},{"unstructured":"Ruskey, F., Sawada, J., Williams, A.: Binary bubble languages and cool-lex order (submitted, 2010)","key":"19_CR11"},{"issue":"309","key":"19_CR12","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"17","author":"F. Ruskey","year":"2009","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discrete Mathematics\u00a017(309), 5305\u20135320 (2009)","journal-title":"Discrete Mathematics"},{"unstructured":"Sawada, J., Williams, A.: A Gray Code for fixed-density necklace and Lyndon words in constant amortized time (submitted, 2010)","key":"19_CR13"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T04:11:05Z","timestamp":1553400665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}