default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAravind Srinivasan
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j99]Alok Baveja
, Xiaoran Qu, Aravind Srinivasan:
Approximating weighted completion time via stronger negative correlation. J. Sched. 27(4): 319-328 (2024)- [j98]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu, Yifan Xu:
Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals. ACM Trans. Economics and Comput. 12(2): 6 (2024) - [c145]Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation. ICML 2024 - [c144]Juan Luque, Sharmila Duppala, John P. Dickerson, Aravind Srinivasan:
Barter Exchange with Shared Item Valuations. WWW 2024: 199-210 - [i48]Juan Luque, Sharmila Duppala, John Dickerson, Aravind Srinivasan:
Barter Exchange with Shared Item Valuations. CoRR abs/2406.13983 (2024) - 2023
- [j97]George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Deploying vaccine distribution sites for improved accessibility and equity to support pandemic response. Auton. Agents Multi Agent Syst. 37(2): 31 (2023) - [c143]Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng, Vedant Nanda, Aravind Srinivasan, John P. Dickerson:
Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual. AAAI 2023: 5624-5632 - [c142]Da Qi Chen, Ann Li, George Z. Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers. IJCAI 2023: 64-72 - [c141]Sharmila Duppala, Juan Luque, John P. Dickerson, Aravind Srinivasan:
Group Fairness in Set Packing Problems. IJCAI 2023: 391-399 - [c140]Christine Herlihy, Aviva Prins, Aravind Srinivasan, John P. Dickerson:
Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. KDD 2023: 732-740 - [c139]Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. SODA 2023: 987-1011 - [i47]Joseph Naor, Aravind Srinivasan, David Wajc:
Online Dependent Rounding Schemes. CoRR abs/2301.08680 (2023) - [i46]Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva:
Concentration of Submodular Functions Under Negative Dependence. CoRR abs/2309.05554 (2023) - 2022
- [j96]Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Frits van Merode:
Dynamic Layout Design Optimization to Improve Patient Flow in Outpatient Clinics Using Genetic Algorithms. Algorithms 15(3): 85 (2022) - [j95]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Dependent randomized rounding for clustering and partition systems with knapsack constraints. J. Mach. Learn. Res. 23: 81:1-81:41 (2022) - [j94]Subrahmanya Swamy Peruru, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan:
Low-complexity scheduling algorithms with constant queue length and throughput guarantees. Perform. Evaluation 157-158: 102310 (2022) - [c138]Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Fair Disaster Containment via Graph-Cut Problems. AISTATS 2022: 6321-6333 - [c137]Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas:
A New Notion of Individually Fair Clustering: α-Equitable k-Center. AISTATS 2022: 6387-6408 - [c136]Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. AISTATS 2022: 11641-11654 - [c135]George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. AAMAS 2022: 789-797 - [c134]Aravind Srinivasan, Pan Xu:
The Generalized Magician Problem under Unknown Distributions and Related Applications. AAMAS 2022: 1219-1227 - [c133]Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson:
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. AAMAS 2022: 1583-1585 - [c132]George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao:
Theoretical Models and Preliminary Results for Contact Tracing and Isolation. AAMAS 2022: 1672-1674 - [c131]Naveen Durvasula, Aravind Srinivasan, John P. Dickerson:
Forecasting Patient Outcomes in Kidney Exchange. IJCAI 2022: 5052-5058 - [c130]Jiangzhuo Chen, Stefan Hoops, Achla Marathe, Henning S. Mortveit, Bryan L. Lewis, Srinivasan Venkatramanan, Arash Haddadan, Parantapa Bhattacharya, Abhijin Adiga, Anil Vullikanti, Aravind Srinivasan, Mandy L. Wilson, Gal Ehrlich, Maier Fenster, Stephen G. Eubank, Christopher L. Barrett, Madhav V. Marathe:
Effective Social Network-Based Allocation of COVID-19 Vaccines. KDD 2022: 4675-4683 - [i45]Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson:
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. CoRR abs/2201.06021 (2022) - [i44]George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. CoRR abs/2202.04705 (2022) - [i43]Amy Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. CoRR abs/2202.08296 (2022) - [i42]Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. CoRR abs/2210.13395 (2022) - 2021
- [j93]Antares Chen, David G. Harris, Aravind Srinivasan:
Partial resampling to approximate covering integer programs. Random Struct. Algorithms 58(1): 68-93 (2021) - [j92]Nikhil Bansal, Aravind Srinivasan, Ola Svensson:
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. 50(3) (2021) - [j91]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. ACM Trans. Economics and Comput. 9(3): 13:1-13:17 (2021) - [c129]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas:
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. AAAI 2021: 6822-6830 - [c128]Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan:
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. AISTATS 2021: 2872-2880 - [c127]Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM 2021: 23:1-23:22 - [c126]Jaikumar Radhakrishnan, Aravind Srinivasan:
Property B: Two-Coloring Non-Uniform Hypergraphs. FSTTCS 2021: 31:1-31:8 - [c125]Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John Dickerson:
Fair Clustering Under a Bounded Cost. NeurIPS 2021: 14345-14357 - [c124]Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan:
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. NeurIPS 2021: 27184-27195 - [i41]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas:
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. CoRR abs/2103.02013 (2021) - [i40]Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas:
A New Notion of Individually Fair Clustering: α-Equitable k-Center. CoRR abs/2106.05423 (2021) - [i39]Amy Babay, Michael Dinitz, Prathyush Sambaturu, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Fair Disaster Containment via Graph-Cut Problems. CoRR abs/2106.05424 (2021) - [i38]Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan:
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. CoRR abs/2106.06892 (2021) - [i37]Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John P. Dickerson:
Fair Clustering Under a Bounded Cost. CoRR abs/2106.07239 (2021) - [i36]Christine Herlihy, Aviva Prins, Aravind Srinivasan, John Dickerson:
Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. CoRR abs/2106.07677 (2021) - [i35]George Z. Li, Arash Haddadan, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Anil Vullikanti, Zeyu Zhao:
A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation. CoRR abs/2112.15547 (2021) - 2020
- [j90]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica 82(1): 64-87 (2020) - [j89]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Online Stochastic Matching: New Algorithms and Bounds. Algorithmica 82(10): 2737-2783 (2020) - [j88]Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Godefridus G. van Merode:
Integral patient scheduling in outpatient clinics under demand uncertainty to minimize patient waiting times. Health Informatics J. 26(1) (2020) - [j87]Jyoti R. Munavalli, Shyam Vasudeva Rao, Aravind Srinivasan, Godefridus G. van Merode:
An intelligent real-time scheduler for out-patient clinics: A multi-agent system model. Health Informatics J. 26(4): 2383-2406 (2020) - [j86]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms 16(1): 10:1-10:32 (2020) - [c123]Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan:
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AAAI 2020: 2210-2217 - [c122]Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan:
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AIES 2020: 131 - [c121]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Dependent randomized rounding for clustering and partition systems with knapsack constraints. AISTATS 2020: 2273-2283 - [c120]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas:
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. ICML 2020: 1178-1189 - [c119]Brian Brubach, Aravind Srinivasan, Shawn Zhao:
Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives. EC 2020: 815-833 - [i34]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas:
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. CoRR abs/2007.07384 (2020) - [i33]Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. CoRR abs/2008.03325 (2020) - [i32]Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR abs/2010.08142 (2020)
2010 – 2019
- 2019
- [j85]David G. Harris, Aravind Srinivasan:
The Moser-Tardos Framework with Partial Resampling. J. ACM 66(5): 36:1-36:45 (2019) - [j84]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation Algorithms for Stochastic Clustering. J. Mach. Learn. Res. 20: 153:1-153:33 (2019) - [j83]Aravind Srinivasan:
Editorial. ACM Trans. Algorithms 15(2): 16:1 (2019) - [j82]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems With Outliers. ACM Trans. Algorithms 15(3): 36:1-36:25 (2019) - [c118]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. AAAI 2019: 1877-1884 - [c117]Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas:
A Unified Approach to Online Matching with Conflict-Aware Constraints. AAAI 2019: 2221-2228 - [c116]John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu:
Online Resource Allocation with Matching Constraints. AAMAS 2019: 1681-1689 - [c115]Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu:
Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare. WINE 2019: 129-141 - [i31]Brian Brubach, Nathaniel Grammel, Aravind Srinivasan:
Vertex-weighted Online Stochastic Matching with Patience Constraints. CoRR abs/1907.03963 (2019) - [i30]Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu:
Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare. CoRR abs/1912.00225 (2019) - [i29]Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan:
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours. CoRR abs/1912.08388 (2019) - 2018
- [j81]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica 80(4): 1093-1114 (2018) - [j80]Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu:
Improved Bounds in Stochastic Matching and Optimization. Algorithmica 80(11): 3225-3252 (2018) - [j79]David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. Random Struct. Algorithms 52(1): 74-135 (2018) - [j78]Barna Saha, Aravind Srinivasan:
A new approximation technique for resource-allocation problems. Random Struct. Algorithms 52(4): 680-715 (2018) - [j77]Jaroslaw Byrka, Aravind Srinivasan:
Approximation Algorithms for Stochastic and Risk-Averse Optimization. SIAM J. Discret. Math. 32(1): 44-63 (2018) - [j76]Aravind Srinivasan:
Probability and Computing. SIGACT News 49(3): 20-22 (2018) - [c114]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. AAAI 2018: 1007-1014 - [c113]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. AAMAS 2018: 318-326 - [c112]David G. Harris, Shi Li, Aravind Srinivasan, Khoa Trinh, Thomas W. Pensyl:
Approximation algorithms for stochastic clustering. NeurIPS 2018: 6041-6050 - [c111]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. SODA 2018: 311-330 - [c110]Peruru Subrahmanya Swamy, Aravind Srinivasan, Radha Krishna Ganti, Krishna P. Jagannathan:
Hierarchical scheduling algorithms with throughput guarantees and low delay. WiOpt 2018: 1-8 - [i28]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. CoRR abs/1804.08062 (2018) - [i27]David G. Harris, Shi Li, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Approximation algorithms for stochastic clustering. CoRR abs/1809.02271 (2018) - [i26]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. CoRR abs/1811.05100 (2018) - 2017
- [j75]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization. ACM Trans. Algorithms 13(2): 23:1-23:31 (2017) - [j74]David G. Harris, Aravind Srinivasan:
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. ACM Trans. Algorithms 13(3): 33:1-33:40 (2017) - [j73]David G. Harris, Aravind Srinivasan:
A Constructive Lovász Local Lemma for Permutations. Theory Comput. 13(1): 1-41 (2017) - [c109]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems with Outliers. APPROX-RANDOM 2017: 10:1-10:19 - [c108]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. AAMAS 2017: 1223-1231 - [c107]Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu:
Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. AAMAS 2017: 1763-1765 - [c106]Brian Brubach, Jay Ghurye, Mihai Pop, Aravind Srinivasan:
Better Greedy Sequence Clustering with Fast Banded Alignment. WABI 2017: 3:1-3:13 - [i25]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
Symmetric Randomized Dependent Rounding. CoRR abs/1709.06995 (2017) - [i24]David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-type Problems With Outliers. CoRR abs/1710.00287 (2017) - [i23]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. CoRR abs/1711.02724 (2017) - [i22]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. CoRR abs/1711.08345 (2017) - [i21]Jaroslaw Byrka, Aravind Srinivasan:
Approximation algorithms for stochastic and risk-averse optimization. CoRR abs/1712.06996 (2017) - 2016
- [j72]David G. Harris, Aravind Srinivasan:
A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms 48(1): 53-56 (2016) - [j71]David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan:
Efficient computation of sparse structures. Random Struct. Algorithms 49(2): 322-344 (2016) - [j70]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks. ACM Trans. Algorithms 12(3): 28:1-28:25 (2016) - [j69]Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On Computing Maximal Independent Sets of Hypergraphs in Parallel. ACM Trans. Parallel Comput. 3(1): 5:1-5:13 (2016) - [c105]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. ESA 2016: 24:1-24:16 - [c104]Antares Chen, David G. Harris, Aravind Srinivasan:
Partial Resampling to Approximate Covering Integer Programs. SODA 2016: 1984-2003 - [c103]David G. Harris, Aravind Srinivasan:
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. SODA 2016: 2004-2023 - [c102]Nikhil Bansal, Aravind Srinivasan, Ola Svensson:
Lift-and-round to improve weighted completion time on unrelated machines. STOC 2016: 156-167 - [r2]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Minimum Weighted Completion Time. Encyclopedia of Algorithms 2016: 1328-1331 - [i20]David G. Harris, Aravind Srinivasan:
Improved bounds and algorithms for graph cuts and network reliability. CoRR abs/1602.08730 (2016) - [i19]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. CoRR abs/1606.06395 (2016) - [i18]David G. Harris, Aravind Srinivasan:
A constructive algorithm for the LLL on permutations. CoRR abs/1612.02663 (2016) - 2015
- [j68]Naren Ramakrishnan, Chang-Tien Lu, Madhav V. Marathe, Achla Marathe, Anil Vullikanti, Stephen G. Eubank, Scotland Leman, Michael J. Roan, John S. Brownstein, Kristen Maria Summers, Lise Getoor, Aravind Srinivasan, Tanzeem Choudhury, Dipak Gupta, David Mares:
Model-Based Forecasting of Significant Societal Events. IEEE Intell. Syst. 30(5): 86-90 (2015) - [j67]Bo Han, Jian Li, Aravind Srinivasan:
On the Energy Efficiency of Device Discovery in Mobile Opportunistic Networks: A Systematic Approach. IEEE Trans. Mob. Comput. 14(4): 786-799 (2015) - [j66]Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis:
Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. ACM Trans. Comput. Theory 7(3): 10:1-10:10 (2015) - [c101]Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu:
Improved Bounds in Stochastic Matching and Optimization. APPROX-RANDOM 2015: 124-134 - [c100]Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, Aravind Srinivasan:
Selling Tomorrow's Bargains Today. AAMAS 2015: 337-345 - [c99]Aravind Srinivasan, Haihong Zhang, Zhiping Lin, Jit Biswas, Zhihao Chen:
Towards numerical temporal-frequency system modelling of associations between electrocardiogram and ballistocardiogram. EMBC 2015: 394-397 - [c98]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. ESA 2015: 275-287 - [c97]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization. SODA 2015: 737-756 - [i17]David G. Harris, Aravind Srinivasan:
Algorithmic and enumerative aspects of the Moser-Tardos distribution. CoRR abs/1507.02674 (2015) - [i16]Antares Chen, David G. Harris, Aravind Srinivasan:
Partial Resampling to Approximate Covering Integer Programs. CoRR abs/1507.07402 (2015) - [i15]Nikhil Bansal, Ola Svensson, Aravind Srinivasan:
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. CoRR abs/1511.07826 (2015) - 2014
- [j65]Aravind Srinivasan:
Review of Visions of Infinity: The Great Mathematical Problems by Ian Stewart. SIGACT News 45(4): 41-45 (2014) - [j64]Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan:
On Random Sampling Auctions for Digital Goods. ACM Trans. Economics and Comput. 2(3): 11:1-11:19 (2014) - [j63]Bo Han, Jian Li, Aravind Srinivasan:
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling. IEEE/ACM Trans. Netw. 22(5): 1389-1400 (2014) - [c96]