{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:37Z","timestamp":1725798637686},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_12","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:12:23Z","timestamp":1407823943000},"page":"135-146","source":"Crossref","is-referenced-by-count":1,"title":["Universal Lyndon Words"],"prefix":"10.1007","author":[{"given":"Arturo","family":"Carpi","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[]},{"given":"\u0160t\u011bp\u00e1n","family":"Holub","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Opr\u0161al","sequence":"additional","affiliation":[]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(99)00334-5","volume":"259","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Words and special factors. Theoret. Comput. Sci.\u00a0259(1-2), 145\u2013182 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR2","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 Math.\u00a0110, 43\u201359 (1992)","journal-title":"Discrete Math."},{"issue":"2","key":"12_CR3","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"},{"issue":"1-3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"141","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 Math.\u00a0117(1-3), 141\u2013150 (1993)","journal-title":"Discrete Math."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on words. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"12_CR6","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 Trans. Algorithms\u00a06(3), article 45 (2010)","DOI":"10.1145\/1798596.1798598"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T10:42:41Z","timestamp":1558953761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}