@inproceedings{507,
abstract = {{We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity.}},
author = {{Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}},
booktitle = {{Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}},
pages = {{11--22}},
title = {{{On Two-Party Communication Through Dynamic Networks}}},
doi = {{10.1007/978-3-319-03850-6_2}},
year = {{2013}},
}