Zobrazeno 1 - 10
of 213
pro vyhledávání: '"Friedetzky A"'
The network-based study of financial systems has received considerable attention in recent years but has seldom explicitly incorporated the dynamic aspects of such systems. We consider this problem setting from the temporal point of view and introduc
Externí odkaz:
http://arxiv.org/abs/2403.02198
Publikováno v:
In Theoretical Computer Science 28 February 2025 1028
Autor:
Sylvain Choquet, Andrew Clark, Cécile Renard, Ben Uttenthal, Sridhar Chaganti, Ralf Ulrich Trappe, Patrizia Comoli, Xinyuan Duan, Baodong Xing, Charley Wu, Laurence Gamelin, Jan-Henrik Terwey, Anke Friedetzky, Daan Dierickx
Publikováno v:
HemaSphere, Vol 7, p e8073255 (2023)
Externí odkaz:
https://doaj.org/article/aa027855236c4b1ea54bea970adf8954
We consider the following load balancing process for $m$ tokens distributed arbitrarily among $n$ nodes connected by a complete graph: In each time step a pair of nodes is selected uniformly at random. Let $\ell_1$ and $\ell_2$ be their respective nu
Externí odkaz:
http://arxiv.org/abs/1808.05389
Autor:
Berenbrink, Petra, Elsässer, Robert, Friedetzky, Tom, Kaaser, Dominik, Kling, Peter, Radzik, Tomasz
A population protocol can be viewed as a sequence of pairwise interactions of $n$ agents (nodes). During one interaction, two agents selected uniformly at random update their states by applying a specified deterministic transition function. In a long
Externí odkaz:
http://arxiv.org/abs/1805.05157
Autor:
Berenbrink, Petra, Elsässer, Robert, Friedetzky, Tom, Kaaser, Dominik, Kling, Peter, Radzik, Tomasz
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion
Externí odkaz:
http://arxiv.org/abs/1805.04586
Autor:
Berenbrink, Petra, Friedetzky, Tom, Kling, Peter, Mallmann-Trenn, Frederik, Nagel, Lars, Wastell, Chris
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modeled as static balls into bins processes, where $m$ balls (tasks) are to be
Externí odkaz:
http://arxiv.org/abs/1603.02188
We consider distributed plurality consensus in a complete graph of size $n$ with $k$ initial opinions. We design an efficient and simple protocol in the asynchronous communication model that ensures that all nodes eventually agree on the initially mo
Externí odkaz:
http://arxiv.org/abs/1602.04667
We consider \emph{plurality consensus} in a network of $n$ nodes. Initially, each node has one of $k$ opinions. The nodes execute a (randomized) distributed protocol to agree on the plurality opinion (the opinion initially supported by the most nodes
Externí odkaz:
http://arxiv.org/abs/1602.01342
Autor:
S. Choquet, B. Uttenthal, S. Chaganti, P. Comoli, R. Trappe, A. Friedetzky, B. Xing, X. Li, T. Polak, L. Gamelin, J.-H. Terwey, D. Dierickx
Publikováno v:
HemaSphere, Vol 6, Pp 1339-1340 (2022)
Externí odkaz:
https://doaj.org/article/853bd32f87d741409d817203e0a51f7b