License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.130
URN: urn:nbn:de:0030-drops-74404
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7440/
Go to the corresponding LIPIcs Volume Portal


Boczkowski, Lucas ; Kerenidis, Iordanis ; Magniez, Frédéric

Streaming Communication Protocols

pdf-format:
LIPIcs-ICALP-2017-130.pdf (0.6 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{boczkowski_et_al:LIPIcs:2017:7440,
  author =	{Lucas Boczkowski and Iordanis Kerenidis and Fr{\'e}d{\'e}ric Magniez},
  title =	{{Streaming Communication Protocols}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{130:1--130:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7440},
  URN =		{urn:nbn:de:0030-drops-74404},
  doi =		{10.4230/LIPIcs.ICALP.2017.130},
  annote =	{Keywords: Networks, Communication Complexity, Streaming Algorithms}
}

Keywords: Networks, Communication Complexity, Streaming Algorithms
Seminar: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Issue Date: 2017
Date of publication: 06.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI