Aravind Srinivasan
According to our database^{1},
Aravind Srinivasan
authored at least 200 papers
between 1991 and 2021.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2014, "For contributions to algorithms, probabilistic methods, and networks.".
IEEE Fellow
IEEE Fellow 2010, "For contributions to randomized algorithms and probabilistic methods".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org

on cs.umd.edu
On csauthors.net:
Bibliography
2021
Random Struct. Algorithms, 2021
CoRR, 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.
CoRR, 2021
CoRR, 2021
CoRR, 2021
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
Fairness, SemiSupervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints.
Proceedings of the ThirtyFifth AAAI Conference on Artificial Intelligence, 2021
2020
ACM Trans. Algorithms, 2020
An intelligent realtime scheduler for outpatient clinics: A multiagent system model.
Health Informatics J., 2020
Integral patient scheduling in outpatient clinics under demand uncertainty to minimize patient waiting times.
Health Informatics J., 2020
CoRR, 2020
Approximation Algorithms for RadiusBased, TwoStage Stochastic Clustering Problems with Budget Constraints.
CoRR, 2020
Algorithmica, 2020
Attenuate Locally, Win Globally: AttenuationBased Frameworks for Online Stochastic Matching with Timeouts.
Algorithmica, 2020
Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Dependent randomized rounding for clustering and partition systems with knapsack constraints.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during HighDemand Hours.
Proceedings of the ThirtyFourth AAAI Conference on Artificial Intelligence, 2020
2019
ACM Trans. Algorithms, 2019
ACM Trans. Algorithms, 2019
J. Mach. Learn. Res., 2019
J. ACM, 2019
CoRR, 2019
CoRR, 2019
Proceedings of the Web and Internet Economics  15th International Conference, 2019
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
2018
SIGACT News, 2018
SIAM J. Discret. Math., 2018
Random Struct. Algorithms, 2018
Random Struct. Algorithms, 2018
Algorithmica, 2018
Algorithmica, 2018
Proceedings of the 16th International Symposium on Modeling and Optimization in Mobile, 2018
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Twosided Arrivals.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018
Allocation Problems in RideSharing Platforms: Online Matching With Offline Reusable Resources.
Proceedings of the ThirtySecond AAAI Conference on Artificial Intelligence, 2018
2017
Theory Comput., 2017
ACM Trans. Algorithms, 2017
An Improved Approximation for <i>k</i>Median and Positive Correlation in Budgeted Optimization.
ACM Trans. Algorithms, 2017
CoRR, 2017
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
Attenuate Locally, Win Globally: An Attenuationbased Framework for Online Stochastic Matching with Timeouts.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
2016
Encyclopedia of Algorithms, 2016
ACM Trans. Parallel Comput., 2016
Distributed Algorithms for EndtoEnd Packet Scheduling in Wireless Ad Hoc Networks.
ACM Trans. Algorithms, 2016
Random Struct. Algorithms, 2016
Random Struct. Algorithms, 2016
CoRR, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Lower Bounds on the Deterministic and Quantum Communication Complexity of HammingDistance Problems.
ACM Trans. Comput. Theory, 2015
On the Energy Efficiency of Device Discovery in Mobile Opportunistic Networks: A Systematic Approach.
IEEE Trans. Mob. Comput., 2015
IEEE Intell. Syst., 2015
Towards numerical temporalfrequency system modelling of associations between electrocardiogram and ballistocardiogram.
Proceedings of the 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2015
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
2014
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through RandomWalk Sampling.
IEEE/ACM Trans. Netw., 2014
ACM Trans. Economics and Comput., 2014
SIGACT News, 2014
An Improved Approximation for $k$median, and Positive Correlation in Budgeted Optimization.
CoRR, 2014
A monolithicallyintegrated optical transmitter and receiver in a zerochange 45nm SOI process.
Proceedings of the Symposium on VLSI Circuits, 2014
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
'Beating the news' with EMBERS: forecasting civil unrest using open source indicators.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014
2013
Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints.
IEEE/ACM Trans. Netw., 2013
Special Section on the FortySecond Annual ACM Symposium on Theory of Computing (STOC 2010).
SIAM J. Comput., 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Proceedings of the 10th Annual IEEE International Conference on Sensing, 2013
Proceedings of the Automata, Languages, and Programming  40th International Colloquium, 2013
2012
Theory Comput., 2012
Mobile Data Offloading through Opportunistic Communications and Social Participation.
IEEE Trans. Mob. Comput., 2012
Electron. J. Comb., 2012
Your friends have more friends than you do: identifying influential mobile users through random walks.
Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2012
Proceedings of the ACM International Health Informatics Symposium, 2012
eDiscovery: Energy efficient device discovery for mobile opportunistic communications.
Proceedings of the 20th IEEE International Conference on Network Protocols, 2012
Efficient booster pump placement in water networks using graph theoretic principles.
Proceedings of the 2012 International Green Computing Conference, 2012
Proceedings of the Fourth International Conference on Communication Systems and Networks, 2012
2011
Wirel. Networks, 2011
Theor. Comput. Sci., 2011
J. ACM, 2011
CoRR, 2011
Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011
Approximation algorithms for throughput maximization in wireless networks with delay constraints.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011
2010
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2010
Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009.
SIGACT News, 2010
CoRR, 2010
Proceedings of the 5th ACM workshop on Challenged networks, 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks.
Proceedings of the Seventh International Conference on Networked Sensing Systems, 2010
2009
J. ACM, 2009
Algorithmica, 2009
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009
Distributed Strategies for Channel Allocation and Scheduling in SoftwareDefined Radio Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
IEEE Trans. Mob. Comput., 2008
Inf. Process. Lett., 2008
Algorithmica, 2008
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Approximation, 2008
Innovization: Discovery of Innovative Design Principles Through Multiobjective Evolutionary Optimization.
Proceedings of the Multiobjective Problem Solving from Nature, 2008
2007
SIAM J. Comput., 2007
IEEE J. Sel. Areas Commun., 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007
Proceedings of the High Performance Computing, 2007
Proceedings of the HumanComputer Interaction. HCI Applications and Services, 2007
2006
IEEE/ACM Trans. Netw., 2006
Theory Comput., 2006
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2006
SIGACT News, 2006
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.
SIAM J. Comput., 2006
Networks, 2006
Theory Comput. Syst., 2006
J. Parallel Distributed Comput., 2006
J. Comput. Syst. Sci., 2006
J. ACM, 2006
Lower Bounds on the Deterministic and Quantum Communication Complexities of HammingDistance Problems.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Proceedings of the Genetic and Evolutionary Computation Conference, 2006
A PopulationBased, Parent Centric Procedure for Constrained RealParameter Optimization.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006
2005
Fast distributed algorithms for (weakly) connected dominating sets and linearsize skeletons.
J. Comput. Syst. Sci., 2005
J. Comput. Secur., 2005
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
SIAM J. Discret. Math., 2004
J. Comput. Syst. Sci., 2004
J. Algorithms, 2004
Lower bounds on the Deterministic and Quantum Communication Complexity of HAM<sub>n</sub><sup>a</sup>
Electron. Colloquium Comput. Complex., 2004
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance
CoRR, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Network and Operating System Support for Digital Audio and Video, 2004
Proceedings of the Discrete Methods in Epidemiology, 2004
2003
Theor. Comput. Sci., 2003
Statistical Analysis of Algorithms: A Case Study of MarketClearing Mechanisms in the Power Industry.
J. Graph Algorithms Appl., 2003
J. Comput. Syst. Sci., 2003
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
2002
SIAM J. Comput., 2002
Random Struct. Algorithms, 2002
J. Algorithms, 2002
Proceedings of the 2002 IEEE Symposium on Security and Privacy, 2002
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002
2001
The oneinclusion graph algorithm is nearoptimal for the prediction model of learning.
IEEE Trans. Inf. Theory, 2001
SIAM J. Discret. Math., 2001
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
SIAM J. Comput., 2001
J. Comput. Syst. Sci., 2001
Experimental Analysis of Algorithms for BilateralContract Clearing Mechanisms Arising in Deregulated Power Industry.
Proceedings of the Algorithm Engineering, 2001
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Global Telecommunications Conference, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
2000
A ConstantFactor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.
SIAM J. Comput., 2000
Random Struct. Algorithms, 2000
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems.
Math. Oper. Res., 2000
Multim. Syst., 2000
J. Comput. Syst. Sci., 2000
J. ACM, 2000
Inf. Process. Lett., 2000
Inf. Process. Lett., 2000
Electron. Colloquium Comput. Complex., 2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000
1999
SIAM J. Comput., 1999
SIAM J. Comput., 1999
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Applicationlayer broker for scalable Internet services with resource reservation.
Proceedings of the 7th ACM International Conference on Multimedia '99, Orlando, FL, USA, October 30, 1999
1998
J. Comput. Syst. Sci., 1998
J. ACM, 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Proceedings of the ThirtyFirst Annual Hawaii International Conference on System Sciences, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Randomized Distributed Edge Coloring via an Extension of the ChernoffHoeffding Bounds.
SIAM J. Comput., 1997
Algorithmica, 1997
Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Eighteenth International Conference on Information Systems, 1997
Improved Approximations for EdgeDisjoint Paths, Unsplittable Flow, and Related Routing Problems.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
A survey of the role of multicommodity flow and randomization in network design and routing.
Proceedings of the Randomization Methods in Algorithm Design, 1997
1996
J. Algorithms, 1996
Improved Parallel Approximation of a Class of Integer Programming Programming Problems.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
1995
SIAM J. Discret. Math., 1995
RandomnessOptimal Unique Element Isolation with Applications to Perfect Matching and Related Problems.
SIAM J. Comput., 1995
Comb., 1995
Proceedings of the TwentySeventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the TwentySeventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
Improved algorithms via approximations of probability distributions (extended abstract).
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992
1991
Inf. Comput., December, 1991
Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.
Theor. Comput. Sci., 1991