( en | de | ru )

 

Disambiguation of "Srinivasan, Aravind"

Author of the publication

copydeleteadd this publication to your clipboard
Online Resource Allocation with Matching Constraints.

, , , , , and . AAMAS, page 1681-1689. International Foundation for Autonomous Agents and Multiagent Systems, (2019)

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)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)Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks., , , and . INSS, page 93-96. IEEE, (2010)Chernoff-Hoeffding Bounds for Applications with Limited Independence., , and . SIAM J. Discret. Math., 8 (2): 223-250 (1995)Efficient algorithms for location and sizing problems in network design., , , , and . GLOBECOM, page 2586-2590. IEEE, (2001)Algorithms to Approximate Column-Sparse Packing Problems., , , and . CoRR, (2017)Online Resource Allocation with Matching Constraints., , , , , and . AAMAS, page 1681-1689. International Foundation for Autonomous Agents and Multiagent Systems, (2019)Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families., , , and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 11-15. Springer, (1999)Approximation Algorithms for Channel Allocation Problems in Broadcast Networks., , , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 47-58. Springer, (2003)