暂无分享,去创建一个
Jeremiah Blocki | Elena Grigorescu | Alexander R. Block | Shubhang Kulkarni | Minshen Zhu Purdue University | University of Illinois Urbana-Champaign
[1] Vahid Tarokh,et al. A survey of error-correcting codes for channels with symbol synchronization errors , 2010, IEEE Communications Surveys & Tutorials.
[2] Jeremiah Blocki,et al. Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions , 2017, IACR Cryptol. ePrint Arch..
[3] Zhengzhong Jin,et al. Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[4] David P. Woodruff,et al. Tolerant Algorithms , 2011, ESA.
[5] Mark Braverman,et al. Noisy sorting without resampling , 2007, SODA '08.
[6] Venkatesan Guruswami,et al. Optimally resilient codes for list-decoding from insertions and deletions , 2019, Electron. Colloquium Comput. Complex..
[7] Xin Li,et al. Efficient Document Exchange and Error Correcting Codes with Asymmetric Information , 2020, SODA.
[8] Venkatesan Guruswami,et al. Deletion Codes in the High-Noise and High-Rate Regimes , 2014, IEEE Transactions on Information Theory.
[9] Venkatesan Guruswami,et al. Efficient Linear and Affine Codes for Correcting Insertions/Deletions , 2020, ArXiv.
[10] Anat Paskin-Cherniavsky,et al. Locally Decodable Codes for Edit Distance , 2015, ICITS.
[11] Klim Efremenko,et al. 3-Query Locally Decodable Codes of Subexponential Length , 2008 .
[12] Venkatesan Guruswami,et al. Polynomial Time Decodable Codes for the Binary Deletion Channel , 2019, IEEE Transactions on Information Theory.
[13] Or Meir,et al. High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2016, STOC.
[14] David P. Woodruff. A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field , 2010, APPROX-RANDOM.
[15] Michael Mitzenmacher,et al. A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.
[16] David P. Woodruff. A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field , 2010, Journal of Computer Science and Technology.
[17] Bernhard Haeupler,et al. Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing , 2018, STOC.
[18] Bernhard Haeupler. Optimal Document Exchange and New Codes for Insertions and Deletions , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[19] Jirí Matousek,et al. Expected Length of the Longest Common Subsequence for Large Alphabets , 2003, LATIN.
[20] Venkatesan Guruswami,et al. Efficient Low-Redundancy Codes for Correcting Multiple Deletions , 2015, IEEE Transactions on Information Theory.
[21] Chih-Hung Liu,et al. Sorting with Recurrent Comparison Errors , 2017, ISAAC.
[22] David Zuckerman,et al. Asymptotically good codes correcting insertions, deletions, and transpositions , 1997, SODA '97.
[23] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[24] P. Erdoes,et al. On sparse graphs with dense long paths. , 1975 .
[25] Shubhangi Saraf,et al. Guest Column: Local Testing and Decoding of High-Rate Error-Correcting Codes , 2016, SIGA.
[26] Bernhard Haeupler,et al. Synchronization strings: codes for insertions and deletions approaching the Singleton bound , 2017, STOC.
[27] Madhu Sudan,et al. Synchronization Strings: List Decoding for Insertions and Deletions , 2018, ICALP.
[28] Peter Winkler,et al. On playing “Twenty Questions” with a liar , 1992, SODA '92.
[29] Venkatesan Guruswami,et al. Coding against deletions in oblivious and online models , 2018, SODA.
[30] Zeev Dvir,et al. Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[31] Sergey Yekhanin,et al. Towards 3-query locally decodable codes of subexponential length , 2008, JACM.
[32] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[33] Bernhard Haeupler,et al. Synchronization strings: explicit constructions, local decoding, and applications , 2017, STOC.
[34] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[35] Jeremiah Blocki,et al. Sustained Space Complexity , 2017, IACR Cryptol. ePrint Arch..
[36] Luca Trevisan,et al. Pseudorandom Generators without the XOR Lemma (Abstract). , 1999 .
[37] Shu Liu,et al. On List Decoding of Insertion and Deletion Errors , 2019, ArXiv.
[38] Shubhangi Saraf,et al. High-rate codes with sublinear-time decoding , 2014, Electron. Colloquium Comput. Complex..
[39] Shubhangi Saraf,et al. Locally Decodable Codes , 2016, Encyclopedia of Algorithms.
[40] Yu Zheng,et al. Locally Decodable Codes with Randomized Encoding , 2020, IACR Cryptol. ePrint Arch..
[41] Richard M. Karp,et al. Noisy binary search and its applications , 2007, SODA '07.
[42] Xin Li,et al. Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets , 2019, SODA.