Gopal Pandurangan

According to our database1, Gopal Pandurangan authored at least 89 papers between 1999 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Special Issue of ICDCN 2016 (Distributed Computing Track).
Theor. Comput. Sci., 2018

The Distributed Minimum Spanning Tree Problem.
Bulletin of the EATCS, 2018

Time-Message Trade-Offs in Distributed Algorithms.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

On the Distributed Complexity of Large-Scale Graph Computations.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

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

Local Mixing Time: Distributed Computation and Applications.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Fast and Efficient Distributed Computation of Hamiltonian Cycles in Random Graphs.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

The Complexity of Leader Election: A Chasm at Diameter Two.
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.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

A time- and message-optimal distributed algorithm for minimum spanning trees.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Distributed Computation of Mixing Time.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

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

Efficient computation of sparse structures.
Random Struct. Algorithms, 2016

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

Fast Distributed Algorithms for Connectivity and MST in Large Graphs.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Message Lower Bounds via Efficient Network Synchronization.
Proceedings of the Structural Information and Communication Complexity, 2016

Checkpointing to Minimize Completion Time for Inter-Dependent Parallel Processes on Volunteer Grids.
Proceedings of the IEEE/ACM 16th International Symposium on Cluster, 2016

2015
Distributed computation in dynamic networks via random walks.
Theor. Comput. Sci., 2015

Efficient random walk sampling in distributed networks.
J. Parallel Distrib. Comput., 2015

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

Efficient distributed computation of distance sketches in networks.
Distributed Computing, 2015

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

Distributed Computation of Large-scale Graph Problems.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Distributed Computation of Sparse Cuts via Random Walks.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 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

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

Xheal: a localized self-healing algorithm using expanders.
Distributed Computing, 2014

Distributed Symmetry Breaking in Hypergraphs.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Distributed Algorithmic Foundations of Dynamic Networks.
Proceedings of the Structural Information and Communication Complexity, 2014

Can quantum communication speed up distributed computation?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

DEX: Self-Healing Expanders.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013
Stochastic analysis of a churn-tolerant structured peer-to-peer scheme.
Peer-to-Peer Networking and Applications, 2013

Distributed Random Walks.
J. ACM, 2013

Coalescing-branching random walks on graphs.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

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

On the Complexity of Information Spreading in Dynamic Networks.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

On the complexity of universal leader election.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

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

Fast Distributed PageRank Computation.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Sublinear Bounds for Randomized Leader Election.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Efficient Computation of Balanced Structures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Almost-Optimal Gossip-Based Aggregate Computation.
SIAM J. Comput., 2012

Fast Distributed Computation in Dynamic Networks via Random Walks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient computation of distance sketches in distributed networks.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Discovery through gossip.
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

Ballast: A Ball-Based Algorithm for Structural Motifs.
Proceedings of the Research in Computational Molecular Biology, 2012

Near-optimal random walk sampling in distributed networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Distributed verification and hardness of distributed approximation.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Xheal: localized self-healing using expanders.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

A tight unconditional lower bound on distributed randomwalk computation.
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.
J. Comput. Syst. Sci., 2010

Optimal gossip-based aggregate computation.
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.
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.
IEEE Trans. Parallel Distrib. Syst., 2009

Energy-Optimal Distributed Algorithms for Minimum Spanning Trees.
IEEE Journal on Selected Areas in Communications, 2009

Fast distributed random walks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Brief announcement: locality-based aggregate computation in wireless sensor networks.
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.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Distributed quantum computing: a new frontier in distributed systems or science fiction?
SIGACT News, 2008

Improved random graph isomorphism.
J. Discrete Algorithms, 2008

Energy-optimal distributed algorithms for minimum spanning trees.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Efficient distributed approximation algorithms via probabilistic tree embeddings.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Contact replacement for NMR resonance assignment.
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.
Theor. Comput. Sci., 2007

Entropy-based bounds for online algorithms.
ACM Trans. Algorithms, 2007

Analysis of Randomized Protocols for Conflict-Free Distributed Access.
Algorithmica, 2007

On the Hardness of Optimization in Power Law Graphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

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

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Distance Matrix Reconstruction from Incomplete Distance Information for Sensor Network Localization.
Proceedings of the Third Annual IEEE Communications Society Conference on Sensor, 2006

Query Protocols for Highly Resilient Peer-to-Peer Networks.
Proceedings of the ISCA 19th International Conference on Parallel and Distributed Computing Systems, 2006

2005
On a simple randomized algorithm for finding a 2-factor in sparse graphs.
Inf. Process. Lett., 2005

The bin-covering technique for thresholding random geometric graph properties.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Brief announcement: analysis of a randomized contention-resolution protocol for distributed access.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Latency-sensitive power control for wireless ad-hoc networks.
Proceedings of the Q2SWinet'05, 2005

A universal online caching algorithm based on pattern matching.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis.
Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, 2005

2004
A random graph approach to NMR sequential assignment.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

2003
Building low-diameter peer-to-peer networks.
IEEE Journal on Selected Areas in Communications, 2003

2002
The restriction mapping problem revisited.
J. Comput. Syst. Sci., 2002

Using PageRank to Characterize Web Structure.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Can entropy characterize performance of online algorithms?.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Building Low-Diameter P2P Networks.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

1999
Static and Dynamic Evaluation of QoS Properties.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Computing Near Optimal Strategies for Stochastic Investment Planning Problems.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999


  Loading...