{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:32:55Z","timestamp":1730277175028,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/istc.2018.8625363","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T02:38:35Z","timestamp":1548383915000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["An Interactive Algorithm for Synchronizing from Burst Deletions"],"prefix":"10.1109","author":[{"given":"Shuyang","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clayton","family":"Schoeny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2014.7094851"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736664"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034196"},{"key":"ref13","article-title":"Efficient algorithms for sorting and synchronization","author":"tridgell","year":"2000","journal-title":"Ph D Dissertation"},{"key":"ref4","first-page":"300","article-title":"A probabilistic algorithm for updating files over a communication link","author":"evfimievski","year":"1998","journal-title":"Proc 9th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref3","first-page":"197","article-title":"Communication complexity of document exchange","author":"cormode","year":"2000","journal-title":"Proc 11th Annu ACMSIAM Symp Discrete Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935978"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279674"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466635"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0406043"},{"key":"ref1","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions and reversals (in Russian)","volume":"163","author":"levenshtein","year":"1965","journal-title":"Soviet Phys Doklady"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2552175"}],"event":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","start":{"date-parts":[[2018,12,3]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2018,12,7]]}},"container-title":["2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8614368\/8625264\/08625363.pdf?arnumber=8625363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T19:51:38Z","timestamp":1643226698000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8625363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/istc.2018.8625363","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}