iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/DCC.2013.44
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:42:12Z","timestamp":1725547332995},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1109\/dcc.2013.44","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T18:17:58Z","timestamp":1372270678000},"page":"361-370","source":"Crossref","is-referenced-by-count":1,"title":["Context-Based Algorithms for the List-Update Problem under Alternative Cost Models"],"prefix":"10.1109","author":[{"given":"S.","family":"Kamali","sequence":"first","affiliation":[]},{"given":"S.","family":"Ladra","sequence":"additional","affiliation":[]},{"given":"A.","family":"Lopez-Ortiz","sequence":"additional","affiliation":[]},{"given":"D.","family":"Seco","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2000.838175"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708931"},{"journal-title":"bzip2","year":"0","author":"seward","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"13","first-page":"338","article-title":"On the competitiveness of linear search","author":"munro","year":"2000","journal-title":"Procs of ESA"},{"key":"14","first-page":"727","article-title":"Can entropy characterize performance of online algorithms?","author":"pandurangan","year":"2001","journal-title":"Procs of SODA"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48481-7_25"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00264-3"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/5684.5688"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78773-0_35"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055501"},{"key":"7","first-page":"137","article-title":"An application of self-organizing data structures to compression","author":"dorrigiv","year":"2009","journal-title":"Procs of SEA"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2008.25"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096090"},{"journal-title":"Digital Equipment Corporation technical report","article-title":"A block-sorting lossless data compression algorithm","year":"1994","author":"burrows","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1993.253140"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"}],"event":{"name":"2013 Data Compression Conference (DCC)","start":{"date-parts":[[2013,3,20]]},"location":"Snowbird, UT","end":{"date-parts":[[2013,3,22]]}},"container-title":["2013 Data Compression Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6542297\/6543027\/06543072.pdf?arnumber=6543072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T18:22:08Z","timestamp":1490206928000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6543072\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/dcc.2013.44","relation":{},"subject":[],"published":{"date-parts":[[2013,3]]}}}