1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DC2020
Four Shades of Deterministic Leader Election in Anonymous Networks
Barun Gorain, Avery Miller, Andrzej Pelc
Leader election is one of the fundamental problems in distributed computing: a single node, called the leader, must be specified. This task can be formulated either in a weak way,…
cs.DC2017
Leader Election in Trees with Customized Advice
Barun Gorain, Andrzej Pelc
Leader election is a basic symmetry breaking problem in distributed computing. All nodes of a network have to agree on a single node, called the leader. If the nodes of the network…
cs.DC2012★ 1 cited
Optimal Covering with Mobile Sensors in an Unbounded Region
Barun Gorain, Partha Sarathi Mandal
Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \cite{Li09}. In this paper we have proposed an {\it id} based distributed algorit…