Already in the 1960s, Levenshtein and others studied error-correcting codes that protect
against synchronization errors, such as symbol insertions and deletions. However, despite …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

We introduce synchronization strings, which provide a novel way of efficiently dealing with
synchronization errors, ie, insertions and deletions. Synchronization errors are strictly more …

Coding for interactive communication augments coding theory to the interactive setting:
instead of communicating a message from a sender to a receiver, here the parties are …

We study coding schemes for error correction in interactive communications. Such
interactive coding schemes simulate any n-round interactive protocol using N rounds over …

In this paper, we extend the notion of list decoding to the setting of interactive
communication and study its limits. In particular, we show that any protocol can be encoded …

This paper gives new results for synchronization strings, a powerful combinatorial object
introduced by [Haeupler, Shahrasbi; STOC'17] that allows to efficiently deal with insertions …

We provide tight upper and lower bounds on the noise resilience of interactive
communication over noisy channels with feedback. In this setting, we show that the maximal …

We consider the question of interactive communication, in which two remote parties perform
a computation, while their communication channel is (adversarially) noisy. We extend here …

In the setting of error-correcting codes with feedback, Alice wishes to communicate ak-bit
message x to Bob by sending a sequence of bits over a channel while noiselessly receiving …