Gopal Pandurangan

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

2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity.

[BibT_eX]

[DOI]

Fabien Dufoulon

CoRR, 2022

An Almost Singularly Optimal Asynchronous Distributed MST Algorithm.

[BibT_eX]

[DOI]

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

Byzantine Connectivity Testing in the Congested Clique.

[BibT_eX]

[DOI]

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

A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

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

[BibT_eX]

[DOI]

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

2022 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

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

Awake-Efficient Distributed Algorithms for Maximal Independent Set.

[BibT_eX]

[DOI]

Khalid Hourani

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Byzantine-Resilient Counting in Networks.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation.

[BibT_eX]

[DOI]

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021

On the Distributed Complexity of Large-Scale Graph Computations.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Singularly Near Optimal Leader Election in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Can We Break Symmetry with o(m) Communication?

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Message lower bounds via efficient network synchronization.

[BibT_eX]

[DOI]

David Peleg

Theor. Comput. Sci., 2020

A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

The complexity of leader election in diameter-two networks.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Economy Versus Disease Spread: Reopening Mechanisms for COVID 19.

[BibT_eX]

[DOI]

CoRR, 2020

Sleeping is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity.

[BibT_eX]

[DOI]

Robert Gmyr

CoRR, 2020

Singularly Optimal Randomized Leader Election.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Efficient Distributed Algorithms for the K-Nearest Neighbors Problem.

[BibT_eX]

[DOI]

Reza Fathi

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Sleeping is Efficient: MIS in <i>O</i>(1)-rounds Node-averaged Awake Complexity.

[BibT_eX]

[DOI]

Robert Gmyr

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed MST: A Smoothed Analysis.

[BibT_eX]

[DOI]

Nguyen Dinh Pham

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

Enumération Randomisée des Triangles dans des Graphes à Grande Echelle à base de SQL.

[BibT_eX]

[DOI]

Proceedings of the Business Intelligence & Big Data, 2020

A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries.

[BibT_eX]

[DOI]

Proceedings of the Big Data Analytics and Knowledge Discovery, 2020

PandaSQL: Parallel Randomized Triangle Enumeration with SQL Queries.

[BibT_eX]

[DOI]

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Network Size Estimation in Small-World Networks Under Byzantine Faults.

[BibT_eX]

[DOI]

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

Efficient Distributed Community Detection in the Stochastic Block Model.

[BibT_eX]

[DOI]

Reza Fathi

Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

The Communication Cost of Information Spreading in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

2018

Fast Distributed Algorithms for Connectivity and MST in Large Graphs.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2018

Special Issue of ICDCN 2016 (Distributed Computing Track).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

The Distributed Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Bull. EATCS, 2018

Time-Message Trade-Offs in Distributed Algorithms.

[BibT_eX]

[DOI]

Robert Gmyr

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Sublinear Message Bounds for Randomized Agreement.

[BibT_eX]

[DOI]

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

Local Mixing Time: Distributed Computation and Applications.

[BibT_eX]

[DOI]

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

Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs.

[BibT_eX]

[DOI]

Reza Fathi

Nguyen Dinh Pham

Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

The Complexity of Leader Election: A Chasm at Diameter Two.

[BibT_eX]

[DOI]

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

2017

Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets.

[BibT_eX]

[DOI]

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

Distributed Computation of Mixing Time.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016

Distributed Algorithmic Foundations of Dynamic Networks.

[BibT_eX]

[DOI]

SIGACT News, 2016

Efficient computation of sparse structures.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Discovery Through Gossip.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

DEX: self-healing expanders.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Tight Bounds for Distributed Graph Computations.

[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

Checkpointing to Minimize Completion Time for Inter-Dependent Parallel Processes on Volunteer Grids.

[BibT_eX]

[DOI]

Mohammad Tanvir Rahman

Hien Nguyen

Jaspal Subhlok

Proceedings of the IEEE/ACM 16th International Symposium on Cluster, 2016

2015

Coalescing-Branching Random Walks on Graphs.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2015

Fast distributed PageRank computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Distributed computation in dynamic networks via random walks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Sublinear bounds for randomized leader election.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Efficient random walk sampling in distributed networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

Distributed agreement in dynamic peer-to-peer networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

On the Complexity of Universal Leader Election.

[BibT_eX]

[DOI]

J. ACM, 2015

Efficient distributed computation of distance sketches in networks.

[BibT_eX]

[DOI]

Michael Dinitz

Distributed Comput., 2015

Almost Optimal Distributed Algorithms for Large-Scale Graph Problems.

[BibT_eX]

[DOI]

CoRR, 2015

Fast Byzantine Leader Election in Dynamic Networks.

[BibT_eX]

[DOI]

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

Distributed Computation of Large-scale Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST.

[BibT_eX]

[DOI]

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

Distributed Computation of Sparse Cuts via Random Walks.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Distributed Computing and Networking, 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

2014

Algorithms for Large Scale Graphs (NII Shonan Meeting 2014-12).

[BibT_eX]

[DOI]

Andrew McGregor

Sergei Vassilvitskii

NII Shonan Meet. Rep., 2014

Xheal: a localized self-healing algorithm using expanders.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Global Information Sharing under Network Dynamics.

[BibT_eX]

[DOI]

CoRR, 2014

Distributed Symmetry Breaking in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Distributed Algorithmic Foundations of Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Can quantum communication speed up distributed computation?

[BibT_eX]

[DOI]

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

2013

Stochastic analysis of a churn-tolerant structured peer-to-peer scheme.

[BibT_eX]

[DOI]

Tim Jacobs

Peer-to-Peer Netw. Appl., 2013

Ballast: A Ball-based Algorithm for Structural Motifs.

[BibT_eX]

[DOI]

J. Comput. Biol., 2013

Distributed Random Walks.

[BibT_eX]

[DOI]

J. ACM, 2013

Distributed Computation of Sparse Cuts.

[BibT_eX]

[DOI]

CoRR, 2013

The Distributed Complexity of Large-scale Graph Processing.

[BibT_eX]

[DOI]

CoRR, 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

On the Complexity of Information Spreading in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Fast byzantine agreement in dynamic networks.

[BibT_eX]

[DOI]

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

Efficient Computation of Balanced Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Distributed Verification and Hardness of Distributed Approximation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Almost-Optimal Gossip-Based Aggregate Computation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Efficient distributed approximation algorithms via probabilistic tree embeddings.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Quantum Distributed Network Computing: Lower Bounds and Techniques

[BibT_eX]

[DOI]

CoRR, 2012

Self-healing Deterministic Expanders

[BibT_eX]

[DOI]

CoRR, 2012

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

[BibT_eX]

[DOI]

CoRR, 2012

Fast Distributed Computation in Dynamic Networks via Random Walks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.

[BibT_eX]

[DOI]

Guanhong Pei

Anil Kumar S. Vullikanti

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient computation of distance sketches in distributed networks.

[BibT_eX]

[DOI]

Michael Dinitz

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 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

Near-optimal random walk sampling in distributed networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011

Information Spreading in Dynamic Networks

[BibT_eX]

[DOI]

CoRR, 2011

A Tight Lower Bound on Distributed Random Walk Computation

[BibT_eX]

[DOI]

Danupon Nanongkai

CoRR, 2011

Xheal: localized self-healing using expanders.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

A tight unconditional lower bound on distributed randomwalk computation.

[BibT_eX]

[DOI]

Danupon Nanongkai

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2010

Thresholding random geometric graph properties motivated by ad hoc sensor networks.

[BibT_eX]

[DOI]

S. Muthukrishnan

J. Comput. Syst. Sci., 2010

A Universal Online Caching Algorithm Based on Pattern Matching.

[BibT_eX]

[DOI]

Wojciech Szpankowski

Algorithmica, 2010

Optimal gossip-based aggregate computation.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Efficient distributed random walks with applications.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks.

[BibT_eX]

[DOI]

V. S. Anil Kumar

IEEE Trans. Parallel Distributed Syst., 2009

Energy-Optimal Distributed Algorithms for Minimum Spanning Trees.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2009

Near-Optimal Sublinear Time Bounds for Distributed Random Walks

[BibT_eX]

[DOI]

CoRR, 2009

Fast distributed random walks.

[BibT_eX]

[DOI]

Danupon Nanongkai

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Brief announcement: locality-based aggregate computation in wireless sensor networks.

[BibT_eX]

[DOI]

Jianghai Hu

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

On the hardness of optimization in power-law graphs.

[BibT_eX]

[DOI]

Alessandro Ferrante

Kihong Park

Theor. Comput. Sci., 2008

Distributed quantum computing: a new frontier in distributed systems or science fiction?

[BibT_eX]

[DOI]

Vasil S. Denchev

SIGACT News, 2008

Improved random graph isomorphism.

[BibT_eX]

[DOI]

Tomek Czajka

J. Discrete Algorithms, 2008

A fast distributed approximation algorithm for minimum spanning trees.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Contact replacement for NMR resonance assignment.

[BibT_eX]

[DOI]

Fei Xiong

Chris Bailey-Kellogg

Proceedings of the Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2008

2007

A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms.

[BibT_eX]

[DOI]

V. S. Anil Kumar

Theor. Comput. Sci., 2007

Entropy-based bounds for online algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Analysis of Randomized Protocols for Conflict-Free Distributed Access.

[BibT_eX]

[DOI]

GaHyun Park

Algorithmica, 2007

2006

Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis.

[BibT_eX]

[DOI]

Dongyan Xu

IEEE Trans. Parallel Distributed Syst., 2006

Using PageRank to Characterize Web Structure.

[BibT_eX]

[DOI]

Prabhakar Raghavan

Internet Math., 2006

An efficient randomized algorithm for contact-based NMR backbone resonance assignment.

[BibT_eX]

[DOI]

Hetunandan Kamisetty

Chris Bailey-Kellogg

Bioinform., 2006

Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization.

[BibT_eX]

[DOI]

Proceedings of the Third Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, 2006

Query Protocols for Highly Resilient Peer-to-Peer Networks.

[BibT_eX]

Suresh Jagannathan

Siriam Srinivasan

Proceedings of the ISCA 19th International Conference on Parallel and Distributed Computing Systems, 2006

2005

A Random Graph Approach to NMR Sequential Assignment.

[BibT_eX]

[DOI]

Chris Bailey-Kellogg

Sheetal Chainraj

J. Comput. Biol., 2005

On a simple randomized algorithm for finding a 2-factor in sparse graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

The bin-covering technique for thresholding random geometric graph properties.

[BibT_eX]

[DOI]

S. Muthukrishnan

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Brief announcement: analysis of a randomized contention-resolution protocol for distributed access.

[BibT_eX]

[DOI]

GaHyun Park

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Latency-sensitive power control for wireless ad-hoc networks.

[BibT_eX]

[DOI]

Mohamed R. Fouad

Sonia Fahmy

Proceedings of the Q2SWinet'05, 2005

2003

Building low-diameter peer-to-peer networks.

[BibT_eX]

[DOI]

Prabhakar Raghavan

IEEE J. Sel. Areas Commun., 2003

2002

Stochastic Analyses of Dynamic Computer Processes.

[BibT_eX]

[DOI]

PhD thesis, 2002

The restriction mapping problem revisited.

[BibT_eX]

[DOI]

Ramesh Hariharan

J. Comput. Syst. Sci., 2002

2001

Can entropy characterize performance of online algorithms?.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Building Low-Diameter P2P Networks.

[BibT_eX]

[DOI]

Prabhakar Raghavan

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Static and Dynamic Evaluation of QoS Properties.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2000

1999

Computing Near Optimal Strategies for Stochastic Investment Planning Problems.

[BibT_eX]

[DOI]

Milos Hauskrecht