6 papers
Computing in Anonymous Dynamic Networks with One-Bit Communications
Thibaut Blanc, Giuseppe Antonio Di Luna, Giovanni Viglietta
We initiate the study of deterministic computation in anonymous dynamic networks where each agent broadcasts one bit per round and receives only the number of neighbors broadcastin…
ReSIM: Re-ranking Binary Similarity Embeddings to Improve Function Search Performance
Gianluca Capozzi, Anna Paola Giancaspro, Fabio Petroni +2
Binary Function Similarity (BFS), the problem of determining whether two binary functions originate from the same source code, has been extensively studied in recent research acros…
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
A communication 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 unpredicta…
On the Lack of Robustness of Binary Function Similarity Systems
Gianluca Capozzi, Tong Tang, Jie Wan +5
Binary function similarity, which often relies on learning-based algorithms to identify what functions in a pool are most similar to a given query function, is a sought-after topic…
Sovereignty in the digital era: the quest for continuous access to dependable technological capabilities
Roberto Baldoni, Giuseppe Di Luna
In an era where economies and societies are deeply integrated into cyberspace, achieving a robust level of digital sovereignty has become an essential goal for nations aiming to pr…
Black Hole Search by Scattered Agents in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe +1
In this paper, we address the challenge of locating a black hole within a dynamic graph using a set of scattered agents, which start from arbitrary positions in the graph. A black…