Zobrazeno 1 - 10
of 391
pro vyhledávání: '"Jurdzinski, A."'
We consider two fundamental communication tasks in arbitrary radio networks: broadcasting (information from one source has to reach all nodes) and gossiping (every node has a message and all messages have to reach all nodes). Nodes are assigned label
Externí odkaz:
http://arxiv.org/abs/2410.07382
Our main technical contribution is a polynomial-time determinisation procedure for history-deterministic B\"uchi automata, which settles an open question of Kuperberg and Skrzypczak, 2015. A key conceptual contribution is the lookahead game, which is
Externí odkaz:
http://arxiv.org/abs/2404.17530
The model of population protocols provides a universal platform to study distributed processes driven by pairwise interactions of anonymous agents. While population protocols present an elegant and robust model for randomized distributed computation,
Externí odkaz:
http://arxiv.org/abs/2305.08460
Autor:
Meike A. C. Latz, Agneta Andersson, Sonia Brugel, Mikael Hedblom, Krzysztof T. Jurdzinski, Bengt Karlson, Markus Lindh, Jenny Lycken, Anders Torstensson, Anders F. Andersson
Publikováno v:
Scientific Data, Vol 11, Iss 1, Pp 1-9 (2024)
Abstract The Baltic Sea is one of the largest brackish water environments on earth and is characterised by pronounced physicochemical gradients and seasonal dynamics. Although the Baltic Sea has a long history of microscopy-based plankton monitoring,
Externí odkaz:
https://doaj.org/article/76965d8168eb4a16b598a69a089fc7dc
Autor:
Gąsieniec, Leszek, Jurdziński, Tomasz, Klasing, Ralf, Levcopoulos, Christos, Lingas, Andrzej, Min, Jie, Radzik, Tomasz
A garden $G$ is populated by $n\ge 1$ bamboos $b_1, b_2, ..., b_n$ with the respective daily growth rates $h_1 \ge h_2 \ge \dots \ge h_n$. It is assumed that the initial heights of bamboos are zero. The robotic gardener maintaining the garden regular
Externí odkaz:
http://arxiv.org/abs/2202.01567
We consider the fundamental problems of size discovery and topology recognition in radio networks modeled by simple undirected connected graphs. Size discovery calls for all nodes to output the number of nodes in the graph, called its size, and in th
Externí odkaz:
http://arxiv.org/abs/2105.10595
Autor:
Gąsieniec, Leszek, Jurdziński, Tomasz, Klasing, Ralf, Levcopoulos, Christos, Lingas, Andrzej, Min, Jie, Radzik, Tomasz
Publikováno v:
In Journal of Computer and System Sciences February 2024 139
Progress-measure lifting algorithms for solving parity games have the best worst-case asymptotic runtime, but are limited by their asymmetric nature, and known from the work of Czerwi\'nski et al. (2018) to be subject to a matching quasi-polynomial l
Externí odkaz:
http://arxiv.org/abs/2010.08288
The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its minor. The Strahler number of a parity game is proposed to be defined as the smallest Strahler number of the tree of any of its attractor decompositions.
Externí odkaz:
http://arxiv.org/abs/2003.08627
An attractor decomposition meta-algorithm for solving parity games is given that generalises the classic McNaughton-Zielonka algorithm and its recent quasi-polynomial variants due to Parys (2019), and to Lehtinen, Schewe, and Wojtczak (2019). The cen
Externí odkaz:
http://arxiv.org/abs/2001.04333