Streaming Communication Protocols - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Streaming Communication Protocols

Résumé

We define the Streaming Communication model that combines the main aspects of communication complexity and streaming. Input arrives as a stream, spread between several agents across a network. Each agent has a bounded memory, which can be updated upon receiving a new bit, or a message from another agent. We provide tight tradeoffs between the necessary resources, i.e. communication between agents and memory, for some of the canonical problems from communication complexity by proving a strong general lower bound technique. Second, we analyze the Approximate Matching problem and show that the complexity of this problem (i.e. the achievable approximation ratio) in the one-way variant of our model is strictly different both from the streaming complexity and the one-way communication complexity thereof.
Fichier non déposé

Dates et versions

hal-03815391 , version 1 (14-10-2022)

Identifiants

Citer

Frédéric Magniez, Lucas Boczkowski, Iordanis Kerenidis. Streaming Communication Protocols. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.ICALP.2017.130⟩. ⟨hal-03815391⟩
9 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More