( en | de | ru )

 

Disambiguation of "Srinivasan, Aravind"

Author of the publication

copydeleteadd this publication to your clipboard
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response.

, , , , , and . AAMAS, page 789-797. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)

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

Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks., , , and . INSS, page 93-96. IEEE, (2010)Fair Disaster Containment via Graph-Cut Problems., , , , , and . CoRR, (2021)Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.. SODA, page 692-701. ACM/SIAM, (1997)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)Your friends have more friends than you do: identifying influential mobile users through random walks., and . MobiHoc, page 5-14. ACM, (2012)Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes., , , and . NeurIPS, page 27184-27195. (2021)Approximation algorithms for stochastic clustering., , , , and . NeurIPS, page 6041-6050. (2018)Improved Approximation Algorithms for the Partial Vertex Cover Problem., and . APPROX, volume 2462 of Lecture Notes in Computer Science, page 161-174. Springer, (2002)Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals., , , and . AAMAS, page 318-326. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)