Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Giovanni VIGLIETTA"'
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 7:223-234
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6a572065075da2f30c12402b3015905
https://doi.org/10.1080/23799927.2022.2118622
https://doi.org/10.1080/23799927.2022.2118622
Publikováno v:
IEICE Transactions on Information and Systems. :623-633
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10c65c1e18c950c069e41fd43917bb7c
https://doi.org/10.1587/transinf.2021edp7206
https://doi.org/10.1587/transinf.2021edp7206
Publikováno v:
IEICE Transactions on Information and Systems. :517-531
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73b463475bfa9101e32cb75fbe35c80a
https://doi.org/10.1587/transinf.2021fcp0008
https://doi.org/10.1587/transinf.2021fcp0008
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b66bfad718add23f9c2e65b1b59a0c08
http://arxiv.org/abs/2204.02128
http://arxiv.org/abs/2204.02128
Autor:
Taisuke Izumi, Paola Flocchini, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta, Giuseppe Antonio Di Luna
Publikováno v:
Distributed Computing. 33:561-578
In this paper we investigate the computational power of population protocols under some unreliable or weaker interaction models. More precisely, we focus on two features related to the power of interactions: omission failures and one-way communicatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83cfba6f28014d4cbaccec6dd98835b6
https://doi.org/10.1007/s00446-020-00377-0
https://doi.org/10.1007/s00446-020-00377-0
Autor:
Linda Pagli, Giovanni Viglietta, Giuseppe Prencipe, Nicola Santoro, Paola Flocchini, Giuseppe Antonio Di Luna
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783319720494
SIROCCO
SIROCCO
The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares the same f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35f11200c058948194a08c4a622598c5
https://doi.org/10.1016/j.tcs.2018.10.018
https://doi.org/10.1016/j.tcs.2018.10.018
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f69dfb258b37f18051e78637c2a984ad
https://doi.org/10.2139/ssrn.4049750
https://doi.org/10.2139/ssrn.4049750
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030682101
WALCOM
WALCOM
We study a new reconfiguration problem inspired by classic mechanical puzzles: a colored token is placed on each vertex of a given graph; we are also given a set of distinguished cycles on the graph. We are tasked with rearranging the tokens from a g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89dd0271e0e22b05e18cb6b2abf907dd
https://doi.org/10.1007/978-3-030-68211-8_25
https://doi.org/10.1007/978-3-030-68211-8_25
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
COCOON
We investigate a new variation of a token reconfiguration problem on graphs using the cyclic shift operation. A colored or labeled token is placed on each vertex of a given graph, and a “move” consists in choosing a cycle in the graph and shiftin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8f0da50b6faf3f2970f55719fe39ef9
https://doi.org/10.1007/978-3-030-89543-3_53
https://doi.org/10.1007/978-3-030-89543-3_53
Publikováno v:
Computational Geometry. 104:101859
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fee0b961e2cbcf955c3160e948481424
https://doi.org/10.1016/j.comgeo.2022.101859
https://doi.org/10.1016/j.comgeo.2022.101859