2 citations · 3 across the 5 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DC2024
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
Adam Gańczorz, Tomasz Jurdziński, Andrzej Pelc
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 messa…
cs.DC2024★ 1 cited
Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid
Younan Gao, Andrzej Pelc
Two identical anonymous mobile agents have to meet at a node of the infinite oriented grid whose nodes are unlabeled. This problem is known as rendezvous. The agents execute the sa…
cs.DC2024★ 2 cited
Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
Subhash Bhagat, Andrzej Pelc
We consider the fundamental task of network exploration. A network is modeled as a simple connected undirected n-node graph with unlabeled nodes, and all ports at any node of degre…