{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:45Z","timestamp":1725562785933},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642305"},{"type":"electronic","value":"9783540697053"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028587","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:33:39Z","timestamp":1132626819000},"page":"522-532","source":"Crossref","is-referenced-by-count":1,"title":["Bounded size dictionary compression: SCk-completeness and NC algorithms"],"prefix":"10.1007","author":[{"given":"Sergio","family":"De Agostino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"45_CR1","unstructured":"Bell, T.C., J.G. Cleary and I.H. Witten [1990]. Text Compression, Prentice Hall."},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/0206054","volume":"6","author":"A. Borodin","year":"1977","unstructured":"Borodin, A. [1977]. \u201cOn Relating Time and Space to Size and Depth\u201d, SIAM Journal on Computing\n                6, 733\u2013744.","journal-title":"SIAM Journal on Computing"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A. [1979]. \u201cDeterministic CFL's are accepted simultaneously in Polynomial Time and Log Squared Space\u201d, 11th Ann. ACM Symposium on Theory of Computing, 338\u2013345.","DOI":"10.1145\/800135.804426"},{"key":"45_CR4","first-page":"99","volume":"27","author":"S.A. Cook","year":"1981","unstructured":"Cook, S.A. [1981]. \u201cTowards a Complexity Theory of Synchronous Parallel Computation\u201d, Enseignement Mathematique\n                27, 99\u2013124.","journal-title":"Enseignement Mathematique"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S.A. Cook","year":"1985","unstructured":"Cook, S.A. [1985]. \u201cA Taxonomy of Problems with Fast Parallel Algorithms\u201d, Information and Control\n                64, 2\u201322.","journal-title":"Information and Control"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(91)90223-5","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M. and W. Rytter [1991]. \u201cEfficient Parallel Algorithms to Test Square-freeness and Factorize Strings\u201d, Information Processing Letters\n                38, 57\u201360.","journal-title":"Information Processing Letters"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)90106-6","volume":"127","author":"S. Agostino De","year":"1994","unstructured":"De Agostino, S. [1994]. \u201cP-complete Problems in Data Compression\u201d, Theoretical Computer Science\n                127, 181\u2013186.","journal-title":"Theoretical Computer Science"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(94)00213-3","volume":"141","author":"A. Dessmark","year":"1995","unstructured":"Dessmark, A., A. Lingas and A. Maheshwari [1995]. \u201cMulti-list Layering: Complexity and Applications\u201d, Theoretical Computer Science\n                141, 337\u2013350.","journal-title":"Theoretical Computer Science"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(89)90009-6","volume":"80","author":"P.W. Dymond","year":"1989","unstructured":"Dymond, P.W. and S.A. Cook [1989]. \u201cComplexity Theory of Parallel Time and Hardware\u201d, Information and Computation\n                80, 205\u2013226.","journal-title":"Information and Computation"},{"key":"45_CR10","unstructured":"Greenlaw, R., H.J. Hoover and W.L. Ruzzo [1995]. Limits to Parallel Computation, Oxford University Press."},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Johnson, D.S. [1990]. \u201cA Catalog of Complexity Classes\u201d Handbook of Theoretical Computer Science: Algorithms and Complexity, MIT Press\/Elsevier (van Leeuwen J., editor), 67\u2013162.","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"A. Lempel","year":"1977","unstructured":"Lempel, A. and J. Ziv [1977]. \u201cA Universal Algorithm for Sequential Data Compression\u201d, IEEE Transactions on Information Theory\n                23, 337\u2013343.","journal-title":"IEEE Transactions on Information Theory"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/71.139209","volume":"3","author":"S. Olariu","year":"1992","unstructured":"Olariu, S., J.L. Schwing and J. Zhang [1992]. \u201cOptimal Parallel Algorithms for Problems Modeled by a Family of Intervals\u201d, IEEE Transactions on Parallel and Distributed Systems\n                3, 364\u2013374.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Pippenger, N. [1979]. \u201cOn Simultaneous Resource Bounds\u201d, 20th Ann. Symposium on Foundations of Computer Science, 307\u2013311.","DOI":"10.1109\/SFCS.1979.29"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N. and M.J. Fischer [1979]. \u201cRelations Among Complexity Measures\u201d, Journal of the ACM\n                26, 361\u2013381.","journal-title":"Journal of the ACM"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W.L. Ruzzo","year":"1981","unstructured":"Ruzzo, W.L. [1981]. \u201cOn Uniform Circuit Complexity\u201d, Journal of Computer and System Sciences\n                22, 365\u2013383.","journal-title":"Journal of Computer and System Sciences"},{"key":"45_CR17","unstructured":"Storer, J.A. [1988]. Data Compression: Methods and Theory (Computer Science Press)."},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Storer, J.A. [1992]. \u201cMassively Parallel Systolic Algorithms for Real-Time Dictionary-Based Text Compression\u201d Image and Text Compression, Kluwer Accademic Publishers (Storer J.A., editor), 159\u2013178.","DOI":"10.1007\/978-1-4615-3596-6_7"},{"key":"45_CR19","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J. and A. Lempel [1978]. \u201cCompression of Individual Sequences via Variable Rate Coding\u201d, IEEE Transactions on Information Theory\n                24, 530\u2013536.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","STACS 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T18:32:46Z","timestamp":1552933966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0028587","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}