Zobrazeno 1 - 10
of 139
pro vyhledávání: '"Viglietta, Giovanni"'
A network is said to be "anonymous" if its agents are indistinguishable from each other; it is "dynamic" if its communication links may appear or disappear unpredictably over time. Assuming that an anonymous dynamic network is always connected and ea
Externí odkaz:
http://arxiv.org/abs/2409.00688
Autor:
Viglietta, Giovanni
In the theoretical study of distributed communication networks, "history trees" are a discrete structure that naturally models the concept that anonymous agents become distinguishable upon receiving different sets of messages from neighboring agents.
Externí odkaz:
http://arxiv.org/abs/2404.02673
Autor:
Viglietta, Giovanni
We study arrangements of geodesic arcs on a sphere, where all arcs are internally disjoint and each arc has its endpoints located within the interior of other arcs. We establish fundamental results concerning the minimum number of arcs in such arrang
Externí odkaz:
http://arxiv.org/abs/2311.03255
An anonymous dynamic network is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that deterministically computing an arbitrary function of a multiset of in
Externí odkaz:
http://arxiv.org/abs/2301.07849
We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains true if $\
Externí odkaz:
http://arxiv.org/abs/2208.09702
We give a simple characterization of the functions that can be computed deterministically by anonymous processes in dynamic networks, depending on the number of leaders in the network. In addition, we provide efficient distributed algorithms for comp
Externí odkaz:
http://arxiv.org/abs/2207.08061
We give the first linear-time counting algorithm for processes in anonymous 1-interval-connected dynamic networks with a leader. As a byproduct, we are able to compute in $3n$ rounds every function that is deterministically computable in such network
Externí odkaz:
http://arxiv.org/abs/2204.02128
Publikováno v:
In Theoretical Computer Science 2 February 2025 1025
We investigate the reconfiguration of $n$ blocks, or "tokens", in the square grid using "line pushes". A line push is performed from one of the four cardinal directions and pushes all tokens that are maximum in that direction to the opposite directio
Externí odkaz:
http://arxiv.org/abs/2202.12045
Autor:
Viglietta, Giovanni
We introduce an axiomatic theory of spherical diagrams as a tool to study certain combinatorial properties of polyhedra in $\mathbb R^3$, which are of central interest in the context of Art Gallery problems for polyhedra and other visibility-related
Externí odkaz:
http://arxiv.org/abs/2107.05895