Aravind Srinivasan

According to our database1, Aravind Srinivasan authored at least 180 papers between 1991 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

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 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Editorial.
ACM Trans. Algorithms, 2019

Online Resource Allocation with Matching Constraints.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Probability and Computing.
SIGACT News, 2018

Approximation Algorithms for Stochastic and Risk-Averse Optimization.
SIAM J. Discrete Math., 2018

Hierarchical scheduling algorithms with throughput guarantees and low delay.
Proceedings of the 16th International Symposium on Modeling and Optimization in Mobile, 2018

Algorithms to Approximate Column-Sparse Packing Problems.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Approximation algorithms for stochastic clustering.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
A Constructive Lovász Local Lemma for Permutations.
Theory of Computing, 2017

An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization.
ACM Trans. Algorithms, 2017

Better Greedy Sequence Clustering with Fast Banded Alignment.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

A Lottery Model for Center-Type Problems with Outliers.
Proceedings of the Approximation, 2017

2016
Minimum Weighted Completion Time.
Encyclopedia of Algorithms, 2016

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks.
ACM Trans. Algorithms, 2016

A note on near-optimal coloring of shift hypergraphs.
Random Struct. Algorithms, 2016

Efficient computation of sparse structures.
Random Struct. Algorithms, 2016

Lift-and-round to improve weighted completion time on unrelated machines.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Partial Resampling to Approximate Covering Integer Programs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems.
TOCT, 2015

On the Energy Efficiency of Device Discovery in Mobile Opportunistic Networks: A Systematic Approach.
IEEE Trans. Mob. Comput., 2015

Model-Based Forecasting of Significant Societal Events.
IEEE Intelligent Systems, 2015

An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

An Improved Approximation Algorithm for Knapsack Median Using Sparsification.
Proceedings of the Algorithms - ESA 2015, 2015

Towards numerical temporal-frequency 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

Selling Tomorrow's Bargains Today.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Improved Bounds in Stochastic Matching and Optimization.
Proceedings of the Approximation, 2015

2014
Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling.
IEEE/ACM Trans. Netw., 2014

Review of Visions of Infinity: The Great Mathematical Problems by Ian Stewart.
SIGACT News, 2014

A monolithically-integrated optical transmitter and receiver in a zero-change 45nm SOI process.
Proceedings of the Symposium on VLSI Circuits, 2014

On computing maximal independent sets of hypergraphs in parallel.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

A constructive algorithm for the Lovász Local Lemma on permutations.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Improved bounds and algorithms for graph cuts and network reliability.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014


2013
Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints.
IEEE/ACM Trans. Netw., 2013

Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010).
SIAM J. Comput., 2013

Constraint satisfaction, packet routing, and the lovasz local lemma.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Enabling energy-aware collaborative mobile data offloading for smartphones.
Proceedings of the 10th Annual IEEE Communications Society Conference on Sensor, 2013

Efficient Computation of Balanced Structures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

The Moser-Tardos Framework with Partial Resampling.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
Solving Packing Integer Programs via Randomized Rounding with Alterations.
Theory of Computing, 2012

Mobile Data Offloading through Opportunistic Communications and Social Participation.
IEEE Trans. Mob. Comput., 2012

The Effect of Random Edge Removal on Network Degree Sequence.
Electr. 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

Optimizing epidemic protection for socially essential workers.
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

Networking lessons: From computers to water.
Proceedings of the Fourth International Conference on Communication Systems and Networks, 2012

2011
Capacity of wireless networks under SINR interference constraints.
Wireless Networks, 2011

New Constructive Aspects of the Lovász Local Lemma.
J. ACM, 2011

Predicting Trust and Distrust in Social Networks.
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
Mobile data offloading in metropolitan area networks.
Mobile Computing and Communications Review, 2010

Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009.
SIGACT News, 2010

Cellular traffic offloading through opportunistic communications: a case study.
Proceedings of the 5th ACM workshop on Challenged networks, 2010

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

On k-Column Sparse Packing Programs.
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

A New Approximation Technique for Resource-Allocation Problems.
Proceedings of the Innovations in Computer Science, 2010

New Constructive Aspects of the Lovasz Local Lemma.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
A unified approach to scheduling on unrelated parallel machines.
J. ACM, 2009

Rigorous Probabilistic Trust-Inference with Applications to Clustering.
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009

On random sampling auctions for digital goods.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Maximum Bipartite Flow in Networks with Adaptive Channel Width.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Minimum Weighted Completion Time.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Efficient and Resilient Backbones for Multihop Wireless Networks.
IEEE Trans. Mob. Comput., 2008

A note on the distribution of the number of prime factors of the integers.
Inf. Process. Lett., 2008

Improved algorithmic versions of the Lovász Local Lemma.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.
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

The Randomized Coloring Procedure with Symmetry-Breaking.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Budgeted Allocations in the Full-Information Setting.
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
Efficient lookup on unstructured topologies.
IEEE Journal on Selected Areas in Communications, 2007

Approximation algorithms for stochastic and risk-averse optimization.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Randomized Algorithms and Probabilistic Analysis in Wireless Networking.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Cross-layer latency minimization in wireless networks with SINR constraints.
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

Distributed Ranked Search.
Proceedings of the High Performance Computing, 2007

INT-MANUS: Interactive Production Control in a Distributed Environment.
Proceedings of the Human-Computer Interaction. HCI Applications and Services, 2007

2006
An Improved Approximation Ratio for the Covering Steiner Problem.
Theory of Computing, 2006

Client-driven channel management for wireless LANs.
Mobile Computing and Communications Review, 2006

Review of "The Random Projection Method by Santosh Vempala".
SIGACT News, 2006

Foreword.
Theory Comput. Syst., 2006

Provable algorithms for parallel generalized sweep scheduling.
J. Parallel Distrib. Comput., 2006

Dependent rounding and its applications to approximation algorithms.
J. ACM, 2006

Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

A Client-Driven Approach for Channel Management in Wireless LANs.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Innovization: innovating design principles through optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

A Population-Based, Parent Centric Procedure for Constrained Real-Parameter Optimization.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2005
P5: A protocol for scalable anonymous communication.
Journal of Computer Security, 2005

Algorithmic aspects of capacity in wireless networks.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Efficient lookup on unstructured topologies.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Approximation Algorithms for Scheduling on Multiple Machines.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.
Proceedings of the Approximation, 2005

2004
Finding Large Independent Sets in Graphs and Hypergraphs.
SIAM J. Discrete Math., 2004

Special issue: 35th Annual ACM Symposium on Theory of Computing.
J. Comput. Syst. Sci., 2004

Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna
Electronic Colloquium on Computational Complexity (ECCC), 2004

End-to-end packet-scheduling in wireless ad-hoc networks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Structural and algorithmic aspects of massive social networks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Scalable resilient media streaming.
Proceedings of the Network and Operating System Support for Digital Audio and Video, 2004

Structure of Social Contact Networks and Their Impact on Epidemics.
Proceedings of the Discrete Methods in Epidemiology, 2004

Cost-Sharing Mechanisms for Network Design.
Proceedings of the Approximation, 2004

2003
When does a random Robin Hood win?
Theor. Comput. Sci., 2003

Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.
J. Graph Algorithms Appl., 2003

On the approximability of clique and related maximization problems.
J. Comput. Syst. Sci., 2003

Integrality ratio for group Steiner trees and directed steiner trees.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Resilient multicast using overlays.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.
Proceedings of the Approximation, 2003

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

On the Covering Steiner Problem.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Approximating the Domatic Number.
SIAM J. Comput., 2002

Approximation algorithms for the covering Steiner problem.
Random Struct. Algorithms, 2002

P5: A Protocol for Scalable Anonymous Communication.
Proceedings of the 2002 IEEE Symposium on Security and Privacy, 2002

Clustering and Server Selection using Passive Monitoring.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Dependent Rounding in Bipartite Graphs.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Improved Approximation Algorithms for the Partial Vertex Cover Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
The one-inclusion graph algorithm is near-optimal for the prediction model of learning.
IEEE Trans. Information Theory, 2001

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
SIAM J. Comput., 2001

Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.
Proceedings of the Algorithm Engineering, 2001

Finding large independent sets of hypergraphs in parallel.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Domatic partitions and the Lovász local lemma.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

New approaches to covering and packing problems.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation Algorithms for Partial Covering Problems.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Efficient algorithms for location and sizing problems in network design.
Proceedings of the Global Telecommunications Conference, 2001

Distributions on Level-Sets with Applications to Approximation Algorithms.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.
SIAM J. Comput., 2000

Improved bounds and algorithms for hypergraph 2-coloring.
Random Struct. Algorithms, 2000

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems.
Math. Oper. Res., 2000

Retrieval Scheduling for Collaborative Multimedia Presentations.
Multimedia Syst., 2000

Improved Algorithms via Approximations of Probability Distributions.
J. Comput. Syst. Sci., 2000

Contention resolution with constant expected delay.
J. ACM, 2000

Approximating low-congestion routing and column-restricted packing problems.
Inf. Process. Lett., 2000

Approximating Hyper-Rectangles: Learning and Pseudo-random Sets
Electronic Colloquium on Computational Complexity (ECCC), 2000

The value of strong inapproximability results for clique.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Improved bounds on the sample complexity of learning.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Optimal Design of Signaling Networks for Internet Telephony.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Wavelength rerouting in optical networks, or the Venetian routing problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Computing with Very Weak Random Sources.
SIAM J. Comput., 1999

Improved Approximation Guarantees for Packing and Covering Integer Programs.
SIAM J. Comput., 1999

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families.
Proceedings of the Randomization, 1999

Application-layer 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
Approximating Hyper-Rectangles: Learning and Pseudorandom Sets.
J. Comput. Syst. Sci., 1998

Explicit OR-Dispersers with Polylogarithmic Degree.
J. ACM, 1998

Low-Bandwidth Routing and Electrical Power Networks.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Multicommodity Flow and Circuit Switching.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

Improved Bounds and Algorithms for Hypergraph Two-Coloring.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds.
SIAM J. Comput., 1997

Improved Parallel Approximation of a Class of Integer Programming Problems.
Algorithmica, 1997

A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Better Approximation Guarantees for Job-shop Scheduling.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Mechanism design for intellectual property rights protection.
Proceedings of the Eighteenth International Conference on Information Systems, 1997

Improved Approximations for Edge-Disjoint 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
On the Complexity of Distributed Network Decomposition.
J. Algorithms, 1996

An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete 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
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems.
SIAM J. Comput., 1995

The Local Natur of Delta-Coloring and its Algorithmic Applications.
Combinatorica, 1995

Improved approximations of packing and covering problems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Explicit dispersers with polylog degree.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Contention Resolution with Bounded Delay.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Splitters and Near-Optimal Derandomization.
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 Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Computing with Very Weak Random Sources
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Randomness-optimal unique element isolation, with applications to perfect matching and related problems.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Chernoff-Hoeffding Bounds for Applications with Limited Independence.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Improved Distributed Algorithms for Coloring and Network Decomposition Problems
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
On Finding the Minimum Bandwidth of Interval Graphs
Inf. Comput., December, 1991

Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.
Theor. Comput. Sci., 1991


  Loading...