John Augustine

Aishwarya Thiruvengadam

CoRR, 2023

Algorithmic Foundations of Inexact Computing.

[BibT_eX]

[DOI]

Anshumali Shrivastava

CoRR, 2023

Brief Announcement: Local Problems in the SUPPORTED Model.

[BibT_eX]

[DOI]

Akanksha Agrawal

David Peleg

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Local Recurrent Problems in the SUPPORTED Model.

[BibT_eX]

[DOI]

Akanksha Agrawal

David Peleg

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Gathering of Anonymous Agents.

[BibT_eX]

[DOI]

Arnhav Datar

Nischith Shadagopan M. N

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

2022

Distributed Graph Realizations.

[BibT_eX]

[DOI]

Suman Sourav

IEEE Trans. Parallel Distributed Syst., 2022

Balanced Allocation: Patience Is Not a Virtue.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Latency, capacity, and distributed minimum spanning trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Recurrent Problems in the LOCAL model.

[BibT_eX]

[DOI]

Akanksha Agrawal

David Peleg

CoRR, 2022

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

[BibT_eX]

[DOI]

William K. Moses Jr.

CoRR, 2022

Guarding Polygons with Holes.

[BibT_eX]

[DOI]

CoRR, 2022

Byzantine Connectivity Testing in the Congested Clique.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications.

[BibT_eX]

[DOI]

Wahid Gulzar Bhat

Sandip Nair

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.

[BibT_eX]

[DOI]

Soumyottam Chatterjee

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

William K. Moses Jr.

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Randomized Byzantine Gathering in Rings.

[BibT_eX]

[DOI]

Arnhav Datar

Nischith Shadagopan

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Byzantine Spectral Ranking.

[BibT_eX]

[DOI]

Arnhav Datar

Arun Rajkumar

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.

[BibT_eX]

[DOI]

Debasish Pattanayak

Partha Sarathi Mandal

Theor. Comput. Sci., 2021

Spartan: Sparse Robust Addressable Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2021

Byzantine Agreement and Leader Election: From Classical to the Modern.

[BibT_eX]

[DOI]

Anisur Rahaman Molla

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Efficient Distributed Algorithms in the k-machine model via PRAM Simulations.

[BibT_eX]

[DOI]

Kishore Kothapalli

Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

2020

Economy Versus Disease Spread: Reopening Mechanisms for COVID 19.

[BibT_eX]

[DOI]

CoRR, 2020

Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Shortest Paths in a Hybrid Network Model.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Guarding a Polygon Without Losing Touch.

[BibT_eX]

[DOI]

Suman Sourav

Proceedings of the Structural Information and Communication Complexity, 2020

Latency, Capacity, and Distributed Minimum Spanning Tree†.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Latency, Capacity, and Distributed MST.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

Mordecai J. Golin

Prashanth Srikanthan

Algorithmica, 2019

Distributed Computation in Node-Capacitated Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018

Distributed Computation in the Node-Congested Clique.

[BibT_eX]

[DOI]

CoRR, 2018

Sublinear Message Bounds for Randomized Agreement.

[BibT_eX]

[DOI]

Anisur Rahaman Molla

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Spartan: A Framework For Sparse Robust Addressable Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs.

[BibT_eX]

[DOI]

William K. Moses Jr.

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

Deterministic Dispersion of Mobile Robots in Dynamic Rings.

[BibT_eX]

[DOI]

Arvind Krishna Sridhar

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

Sustaining Moore's Law Through Inexactness.

[BibT_eX]

[DOI]

Krishna V. Palem

Parishkrati

CoRR, 2017

2016

Distributed Algorithmic Foundations of Dynamic Networks.

[BibT_eX]

[DOI]

Peter Robinson

SIGACT News, 2016

Leader Election in Sparse Dynamic Networks with Churn.

[BibT_eX]

[DOI]

Tejas Kulkarni

Internet Math., 2016

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities.

[BibT_eX]

[DOI]

CoRR, 2016

Information Spreading in Dynamic Networks Under Oblivious Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Minimax regret 1-sink location problem in dynamic path networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Distributed agreement in dynamic peer-to-peer networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Dynamics of Profit-Sharing Games.

[BibT_eX]

[DOI]

Internet Math., 2015

Enforcing Efficient Equilibria in Network Design Games via Subsidies.

[BibT_eX]

[DOI]

Algorithmica, 2015

Fast Byzantine Leader Election in Dynamic Networks.

[BibT_eX]

[DOI]

Peter Robinson

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Compilers, 2015

2014

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

[BibT_eX]

[DOI]

Mordecai J. Golin

Prashanth Srikanthan

CoRR, 2014

2013

Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Robust Leader Election in a Fast-Changing World.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Workshop on Foundations of Mobile Computing, 2013

Localized geometric query problems.

[BibT_eX]

[DOI]

Swami Sarvattomananda

Comput. Geom., 2013

Storage and search in dynamic peer-to-peer networks.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Fast byzantine agreement in dynamic networks.

[BibT_eX]

[DOI]

Peter Robinson

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Towards robust and efficient computation in dynamic peer-to-peer networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

Largest empty circle centered on a query line.

[BibT_eX]

[DOI]

Brian Putnam

Sasanka Roy

J. Discrete Algorithms, 2010

Approximate Weighted Farthest Neighbors and Minimum Dilation Stars.

[BibT_eX]

[DOI]

David Eppstein

Kevin A. Wortman

Discret. Math. Algorithms Appl., 2010

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

[BibT_eX]

[DOI]

Swami Sarvattomananda

CoRR, 2010

On the Continuous CNN Problem.

[BibT_eX]

[DOI]

Nick Gravin

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Probe station selection algorithms for fault management in computer networks.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Communication Systems and Networks, 2010

Minimizing Testing Overheads in Database Migration Lifecycle.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Management of Data, 2010

2009

Strip packing with precedence constraints and strip packing with release times.

[BibT_eX]

[DOI]

Sudarshan Banerjee

Sandy Irani

Theor. Comput. Sci., 2009

Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks

[BibT_eX]

[DOI]

CoRR, 2009

2008

Optimal Power-Down Strategies.

[BibT_eX]

[DOI]

Sandy Irani

Chaitanya Swamy

SIAM J. Comput., 2008

2006

Online Packet Admission and Oblivious Routing in Sensor Networks.

[BibT_eX]

[DOI]

Mohamed Aly