{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:10:17Z","timestamp":1725484217820},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438649"},{"type":"electronic","value":"9783540454656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_72","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"845-855","source":"Crossref","is-referenced-by-count":2,"title":["Approximating Huffman Codes in Parallel"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"key":"72_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1006\/jcss.1998.1580","volume":"57","author":"A. Andersson","year":"1998","unstructured":"Andersson, A., Hagerup, T., Nilsson, S. Raman, R. Sorting in Linear Time?, Journal of Computer and System Sciences 57 (1998), pp. 74\u201393","journal-title":"Journal of Computer and System Sciences"},{"key":"72_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","volume":"94","author":"P. Bhatt","year":"1991","unstructured":"Bhatt, P., Diks, K., Hagerup, T, Prasad, V., T. Radzik, Saxena, S., Improved deterministic parallel integer sorting, Information and Computation 94 (1991), pp. 29\u201347.","journal-title":"Information and Computation"},{"key":"72_CR3","unstructured":"Blelloch, G. Prefix Sums and Their Applications, Reif, J., ed, Synthesis of Parallel Algorithms, pp. 35\u201360, 1997."},{"key":"72_CR4","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1998","unstructured":"Cole, R. Parallel Merge Sort, SIAM Journal on Computing 17 (1998), pp. 770\u2013785.","journal-title":"SIAM Journal on Computing"},{"key":"72_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","volume":"75","author":"T. Hagerup","year":"1987","unstructured":"Hagerup, T., Toward optimal parallel bucking sorting, Information and Computation 75 (1987), pp. 39\u201351.","journal-title":"Information and Computation"},{"key":"72_CR6","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. A. Huffman","year":"1951","unstructured":"Huffman, D. A. A method for construction of minimum redundancy codes, Proc. IRE, 40 (1951), pp. 1098\u20131101.","journal-title":"Proc. IRE"},{"key":"72_CR7","unstructured":"Kirkpatrick, D., Przytycka, T. Parallel Construction of Binary Trees with Near Optimal Weighted Path Length, Algorithmica (1996), pp. 172\u2013192."},{"key":"72_CR8","unstructured":"Larmore, L.L., Przytycka. T., W. Rytter, Parallel Construction of Optimal Alphabetic Trees, Proc 5th ACM Symposium on Parallel Algorithms and Architectures (1993) pp. 214\u2013223."},{"issue":"6","key":"72_CR9","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/S0097539792233245","volume":"24","author":"L. Larmore","year":"1995","unstructured":"Larmore, L., Przytycka. T. Constructing Huffman trees in parallel, SIAM Journal on Computing, 24(6) (1995) pp. 1163\u20131169.","journal-title":"SIAM Journal on Computing"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Miller, G., Reif., J., Parallel tree contraction and its applications, Proc. 26th Symposium on Foundations of Computer Science (1985), pp. 478\u2013489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Nekrich, Y., Byte-oriented Decoding of Canonical Huffman Codes, Proceedings of the IEEE International Symposium on Information Theory 2000, (2000), p. 371.","DOI":"10.1109\/ISIT.2000.866669"},{"key":"72_CR12","doi-asserted-by":"crossref","unstructured":"Nekrich, Y., Decoding of Canonical Huffman Codes with Look-Up Tables, Proceeding of the IEEE Data Compression Conference 2000, (2000) p. 342.","DOI":"10.1109\/DCC.2000.838213"},{"key":"72_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/36068.36071","volume":"18","author":"S. Teng","year":"1987","unstructured":"Teng, S., The construction of Huffman equivalent prefix code in NC, ACM SIGACT 18 (1987), pp. 54\u201361.","journal-title":"ACM SIGACT"},{"key":"72_CR14","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. Valiant","year":"1975","unstructured":"Valiant, L. Parallelism in Comparison Problems, SIAM Journal on Com-puting 4 (1975),pp. 348\u2013355.","journal-title":"SIAM Journal on Com-puting"},{"key":"72_CR15","unstructured":"van Leeuwen, J. On the construction of Huffman trees, In 3rd Int. Colloqium on Automata, Languages and Programming (1976), pp. 382\u2013410."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T23:53:07Z","timestamp":1550361187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_72","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}