×

Found 6 Documents (Results 1–6)

Optimally resilient codes for list-decoding from insertions and deletions. (English) Zbl 1492.94217

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 524-537 (2020).
MSC:  94B35 94A60

Near-linear time insertion-deletion codes and \((1+\varepsilon)\)-approximating edit distance via indexing. (English) Zbl 1433.68131

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 697-708 (2019).
MSC:  68P30 68Q25 68W25

Synchronization strings: list decoding for insertions and deletions. (English) Zbl 1512.94171

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 76, 14 p. (2018).
MSC:  94B35

Synchronization strings: channel simulations and interactive coding for insertions and deletions. (English) Zbl 1504.94083

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 75, 14 p. (2018).

Synchronization strings: codes for insertions and deletions approaching the Singleton bound. (English) Zbl 1370.94602

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 33-46 (2017).
MSC:  94B50

Filter Results by …

Year of Publication

Main Field