Aravind Srinivasan
Affiliations: | Computer Science | University of Maryland, College Park, College Park, MD |
Area:
Theoretical Computer Science,Bioinformatics and Computational BiologyGoogle:
"Aravind Srinivasan"Children
Sign in to add trainee| Nan Wang | grad student | 2005 | University of Maryland |
| Srinivasan Parthasarathy | grad student | 2006 | University of Maryland |
| Thomas DuBois | grad student | 2011 | University of Maryland |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Brubach B, Sankararaman KA, Srinivasan A, et al. (2020) Algorithms to Approximate Column-sparse Packing Problems Acm Transactions On Algorithms. 16: 1-32 |
| Brubach B, Sankararaman KA, Srinivasan A, et al. (2020) Online Stochastic Matching: New Algorithms and Bounds Algorithmica |
| Dickerson JP, Sankararaman KA, Srinivasan A, et al. (2019) Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity Proceedings of the Aaai Conference On Artificial Intelligence. 33: 1877-1884 |
| Harris DG, Srinivasan A. (2019) The Moser--Tardos Framework with Partial Resampling Journal of the Acm. 66: 1-45 |
| Brubach B, Sankararaman KA, Srinivasan A, et al. (2019) Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts Algorithmica. 82: 64-87 |
| Byrka J, Srinivasan A. (2018) Approximation Algorithms for Stochastic and Risk-Averse Optimization Siam Journal On Discrete Mathematics. 32: 44-63 |
| Byrka J, Pensyl T, Rybicki B, et al. (2018) An Improved Approximation Algorithm for Knapsack Median Using Sparsification Algorithmica. 80: 1093-1114 |
| Saha B, Srinivasan A. (2018) A new approximation technique for resource-allocation problems Random Structures & Algorithms. 52: 680-715 |
| Harris DG, Srinivasan A. (2017) Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution Acm Transactions On Algorithms. 13: 1-40 |
| Harris DG, Srinivasan A. (2017) Improved bounds and algorithms for graph cuts and network reliability Random Structures & Algorithms. 52: 74-135 |