Linear Time Approximation Schemes for Vehicle Scheduling. - John E. Augustine; Steven S. Seiden (SWAT, 2002)

Optimal Power-Down Strategies. - John Augustine 001; Sandy Irani; Chaitanya Swamy (FOCS, 2004)

Linear time approximation schemes for vehicle scheduling problems. - John E. Augustine; Steven S. Seiden (Theor. Comput. Sci., 2004)

Online Packet Admission and Oblivious Routing in Sensor Networks. - Mohamed Aly 002; John Augustine 001 (ISAAC, 2006)

Strip packing with precedence constraints and strip packing with release times. - John Augustine 001; Sudarshan Banerjee; Sandy Irani (SPAA, 2006)

Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks - John Augustine 001; Qi Han 001; Philip Loden; Sachin Lodha; Sasanka Roy (CoRR, 2009)

Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. - John Augustine 001; David Eppstein; Kevin A. Wortman (COCOON, 2010)

Minimizing Testing Overheads in Database Migration Lifecycle. - Sangameshwar Patil; Sasanka Roy; John Augustine 001; Amanda Redlich; Sachin Lodha; Harrick M. Vin; Anand Deshpande; Mangesh S. Gharote; Ankit Mehrotra (COMAD, 2010)

Probe station selection algorithms for fault management in computer networks. - Deepak Jeswani; Nakul Korde; Dinesh Patil; Maitreya Natu; John Augustine 001 (COMSNETS, 2010)

On the Continuous CNN Problem. - John Augustine 001; Nick Gravin (ISAAC (2), 2010)

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location - John Augustine 001; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (CoRR, 2010)

Largest empty circle centered on a query line. - John Augustine 001; Brian Putnam; Sasanka Roy (J. Discrete Algorithms, 2010)

Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. - John Augustine 001; Qi Han 001; Philip Loden; Sachin Lodha; Sasanka Roy (CATS, 2011)

Dynamics of Profit-Sharing Games. - John Augustine 001; Ning Chen 005; Edith Elkind; Angelo Fanelli 001; Nick Gravin; Dmitry Shiryaev (IJCAI, 2011)

Towards robust and efficient computation in dynamic peer-to-peer networks. - John Augustine 001; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (SODA, 2012)

Enforcing efficient equilibria in network design games via subsidies. - John Augustine 001; Ioannis Caragiannis; Angelo Fanelli 001; Christos Kalaitzis (SPAA, 2012)

Fast byzantine agreement in dynamic networks. - John Augustine 001; Gopal Pandurangan; Peter Robinson 002 (PODC, 2013)

Storage and search in dynamic peer-to-peer networks. - John Augustine 001; Anisur Rahaman Molla; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (SPAA, 2013)

Localized geometric query problems. - John Augustine 001; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (Comput. Geom., 2013)

Robust Leader Election in a Fast-Changing World. - John Augustine 001; Tejas Kulkarni; Paresh Nakhe; Peter Robinson 002 (FOMC, 2013)

A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path. - Guru Prakash Arumugam; John Augustine 001; Mordecai J. Golin; Prashanth Srikanthan (CoRR, 2014)

Does customizing inexactness help over simplistic precision (bit-width) reduction? A case study. - Ashutosh Ingole; Biswaroop Maiti; John Augustine 001; Krishna V. Palem (CASES, 2015)

Novel inexact memory aware algorithm co-design for energy efficient computation: algorithmic principles. - Guru Prakash Arumugam; Prashanth Srikanthan; John Augustine 001; Krishna V. Palem; Eli Upfal; Ayush Bhargava; Parishkrati; Sreelatha Yenugula (DATE, 2015)

Opportunities for energy efficient computing: a study of inexact general purpose processors for high-performance and big-data applications. - Peter D. Düben; Jeremy Schlachter; Parishkrati; Sreelatha Yenugula; John Augustine 001; Christian C. Enz; Krishna V. Palem; Tim N. Palmer (DATE, 2015)

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks. - John Augustine 001; Gopal Pandurangan; Peter Robinson 002; Scott T. Roche; Eli Upfal (FOCS, 2015)

Leader Election in Sparse Dynamic Networks with Churn. - John Augustine 001; Tejas Kulkarni; Sumathi Sivasubramaniam (IPDPS, 2015)

Fast Byzantine Leader Election in Dynamic Networks. - John Augustine 001; Gopal Pandurangan; Peter Robinson 002 (DISC, 2015)

Distributed agreement in dynamic peer-to-peer networks. - John Augustine 001; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (J. Comput. Syst. Sci., 2015)

Minimax regret 1-sink location problem in dynamic path networks. - Yuya Higashikawa; John Augustine 001; Siu-Wing Cheng; Mordecai J. Golin; Naoki Katoh; Guanqun Ni; Bing Su 002; Yin-Feng Xu (Theor. Comput. Sci., 2015)

Balanced Allocation: Patience is not a Virtue. - John Augustine 001; William K. Moses Jr.; Amanda Redlich; Eli Upfal (SODA, 2016)

Information Spreading in Dynamic Networks Under Oblivious Adversaries. - John Augustine 001; Chen Avin; Mehraneh Liaee; Gopal Pandurangan; Rajmohan Rajaraman (DISC, 2016)

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. - Guru Prakash Arumugam; John Augustine 001; Mordecai J. Golin; Yuya Higashikawa; Naoki Katoh; Prashanth Srikanthan (CoRR, 2016)

Distributed Algorithmic Foundations of Dynamic Networks. - John Augustine 001; Gopal Pandurangan; Peter Robinson 002 (SIGACT News, 2016)

Sustaining Moore's Law Through Inexactness. - John Augustine 001; Krishna V. Palem; Parishkrati (CoRR, 2017)

Deterministic Dispersion of Mobile Robots in Dynamic Rings. - Ankush Agarwalla; John Augustine 001; William K. Moses Jr.; Sankar Madhav K.; Arvind Krishna Sridhar (ICDCN, 2018)

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs. - John Augustine 001; William K. Moses Jr. (ICDCN, 2018)

Spartan: A Framework For Sparse Robust Addressable Networks. - John Augustine 001; Sumathi Sivasubramaniam (IPDPS, 2018)

Sublinear Message Bounds for Randomized Agreement. - John Augustine 001; Anisur Rahaman Molla; Gopal Pandurangan (PODC, 2018)

Distributed Computation in the Node-Congested Clique. - John Augustine 001; Mohsen Ghaffari 001; Robert Gmyr; Kristian Hinnenthal; Fabian Kuhn; Jason Li 006; Christian Scheideler (CoRR, 2018)

Distributed Computation in Node-Capacitated Networks. - John Augustine 001; Mohsen Ghaffari 001; Robert Gmyr; Kristian Hinnenthal; Christian Scheideler; Fabian Kuhn; Jason Li 006 (SPAA, 2019)

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities. - Guru Prakash Arumugam; John Augustine 001; Mordecai J. Golin; Prashanth Srikanthan (Algorithmica, 2019)

Latency, Capacity, and Distributed MST. - John Augustine 001; Seth Gilbert; Fabian Kuhn; Peter Robinson 002; Suman Sourav (CoRR, 2019)

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols. - John Augustine 001; Valerie King; Anisur Rahaman Molla; Gopal Pandurangan; Jared Saia (CoRR, 2019)

Latency, Capacity, and Distributed Minimum Spanning Tree†. - John Augustine 001; Seth Gilbert; Fabian Kuhn; Peter Robinson 002; Suman Sourav (ICDCS, 2020)

Distributed Graph Realizations †. - John Augustine 001; Keerti Choudhary; Avi Cohen; David Peleg; Sumathi Sivasubramaniam; Suman Sourav (IPDPS, 2020)

Guarding a Polygon Without Losing Touch. - Barath Ashok; John Augustine 001; Aditya Mehekare; Sridhar Ragupathi; Srikkanth Ramachandran; Suman Sourav (SIROCCO, 2020)

Shortest Paths in a Hybrid Network Model. - John Augustine 001; Kristian Hinnenthal; Fabian Kuhn; Christian Scheideler; Philipp Schneider (SODA, 2020)

Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. - John Augustine 001; Valerie King; Anisur Rahaman Molla; Gopal Pandurangan; Jared Saia (DISC, 2020)

Economy Versus Disease Spread: Reopening Mechanisms for COVID 19. - John Augustine 001; Khalid Hourani; Anisur Rahaman Molla; Gopal Pandurangan; Adi Pasic (CoRR, 2020)

Efficient Distributed Algorithms in the k-machine model via PRAM Simulations. - John Augustine 001; Kishore Kothapalli; Gopal Pandurangan (IPDPS, 2021)

Byzantine Agreement and Leader Election: From Classical to the Modern. - John Augustine 001; Anisur Rahaman Molla; Gopal Pandurangan (PODC, 2021)

Spartan: Sparse Robust Addressable Networks. - John Augustine 001; Sumathi Sivasubramaniam (J. Parallel Distributed Comput., 2021)

Randomized gathering of asynchronous mobile robots. - Debasish Pattanayak; John Augustine 001; Partha Sarathi Mandal 001 (Theor. Comput. Sci., 2021)

Byzantine Spectral Ranking. - Arnhav Datar; Arun Rajkumar; John Augustine 001 (NeurIPS, 2022)

Randomized Byzantine Gathering in Rings. - John Augustine 001; Arnhav Datar; Nischith Shadagopan (OPODIS, 2022)

Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. - John Augustine 001; William K. Moses Jr.; Gopal Pandurangan (PODC, 2022)

Brief Announcement: Cooperative Guarding in Polygons with Holes. - John Augustine 001; Srikkanth Ramachandran (SAND, 2022)

A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables. - John Augustine 001; Soumyottam Chatterjee; Gopal Pandurangan (SPAA, 2022)

Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications. - John Augustine 001; Wahid Gulzar Bhat; Sandip Nair (SSS, 2022)

Byzantine Connectivity Testing in the Congested Clique. - John Augustine 001; Anisur Rahaman Molla; Gopal Pandurangan; Yadu Vasudev (DISC, 2022)

Guarding Polygons with Holes. - John Augustine 001; Srikkanth Ramachandran (CoRR, 2022)

Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. - John Augustine 001; William K. Moses Jr.; Gopal Pandurangan (CoRR, 2022)

Recurrent Problems in the LOCAL model. - Akanksha Agrawal 001; John Augustine 001; David Peleg; Srikkanth Ramachandran (CoRR, 2022)

Latency, capacity, and distributed minimum spanning trees. - John Augustine 001; Seth Gilbert; Fabian Kuhn; Peter Robinson 002; Suman Sourav (J. Comput. Syst. Sci., 2022)

Gathering of Anonymous Agents. - Arnhav Datar; Nischith Shadagopan M. N; John Augustine 001 (AAMAS, 2023)

Local Recurrent Problems in the SUPPORTED Model. - Akanksha Agrawal 001; John Augustine 001; David Peleg; Srikkanth Ramachandran (OPODIS, 2023)

Brief Announcement: Local Problems in the SUPPORTED Model. - Akanksha Agrawal 001; John Augustine 001; David Peleg; Srikkanth Ramachandran (PODC, 2023)

Algorithmic Foundations of Inexact Computing. - John Augustine 001; Dror Fried; Krishna V. Palem; Duc-Hung Pham; Anshumali Shrivastava (CoRR, 2023)

Byzantine Resilient Computing with the Cloud. - John Augustine 001; Jeffin Biju; Shachar Meir; David Peleg; Srikkanth Ramachandran; Aishwarya Thiruvengadam (CoRR, 2023)

Awake Complexity of Distributed Minimum Spanning Tree. - John Augustine 001; William K. Moses Jr.; Gopal Pandurangan (SIROCCO, 2024)

Byzantine Resilient Distributed Computing on External Data. - John Augustine 001; Jeffin Biju; Shachar Meir; David Peleg; Srikkanth Ramachandran; Aishwarya Thiruvengadam (DISC, 2024)

Maintaining Distributed Data Structures in Dynamic Peer-to-Peer Networks. - John Augustine 001; Antonio Cruciani; Iqra Altaf Gillani (CoRR, 2024)

Distributed Download from an External Data Source in Faulty Majority Settings. - John Augustine 001; Soumyottam Chatterjee; Valerie King; Manish Kumar 014; Shachar Meir; David Peleg (CoRR, 2024)

Supervised Distributed Computing. - John Augustine 001; Christian Scheideler; Julian Werthmann (Euro-Par (3), 2025)

Distributed Small Cuts using Semigroups. - John Augustine 001; Mohit Daga (ICDCN, 2025)

Fair and Representative Jury Selection for Decentralized Justice. - Bhargavi Sriram; John Augustine 001 (ICDCN, 2025)

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings. - John Augustine 001; Soumyottam Chatterjee; Valerie King; Manish Kumar 014; Shachar Meir; David Peleg (PODC, 2025)

Fully-Distributed Byzantine Agreement in Sparse Networks. - John Augustine 001; Fabien Dufoulon; Gopal Pandurangan (SODA, 2025)

Brief Announcement: Highly Dynamic and Fully Distributed Data Structures. - John Augustine 001; Antonio Cruciani; Iqra Altaf Gillani (DISC, 2025)

Distributed Download from an External Data Source in Byzantine Majority Settings. - John Augustine 001; Soumyottam Chatterjee; Valerie King; Manish Kumar 014; Shachar Meir; David Peleg (DISC, 2025)

Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings. - John Augustine 001; Soumyottam Chatterjee; Valerie King; Manish Kumar 014; Shachar Meir; David Peleg (DISC, 2025)

Distributed Download from an External Data Source in Asynchronous Faulty Settings. - John Augustine 001; Soumyottam Chatterjee; Valerie King; Manish Kumar 014; Shachar Meir; David Peleg (CoRR, 2025)