John Augustine

Orcid: 0000-0003-0948-3961

Affiliations:
  • Indian Institute of Technology Madras, Chennai, India
  • Nanyang Technological University, Singapore (former)
  • Tata Research Development and Design Centre, Pune, India (former)
  • University of California Irvine, CA, USA (PhD)
  • Louisiana State University, Baton Rouge, LA, USA (former)


According to our database1, John Augustine authored at least 82 papers between 2002 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Distributed Download from an External Data Source in Asynchronous Faulty Settings.
CoRR, September, 2025

Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Distributed Download from an External Data Source in Byzantine Majority Settings.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Brief Announcement: Highly Dynamic and Fully Distributed Data Structures.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Fully-Distributed Byzantine Agreement in Sparse Networks.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Fair and Representative Jury Selection for Decentralized Justice.
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025

Distributed Small Cuts using Semigroups.
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025

Supervised Distributed Computing.
Proceedings of the Euro-Par 2025: Parallel Processing, 2025

2024
Distributed Download from an External Data Source in Faulty Majority Settings.
CoRR, 2024

Maintaining Distributed Data Structures in Dynamic Peer-to-Peer Networks.
CoRR, 2024

Byzantine Resilient Distributed Computing on External Data.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Awake Complexity of Distributed Minimum Spanning Tree.
Proceedings of the Structural Information and Communication Complexity, 2024

2023
Byzantine Resilient Computing with the Cloud.
CoRR, 2023

Algorithmic Foundations of Inexact Computing.
CoRR, 2023

Brief Announcement: Local Problems in the SUPPORTED Model.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Local Recurrent Problems in the SUPPORTED Model.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Gathering of Anonymous Agents.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Latency, capacity, and distributed minimum spanning trees.
J. Comput. Syst. Sci., 2022

Recurrent Problems in the LOCAL model.
CoRR, 2022

Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds.
CoRR, 2022

Guarding Polygons with Holes.
CoRR, 2022

Byzantine Connectivity Testing in the Congested Clique.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Brief Announcement: Cooperative Guarding in Polygons with Holes.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Randomized Byzantine Gathering in Rings.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Byzantine Spectral Ranking.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Randomized gathering of asynchronous mobile robots.
Theor. Comput. Sci., 2021

Spartan: Sparse Robust Addressable Networks.
J. Parallel Distributed Comput., 2021

Byzantine Agreement and Leader Election: From Classical to the Modern.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Efficient Distributed Algorithms in the k-machine model via PRAM Simulations.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

2020
Economy Versus Disease Spread: Reopening Mechanisms for COVID 19.
CoRR, 2020

Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Shortest Paths in a Hybrid Network Model.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Guarding a Polygon Without Losing Touch.
Proceedings of the Structural Information and Communication Complexity, 2020

Distributed Graph Realizations †.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Latency, Capacity, and Distributed Minimum Spanning Tree†.
Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

2019
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols.
CoRR, 2019

Latency, Capacity, and Distributed MST.
CoRR, 2019

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities.
Algorithmica, 2019

Distributed Computation in Node-Capacitated Networks.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018
Distributed Computation in the Node-Congested Clique.
CoRR, 2018

Sublinear Message Bounds for Randomized Agreement.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Spartan: A Framework For Sparse Robust Addressable Networks.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Deterministic Dispersion of Mobile Robots in Dynamic Rings.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Sustaining Moore's Law Through Inexactness.
CoRR, 2017

2016
Distributed Algorithmic Foundations of Dynamic Networks.
SIGACT News, 2016

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities.
CoRR, 2016

Information Spreading in Dynamic Networks Under Oblivious Adversaries.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Balanced Allocation: Patience is not a Virtue.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Minimax regret 1-sink location problem in dynamic path networks.
Theor. Comput. Sci., 2015

Distributed agreement in dynamic peer-to-peer networks.
J. Comput. Syst. Sci., 2015

Fast Byzantine Leader Election in Dynamic Networks.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Leader Election in Sparse Dynamic Networks with Churn.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Opportunities for energy efficient computing: a study of inexact general purpose processors for high-performance and big-data applications.
Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, 2015

Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles.
Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, 2015

Does customizing inexactness help over simplistic precision (bit-width) reduction? A case study.
Proceedings of the 2015 International Conference on Compilers, 2015

2014
A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path.
CoRR, 2014

2013
Robust Leader Election in a Fast-Changing World.
Proceedings of the Proceedings Ninth International Workshop on Foundations of Mobile Computing, 2013

Localized geometric query problems.
Comput. Geom., 2013

Storage and search in dynamic peer-to-peer networks.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Fast byzantine agreement in dynamic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Enforcing efficient equilibria in network design games via subsidies.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Towards robust and efficient computation in dynamic peer-to-peer networks.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Dynamics of Profit-Sharing Games.
Proceedings of the IJCAI 2011, 2011

Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
Largest empty circle centered on a query line.
J. Discrete Algorithms, 2010

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location
CoRR, 2010

On the Continuous CNN Problem.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Probe station selection algorithms for fault management in computer networks.
Proceedings of the Second International Conference on Communication Systems and Networks, 2010

Minimizing Testing Overheads in Database Migration Lifecycle.
Proceedings of the 16th International Conference on Management of Data, 2010

Approximate Weighted Farthest Neighbors and Minimum Dilation Stars.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks
CoRR, 2009

2006
Strip packing with precedence constraints and strip packing with release times.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Online Packet Admission and Oblivious Routing in Sensor Networks.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2004
Linear time approximation schemes for vehicle scheduling problems.
Theor. Comput. Sci., 2004

Optimal Power-Down Strategies.
Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

2002
Linear Time Approximation Schemes for Vehicle Scheduling.
Proceedings of the Algorithm Theory, 2002


  Loading...