( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Distributed Algorithms for Coloring and Network Decomposition Problems

, и . STOC, стр. 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.

Aravind Sekhar

Aravind Pasula

Aravind Bedekar

Aravind Sundaresan

Aravind Kalaiah

 

Другие публикации лиц с тем же именем

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons., , , , и . SODA, стр. 717-724. ACM/SIAM, (2003)INT-MANUS: interactive production control in a distributed environment, , , , , , , , , и 3 other автор(ы). Proceedings of the 12th international conference on Human-computer interaction: applications and services, стр. 1150--1159. Berlin, Heidelberg, Springer-Verlag, (2007)Approximation algorithms for stochastic and risk-averse optimization.. SODA, стр. 1305-1313. SIAM, (2007)Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution., и . SODA, стр. 2004-2023. SIAM, (2016)Techniques for Probabilistic Analysis and Randomness-Efficient Computation.. Cornell University, USA, (1993)Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.. SODA, стр. 692-701. ACM/SIAM, (1997)Efficient algorithms for location and sizing problems in network design., , , , и . GLOBECOM, стр. 2586-2590. IEEE, (2001)Chernoff-Hoeffding Bounds for Applications with Limited Independence., , и . SIAM J. Discret. Math., 8 (2): 223-250 (1995)On computing maximal independent sets of hypergraphs in parallel., , , и . SPAA, стр. 42-50. ACM, (2014)Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families., , , и . RANDOM-APPROX, том 1671 из Lecture Notes in Computer Science, стр. 11-15. Springer, (1999)