{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:32:42Z","timestamp":1743042762242,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319193144"},{"type":"electronic","value":"9783319193151"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_7","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T10:42:08Z","timestamp":1433587328000},"page":"74-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Minimum Length Representations of Sets of Words of Uniform Length"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Lohr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"7_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, New Jersey (1993)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-45278-9_4","volume-title":"Combinatorial Algorithms","author":"F Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Munteanu, S.: Deciding representability of sets of words of equal length in polynomial time. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 28\u201340. Springer, Heidelberg (2013)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2012.12.042","volume":"475","author":"F Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Simmons, S.: Deciding representability of sets of words of equal length. Theoret. Comput. Sci. 475, 34\u201346 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(92)00065-Y","volume":"123","author":"P Flajolet","year":"1994","unstructured":"Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., Tichy, F.: Mellin transforms and asymptotics: digital sums. Theoret. Comput. Sci. 123, 291\u2013314 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H Fredericksen","year":"1982","unstructured":"Fredericksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24, 195\u2013221 (1982)","journal-title":"SIAM Rev."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","volume":"20","author":"J Gallant","year":"1980","unstructured":"Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. J. Comput. Syst. Sci. 20, 50\u201358 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430\u2013466 (1990)","journal-title":"Math. Oper. Res."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/S0002-9939-1977-0429714-1","volume":"62","author":"H Harborth","year":"1977","unstructured":"Harborth, H.: Number of odd binomial coefficients. Proc. Amer. Math. Soc. 62, 19\u201322 (1977)","journal-title":"Proc. Amer. Math. Soc."},{"key":"7_CR9","volume-title":"Introduction to Modern Cryptography: Principles and Protocols. Cryptography and Network Security","author":"J Katz","year":"2008","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Cryptography and Network Security. Chapman & Hall\/CRC, Boca Raton (2008)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0136006","volume":"36","author":"JH van Lint","year":"1979","unstructured":"van Lint, J.H., MacWilliams, F.J., Sloane, N.J.A.: On pseudo-random arrays. SIAM J. Appl. Math. 36, 62\u201372 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-40579-2_26","volume-title":"Combinatorics on Words","author":"S Tan","year":"2013","unstructured":"Tan, S., Shallit, J.: Sets represented as the length-n factors of a word. In: Karhum\u00e4ki, J., Lepist\u00f6, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 250\u2013261. Springer, Heidelberg (2013)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T09:11:24Z","timestamp":1674205884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}