J
John Augustine
Researcher at Indian Institute of Technology Madras
Publications - 90
Citations - 1127
John Augustine is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Distributed algorithm & Dynamic network analysis. The author has an hindex of 17, co-authored 81 publications receiving 955 citations. Previous affiliations of John Augustine include Nanyang Technological University & University of California, Irvine.
Papers
More filters
Journal ArticleDOI
Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
TL;DR: This work presents distributed MST algorithms that have optimal awake complexity with a matching lower bound, and shows that a lower bound 1 of ˜Ω( n ) on the product of round complexity and awake complexity for any distributed algorithm (even randomized) that outputs an MST.
Posted Content
Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks
TL;DR: This work introduces a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection and shows that any solution that has either one of the two properties cannot be a $(2-\epsilon)$-approximation, for any fixed $\ep silon > 0$.
Proceedings ArticleDOI
A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables
TL;DR: Performing computation in the presence of faulty and malicious nodes is a central problem in distributed computing and Dwork, Peleg, Pippenger, and Upfal presented the first protocol that achieved almost-everywhere agreement among good nodes.
Posted Content
Localized Geometric Query Problems
TL;DR: In this paper, a new class of geometric query problems is studied, where a set of geometric objects are preprocessed in the plane, so that for any arbitrary query point $q, the largest circle that contains $q$ but does not contain any member of $P$ can be reported efficiently.
Posted Content
Distributed Graph Realizations
TL;DR: In this article, the authors study the problem of graph realization from a distributed perspective and study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer networks.