( en | de | ru )

 

Disambiguation of "Srinivasan, Aravind"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Distributed Algorithms for Coloring and Network Decomposition Problems

, and . STOC, page 581-592. ACM, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Aravind Sekhar

Aravind Pasula

Aravind Bedekar

Aravind Sundaresan

Aravind Kalaiah

 

Other publications of authors with the same name

Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.. SODA, page 692-701. ACM/SIAM, (1997)INT-MANUS: interactive production control in a distributed environment, , , , , , , , , and 3 other author(s). Proceedings of the 12th international conference on Human-computer interaction: applications and services, page 1150--1159. Berlin, Heidelberg, Springer-Verlag, (2007)Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons., , , , and . SODA, page 717-724. ACM/SIAM, (2003)Your friends have more friends than you do: identifying influential mobile users through random walks., and . MobiHoc, page 5-14. ACM, (2012)Fair Disaster Containment via Graph-Cut Problems., , , , , and . CoRR, (2021)Techniques for Probabilistic Analysis and Randomness-Efficient Computation.. Cornell University, USA, (1993)Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution., and . SODA, page 2004-2023. SIAM, (2016)Approximation algorithms for stochastic and risk-averse optimization.. SODA, page 1305-1313. SIAM, (2007)Efficient algorithms for location and sizing problems in network design., , , , and . GLOBECOM, page 2586-2590. IEEE, (2001)Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare., , , , , and . WINE, volume 11920 of Lecture Notes in Computer Science, page 129-141. Springer, (2019)