Zobrazeno 1 - 10
of 357
pro vyhledávání: '"Augustine, John"'
Byzantine agreement is a fundamental problem in fault-tolerant distributed networks that has been studied intensively for the last four decades. Most of these works designed protocols for complete networks. A key goal in Byzantine protocols is to tol
Externí odkaz:
http://arxiv.org/abs/2410.20865
We study robust and efficient distributed algorithms for building and maintaining distributed data structures in dynamic Peer-to-Peer (P2P) networks. P2P networks are characterized by a high level of dynamicity with abrupt heavy node \emph{churn} (no
Externí odkaz:
http://arxiv.org/abs/2409.10235
Autor:
Augustine, John, Biju, Jeffin, Meir, Shachar, Peleg, David, Ramachandran, Srikkanth, Thiruvengadam, Aishwarya
We study a framework for modeling distributed network systems assisted by a reliable and powerful cloud service. Our framework aims at capturing hybrid systems based on a point to point message passing network of machines, with the additional capabil
Externí odkaz:
http://arxiv.org/abs/2309.16359
Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on them is deliberately traded for significant resource savings. Signific
Externí odkaz:
http://arxiv.org/abs/2305.18705
The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by the subn
Externí odkaz:
http://arxiv.org/abs/2212.14542
We study the problem of rank aggregation where the goal is to obtain a global ranking by aggregating pair-wise comparisons of voters over a set of items. We consider an adversarial setting where the voters are partitioned into two sets. The first set
Externí odkaz:
http://arxiv.org/abs/2211.07902
We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in $\tilde{O}(D+\sqrt{n})$ rounds in the standard CONGEST model (where $n$ is the networ
Externí odkaz:
http://arxiv.org/abs/2204.08385
We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with $n$ vertices and $h$ holes, we require the agents to collaboratively explore an
Externí odkaz:
http://arxiv.org/abs/2202.13719
We study mechanisms for reopening economic activities that explore the trade off between containing the spread of COVID-19 and maximizing economic impact. This is of current importance as many organizations, cities, and states are formulating reopeni
Externí odkaz:
http://arxiv.org/abs/2009.08872
Autor:
Ashok, Barath, Augustine, John, Mehekare, Aditya, Ragupathi, Sridhar, Ramachandran, Srikkanth, Sourav, Suman
We study the classical Art Gallery Problem first proposed by Klee in 1973 from a mobile multi-agents perspective. Specifically, we require an optimally small number of agents (also called guards) to navigate and position themselves in the interior of
Externí odkaz:
http://arxiv.org/abs/2005.05601