{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:29:58Z","timestamp":1758709798346,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486164","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"93-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Truly parallel burrows-wheeler compression and decompression"],"prefix":"10.1145","author":[{"given":"James Alexander","family":"Edwards","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"DEC SRC","author":"Burrows M.","year":"1994","unstructured":"M. Burrows and D. J. Wheeler . A block-sorting lossless data compression algorithm. TR , DEC SRC , 1994 . M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. TR, DEC SRC, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90036-9"},{"key":"e_1_3_2_1_4_1","volume-title":"UMD, 2012","author":"Edwards J. A.","year":"1903","unstructured":"J. A. Edwards and U. Vishkin . Parallel algorithms for Burrows-Wheeler compression and decompression. TR , UMD, 2012 . http:\/\/hdl.handle.net\/ 1903 \/13299. J. A. Edwards and U. Vishkin. Parallel algorithms for Burrows-Wheeler compression and decompression. TR, UMD, 2012. http:\/\/hdl.handle.net\/1903\/13299."},{"key":"e_1_3_2_1_5_1","volume-title":"UMD, 2013","author":"Edwards J. A.","year":"1903","unstructured":"J. A. Edwards and U. Vishkin . Empirical speedup study of truly parallel data compression. TR , UMD, 2013 . http:\/\/hdl.handle.net\/ 1903 \/13890. J. A. Edwards and U. Vishkin. Empirical speedup study of truly parallel data compression. TR, UMD, 2013. http:\/\/hdl.handle.net\/1903\/13890."},{"key":"e_1_3_2_1_6_1","volume-title":"Lossless data compression on GPGPU architectures. ArXiv e-prints","author":"Eirola A.","year":"2011","unstructured":"A. Eirola . Lossless data compression on GPGPU architectures. ArXiv e-prints , 2011 . A. Eirola. Lossless data compression on GPGPU architectures. ArXiv e-prints, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2007.109"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/46.5.487"},{"key":"e_1_3_2_1_10_1","unstructured":"S. Lewin-Berlin. A parallel bzip2. http:\/\/software.intel.com\/en-us\/articles\/a-parallel-bzip2 2010.  S. Lewin-Berlin. A parallel bzip2. http:\/\/software.intel.com\/en-us\/articles\/a-parallel-bzip2 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2009.42"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339599"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195164"},{"key":"e_1_3_2_1_14_1","unstructured":"J. Seward. bzip2 a program and library for data compression. http:\/\/www.bzip.org\/.  J. Seward. bzip2 a program and library for data compression. http:\/\/www.bzip.org\/."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/789087.789805"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715896"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486164","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":16,"alternative-id":["10.1145\/2486159.2486164","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486164","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}