暂无分享,去创建一个
Kuan Cheng | Xin Li | Ke Wu | Kuan Cheng | Xin Li | Ke Wu
[1] Bernhard Haeupler,et al. Synchronization strings: explicit constructions, local decoding, and applications , 2017, STOC.
[2] Raj Pal Soni,et al. Aperiodic words on three symbols. III. , 1982 .
[3] Boris Zolotov,et al. Another Solution to the Thue Problem of Non-Repeating Words , 2015, ArXiv.
[4] Jeffrey Shallit,et al. Avoiding Approximate Squares , 2007, Developments in Language Theory.
[5] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[6] Allan Borodin,et al. Fast Modular Transforms , 1974, J. Comput. Syst. Sci..
[7] Bernhard Haeupler,et al. Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[8] Aravind Srinivasan,et al. New Constructive Aspects of the Lovasz Local Lemma , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[9] Venkatesan Guruswami,et al. An Improved Bound on the Fraction of Correctable Deletions , 2015, IEEE Transactions on Information Theory.
[10] Paul Beame,et al. On the Value of Multiple Read/Write Streams for Approximating Frequency Moments , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[11] Maria Axenovich,et al. A regularity lemma and twins in words , 2012, J. Comb. Theory, Ser. A.
[12] Éric Schost,et al. Tellegen's principle into practice , 2003, ISSAC '03.
[13] J. Leech. 2726. A problem on strings of beads , 1957, Mathematical Gazette.
[14] Boris Bukh,et al. Twins in words and long common subsequences in permutations , 2013, 1307.0088.
[15] Leonard J. Schulman. Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.
[16] Narad Rampersad,et al. Avoiding approximate repetitions with respect to the longest common subsequence distance , 2013, 1308.1620.
[17] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[18] Bernhard Haeupler,et al. Interactive Channel Capacity Revisited , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[19] Bernhard Haeupler,et al. Synchronization strings: codes for insertions and deletions approaching the Singleton bound , 2017, STOC.
[20] Karthekeyan Chandrasekaran,et al. Deterministic algorithms for the Lovász Local Lemma , 2009, SODA '10.
[21] Madhu Sudan,et al. Synchronization Strings: List Decoding for Insertions and Deletions , 2018, ICALP.
[22] Mark Braverman,et al. Coding for Interactive Communication Correcting Insertions and Deletions , 2017, IEEE Transactions on Information Theory.
[23] Allan Borodin,et al. Fast Modular Transforms via Division , 1972, SWAT.
[24] Ran Raz,et al. Interactive channel capacity , 2013, STOC '13.
[25] Axel Thue. Selected mathematical papers of Axel Thue , 1977 .
[26] Bernhard Haeupler,et al. Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions , 2017, ICALP.
[27] Ran Gelles,et al. Coding for Interactive Communication: A Survey , 2017, Found. Trends Theor. Comput. Sci..
[28] Robert Shelton. Aperiodic words on three symbols. , 1981 .
[29] Vahid Tarokh,et al. A survey of error-correcting codes for channels with symbol synchronization errors , 2010, IEEE Communications Surveys & Tutorials.
[30] Ran Gelles,et al. Capacity of Interactive Communication over Erasure Channels and Channels with Feedback , 2015, SIAM J. Comput..
[31] Maxime Crochemore,et al. Sharp Characterizations of Squarefree Morphisms , 1982, Theor. Comput. Sci..
[32] Madhu Sudan,et al. Optimal error rates for interactive coding I: adaptivity and other settings , 2013, STOC.