{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T20:56:14Z","timestamp":1763931374282},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540445234"},{"type":"electronic","value":"9783540445241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11863854_15","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T04:27:22Z","timestamp":1158640042000},"page":"180-189","source":"Crossref","is-referenced-by-count":22,"title":["On Lempel-Ziv Complexity of Sequences"],"prefix":"10.1007","author":[{"given":"Ali","family":"Do\u011fanaksoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faruk","family":"G\u00f6lo\u011flu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"IT-22","author":"A. Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory\u00a0IT-22, 75\u201381 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a0IT-23, 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR3","unstructured":"Soto, J.: Statistical testing of random number generators. In: Proceedings of the 22nd National Information Systems Security Conference, Crystal City, Virginia (1999)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Szpankowski, W.: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees. Theoretical Computer Science\u00a0144 (1995)","DOI":"10.1016\/0304-3975(94)00298-W"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-46416-6_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"S. Mund","year":"1991","unstructured":"Mund, S.: Ziv-Lempel complexity for periodic sequences and its cryptographic application. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 114\u2013126. Springer, Heidelberg (1991)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0097539790189368","volume":"23","author":"P. Kirschenhofer","year":"1994","unstructured":"Kirschenhofer, P., Prodinger, H., Szpankowski, W.: Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM Journal on Computing\u00a023, 598\u2013616 (1994)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Sequences and Their Applications \u2013 SETA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11863854_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:20:58Z","timestamp":1619493658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11863854_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540445234","9783540445241"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11863854_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}