Sriram Pemmaraju

From MaRDI portal
Person:391987



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Connectivity lower bounds in broadcast congested clique2026-03-23Paper
Sample-and-gather: fast ruling set algorithms in the low-memory MPC model2026-03-23Paper
Can We Break Symmetry with o(m) Communication?
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
Exact distributed sampling
Structural Information and Communication Complexity
2024-01-11Paper
The complexity of symmetry breaking in massive graphs2023-02-03Paper
Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets2023-02-03Paper
Large-scale distributed algorithms for facility location with outliers
(available as arXiv preprint)
2022-07-21Paper
Near-optimal clustering in the \(k\)-machine model
Theoretical Computer Science
2021-12-22Paper
Distributed Approximation on Power Graphs
Proceedings of the 39th Symposium on Principles of Distributed Computing
2021-03-15Paper
Connectivity Lower Bounds in Broadcast Congested Clique
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
2021-01-20Paper
Connectivity Lower Bounds in Broadcast Congested Clique
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
2021-01-20Paper
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
2020-12-02Paper
Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
Using read-\(k\) inequalities to analyze a distributed MIS algorithm2018-07-18Paper
Super-fast MST algorithms in the congested clique using \(o(m)\) messages
(available as arXiv preprint)
2018-04-19Paper
Brief announcement: Symmetry breaking in the \textsc{Congest} model: time- and message-efficient algorithms for ruling sets
Proceedings of the ACM Symposium on Principles of Distributed Computing
2017-10-11Paper
Brief announcement: Using read-\(k\) inequalities to analyze a distributed MIS algorithm
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
2017-09-29Paper
An experimental study of different approaches to solve the market equilibrium problem
ACM Journal of Experimental Algorithmics
2017-06-15Paper
Good quality virtual realization of unit disk graphs2017-03-09Paper
Super-fast 3-ruling sets
(available as arXiv preprint)
2017-01-26Paper
On the Analysis of a Label Propagation Algorithm for Community Detection
Distributed Computing and Networking
2016-12-19Paper
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
2016-06-16Paper
Toward optimal bounds in the congested clique, graph connectivity and MST
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
2016-03-23Paper
Lessons from the congested clique applied to MapReduce
Theoretical Computer Science
2015-12-11Paper
Sub-logarithmic distributed algorithms for metric facility location
Distributed Computing
2015-10-20Paper
Fault-containing self-stabilizing algorithms
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96
2015-09-11Paper
Distributed graph coloring in a few rounds
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-09-11Paper
scientific article; zbMATH DE number 6469191 (Why is no real title available?)2015-08-03Paper
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
2015-03-10Paper
Rapid randomized pruning for fast greedy distributed algorithms
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
2015-03-02Paper
Near-constant-time distributed algorithms on a congested clique2015-02-10Paper
On the polynomial time computation of equilibria for certain exchange economies2014-10-13Paper
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms
2014-09-09Paper
Lessons from the Congested Clique Applied to MapReduce
Structural Information and Communication Complexity
2014-08-07Paper
Return of the primal-dual, distributed metric facility location
Proceedings of the 28th ACM symposium on Principles of distributed computing
2014-07-23Paper
Building self-stabilizing overlay networks with the transitive closure framework
Theoretical Computer Science
2014-01-13Paper
Fault-containing self-stabilizing distributed protocols
Distributed Computing
2013-06-20Paper
Super-fast distributed algorithms for metric facility location
Automata, Languages, and Programming
2012-11-01Paper
SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
Discrete Mathematics, Algorithms and Applications
2010-12-15Paper
Sub-coloring and hypo-coloring interval graphs
Graph-Theoretic Concepts in Computer Science
2010-01-21Paper
APX-hardness of domination problems in circle graphs
Information Processing Letters
2009-12-18Paper
scientific article; zbMATH DE number 5625981 (Why is no real title available?)2009-11-05Paper
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009-10-28Paper
Good Quality Virtual Realization of Unit Ball Graphs
Algorithms – ESA 2007
2008-09-25Paper
The Randomized Coloring Procedure with Symmetry-Breaking
Automata, Languages and Programming
2008-08-28Paper
Approximating interval coloring and max-coloring in chordal graphs
ACM Journal of Experimental Algorithmics
2008-06-20Paper
Automata, Languages and Programming
Lecture Notes in Computer Science
2006-01-10Paper
Principles of Distributed Systems
Lecture Notes in Computer Science
2005-12-15Paper
On Equitable Coloring of d-Degenerate Graphs
SIAM Journal on Discrete Mathematics
2005-09-16Paper
Processor-efficient sparse matrix-vector multiplication
Computers & Mathematics with Applications
2005-03-08Paper
scientific article; zbMATH DE number 2134025 (Why is no real title available?)2005-02-15Paper
Computing optimal diameter-bounded polygon partitions
Algorithmica
2004-10-01Paper
scientific article; zbMATH DE number 2079370 (Why is no real title available?)2004-07-28Paper
Equitable colorings extend Chernoff-Hoeffding bounds2003-07-05Paper
scientific article; zbMATH DE number 1833421 (Why is no real title available?)2002-11-21Paper
A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
Journal of Algorithms
2002-07-11Paper
Computing optimal \(\alpha\)-fat and \(\alpha\)-small decompositions2002-03-24Paper
scientific article; zbMATH DE number 1522922 (Why is no real title available?)2001-03-06Paper
scientific article; zbMATH DE number 1522921 (Why is no real title available?)2001-03-05Paper
scientific article; zbMATH DE number 1445364 (Why is no real title available?)2000-05-10Paper
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
2000-03-19Paper
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing
1999-10-28Paper
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing
1999-10-28Paper
Stack and Queue Layouts of Posets
SIAM Journal on Discrete Mathematics
1998-02-09Paper
Using graph coloring in an algebraic compiler
Acta Informatica
1996-09-25Paper
New results for the minimum weight triangulation problem
Algorithmica
1995-01-19Paper
Analysis of the worst case space complexity of a PR quadtree
Information Processing Letters
1994-04-05Paper
scientific article; zbMATH DE number 431507 (Why is no real title available?)1994-01-02Paper


Research outcomes over time


This page was built for person: Sriram Pemmaraju