1 citations · 2 across the 4 of their papers we have counts for
7 papers
Dynamic Construction of the Lovász Local Lemma
Bernhard Haeupler, Slobodan Mitrović, Srikkanth Ramachandran +2
This paper proves that a wide class of local search algorithms extend as is to the fully dynamic setting with an adaptive adversary, achieving an amortized number of…
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
Slobodan Mitrović, Srikkanth Ramachandran, Ronitt Rubinfeld +1
In this work, we focus on designing an efficient Local Computation Algorithm (LCA) for the set cover problem, which is a core optimization task. The state-of-the-art LCA for comput…
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
Jakub Łącki, Slobodan Mitrović, Srikkanth Ramachandran +1
We study the allocation problem in the Massively Parallel Computation (MPC) model. This problem is a special case of -matching, in which the input is a bipartite graph with capa…
Byzantine Resilient Computing with the Cloud
John Augustine, Jeffin Biju, Shachar Meir +3
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…
Recurrent Problems in the LOCAL model
Akanksha Agrawal, John Augustine, David Peleg +1
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, multipl…
Guarding Polygons with Holes
John Augustine, Srikkanth Ramachandran
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 verti…
Guarding a Polygon Without Losing Touch
Barath Ashok, John Augustine, Aditya Mehekare +3
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…