# Sriram V. Pemmaraju

According to our database

^{1}, Sriram V. Pemmaraju## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2017

Near-Optimal Clustering in the k-machine model.

CoRR, 2017

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

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

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

2016

Super-fast MST Algorithms in the Congested Clique using o(m) Messages.

CoRR, 2016

Using Read-k Inequalities to Analyze a Distributed MIS Algorithm.

CoRR, 2016

Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm.

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

Using Read-k Inequalities to Analyze a Distributed MIS Algorithm.

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages.

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Lessons from the Congested Clique applied to MapReduce.

Theor. Comput. Sci., 2015

Sub-logarithmic distributed algorithms for metric facility location.

Distributed Computing, 2015

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

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

Improving Risk Prediction of Clostridium Difficile Infection Using Temporal Event-Pairs.

Proceedings of the 2015 International Conference on Healthcare Informatics, 2015

2014

Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique.

CoRR, 2014

Near-Constant-Time Distributed Algorithms on a Congested Clique.

CoRR, 2014

Lessons from the Congested Clique Applied to MapReduce.

CoRR, 2014

Near-Constant-Time Distributed Algorithms on a Congested Clique.

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

Lessons from the Congested Clique Applied to MapReduce.

Proceedings of the Structural Information and Communication Complexity, 2014

Brief announcement: Super-fast t-ruling sets.

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

2013

Building self-stabilizing overlay networks with the transitive closure framework.

Theor. Comput. Sci., 2013

A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location.

CoRR, 2013

Super-Fast Distributed Algorithms for Metric Facility Location.

CoRR, 2013

Interactions in an intensive care unit: experiences pre-processing sensor network data.

Proceedings of the Wireless Health 2013, 2013

A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location.

Proceedings of the Distributed Computing - 27th International Symposium, 2013

On the Analysis of a Label Propagation Algorithm for Community Detection.

Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012

On the Analysis of a Label Propagation Algorithm for Community Detection

CoRR, 2012

Super-Fast 3-Ruling Sets

CoRR, 2012

Inferring Realistic Intra-hospital Contact Networks Using Link Prediction and Computer Logins.

Proceedings of the 2012 International Conference on Privacy, 2012

Super-Fast Distributed Algorithms for Metric Facility Location.

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Super-Fast 3-Ruling Sets.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Max-coloring and online coloring with bandwidths on interval graphs.

ACM Trans. Algorithms, 2011

Good Quality Virtual Realization of Unit Disk Graphs.

JoCG, 2011

Building Self-stabilizing Overlay Networks with the Transitive Closure Framework.

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Distributed graph coloring in a few rounds.

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

2010

Sub-Coloring and Hypo-Coloring Interval Graphs.

Discrete Math., Alg. and Appl., 2010

Localized Spanners for Ad Hoc Wireless Networks.

Ad Hoc & Sensor Wireless Networks, 2010

Rapid randomized pruning for fast greedy distributed algorithms.

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

Brief announcement: a framework for building self-stabilizing overlay networks.

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

Modeling and estimating the spatial distribution of healthcare workers.

Proceedings of the ACM International Health Informatics Symposium, 2010

Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network.

Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009

Sub-coloring and Hypo-coloring Interval Graphs.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Return of the primal-dual: distributed metric facilitylocation.

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

Greedy Routing with Bounded Stretch.

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

Finding Facilities Fast.

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.

Proceedings of the Approximation, 2009

2008

An experimental study of different approaches to solve the market equilibrium problem.

ACM Journal of Experimental Algorithmics, 2008

Localized Spanners for Wireless Networks

CoRR, 2008

Local Approximation Schemes for Topology Control

CoRR, 2008

Topology Control and Geographic Routing in Realistic Wireless Networks.

Ad Hoc & Sensor Wireless Networks, 2008

On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations.

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

The Randomized Coloring Procedure with Symmetry-Breaking.

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Fault-containing self-stabilizing distributed protocols.

Distributed Computing, 2007

Temporal Partition in Sensor Networks.

Proceedings of the Stabilization, 2007

Good Quality Virtual Realization of Unit Ball Graphs.

Proceedings of the Algorithms, 2007

Topology Control and Geographic Routing in Realistic Wireless Networks.

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 6th International Conference, 2007

2006

APX-hardness of domination problems in circle graphs.

Inf. Process. Lett., 2006

Local approximation schemes for topology control.

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Distributed Spanner Construction in Doubling Metric Spaces.

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Energy conservation via domatic partitions.

Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

2005

On Equitable Coloring of d-Degenerate Graphs.

SIAM J. Discrete Math., 2005

Approximating interval coloring and max-coloring in chordal graphs.

ACM Journal of Experimental Algorithmics, 2005

On the polynomial time computation of equilibria for certain exchange economies.

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

Topology Control with Limited Geometric Information.

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Approximation Algorithms for the Max-coloring Problem.

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem.

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

The computation of market equilibria.

SIGACT News, 2004

Computing Optimal Diameter-Bounded Polygon Partitions.

Algorithmica, 2004

Approximating Interval Coloring and Max-Coloring in Chordal Graphs.

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Buffer minimization using max-coloring.

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Robust Topology Control Protocols.

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003

Equitable colorings with constant number of colors.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs.

J. Algorithms, 2002

2001

Equitable colorings extend Chernoff-Hoeffding bounds.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Computing optimal alpha-fat and alpha-small decompositions.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Equitable Coloring Extends Chernoff-Hoeffding Bounds.

Proceedings of the Approximation, 2001

2000

Error-detecting codes and fault-containing self-stabilization.

Inf. Process. Lett., 2000

A (2 + epsilon)-approximation scheme for minimum domination on circle graphs.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Stack and Queue Layouts of Directed Acyclic Graphs: Part I.

SIAM J. Comput., 1999

Stack and Queue Layouts of Directed Acyclic Graphs: Part II.

SIAM J. Comput., 1999

Self-Stabilizing Algorithms for Finding Centers and Medians of Trees.

SIAM J. Comput., 1999

Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs.

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Hardness of Approximating Independent Domination in Circle Graphs.

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1997

Stack and Queue Layouts of Posets.

SIAM J. Discrete Math., 1997

A Self-Stabilizing Algorithm for the Maximum Flow Problem.

Distributed Computing, 1997

Using Graph Coloring in an Algebraic Compiler.

Acta Inf., 1997

Tradeoffs in fault-containing self-stabilization.

Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Fault-containing network protocols.

Proceedings of the 1997 ACM symposium on Applied Computing, 1997

Trade-offs in Fault-Containing Self-Stabilization.

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Automatic Data Decomposition for Message-Passing Machines.

Proceedings of the Languages and Compilers for Parallel Computing, 1997

1996

Fault-Containing Self-Stabilizing Algorithms.

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Recognizing Leveled-Planar Dags in Linear Time.

Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

1994

Analysis of the Worst Case Space Complexity of a PR Quadtree.

Inf. Process. Lett., 1994

New Results for the Minimum Weight Triangulation Problem.

Algorithmica, 1994

Self-Stabilizing Algorithms for Finding Centers and Medians of Trees.

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1991

Stack and Queue Layouts of Directed Planar Graphs.

Proceedings of the Planar Graphs, 1991