Ravi Sundaram

Orcid: 0000-0001-5657-4298

  • Northeastern University, Boston, USA

According to our database1, Ravi Sundaram authored at least 87 papers between 1991 and 2023.

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



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


PAC-learning for Strategic Classification.
J. Mach. Learn. Res., 2023

Sample Complexity of Opinion Formation on Networks.
CoRR, 2023

Online Paging with Heterogeneous Cache Slots.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Realization problems on reachability sequences.
Theor. Comput. Sci., 2021

Resilience and coevolution of preferential interdependent networks.
Soc. Netw. Anal. Min., 2020

Cache Me if You Can: Capacitated Selfish Replication Games in Networks.
Theory Comput. Syst., 2020

Attention improves concentration when learning node embeddings.
CoRR, 2020

Nexus: a GPU cluster engine for accelerating DNN-based video analysis.
Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

On the Migration of Researchers across Scientific Domains.
Proceedings of the Thirteenth International Conference on Web and Social Media, 2019

Retracting Graphs to Cycles.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Plane Gossip: Approximating Rumor Spread in Planar Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Skyline Identification in Multi-Arm Bandits.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Resilience and the Coevolution of Interdependent Multiplex Networks.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

Colocation, Colocation, Colocation: Optimizing Placement in the Hybrid Cloud.
Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

Skyline Identification in Multi-Armed Bandits.
CoRR, 2017

High Availability for VM Placement and a Stochastic Model for Multiple Knapsack.
Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

Chiron: A Robust Recommendation System with Graph Regularizer.
Proceedings of the 10th International Conference on Computer Recognition Systems CORES 2017, 2017

Symmetric Interdiction for Matching Problems.
Proceedings of the Approximation, 2017

Chiron: A Robust Recommendation System.
CoRR, 2016

Markovian Hitters and the Complexity of Blind Rendezvous.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A study of the structure and vulnerabilities of metropolitan area networks.
Proceedings of the 8th International Conference on Communication Systems and Networks, 2016

Balls and Funnels: Energy Efficient Group-to-Group Anycasts.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On the network you keep: analyzing persons of interest using Cliqster.
Soc. Netw. Anal. Min., 2015

Secure and scalable match: overcoming the universal circuit bottleneck using group programs.
Proc. Priv. Enhancing Technol., 2015

SamaritanCloud: Secure infrastructure for scalable location-based services.
Comput. Commun., 2015

Rumors Across Radio, Wireless, Telephone.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

An Upper Bound on Trilaterating Simple Polygons.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Multiplex networks: a Generative Model and Algorithmic Complexity.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Designing Overlapping Networks for Publish-Subscribe Systems.
Proceedings of the Approximation, 2015

SmartShift: Expanded Load Shifting Incentive Mechanism for Risk-Averse Consumers.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget.
J. Comput. Syst. Sci., 2014

Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree Constraints.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Deterministic Blind Rendezvous in Cognitive Radio Networks.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

Delay-Tolerant Bulk Data Transfers on the Internet.
IEEE/ACM Trans. Netw., 2013

Scheduler vulnerabilities and coordinated attacks in cloud computing.
J. Comput. Secur., 2013

SamaritanCloud: Secure and scalable infrastructure for enabling location-based services.
Proceedings of the IFIP Networking Conference, 2013, Brooklyn, 2013

Maygh: building a CDN from client web browsers.
Proceedings of the Eighth Eurosys Conference 2013, 2013

WebCloud: Recruiting Social Network Users to Assist in Content Distribution.
Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

Cache Me If You Can: Capacitated Selfish Replication Games.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Prediction of Arrival of Nodes in a Scale Free Network.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

Scheduler Vulnerabilities and Attacks in Cloud Computing
CoRR, 2011

Content delivery through the ages: Akamai to WebCloud.
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, 2011

PhoneGuard: a smartphone in the coalmine.
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, 2011

Capacitated Caching Games
CoRR, 2010

Home is where the (fast) internet is: flat-rate compatible incentives for reducing peak load.
Proceedings of the 2010 ACM SIGCOMM workshop on Home networks, 2010

Existence Theorems and Approximation Algorithms for Generalized Network Security Games.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

Algorithms for Constrained Bulk-Transfer of Delay-Tolerant Data.
Proceedings of IEEE International Conference on Communications, 2010

Reducibility Among Fractional Stability Problems.
Electron. Colloquium Comput. Complex., 2009

Delay tolerant bulk data transfers on the internet.
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Preprocessing DNS Log Data for Effective Data Mining.
Proceedings of IEEE International Conference on Communications, 2009

Preference Games and Personalized Equilibria, with Applications to Fractional BGP
CoRR, 2008

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.
J. ACM, 2007

A bounded-degree network formation game
CoRR, 2007

On Completing Latin Squares.
Proceedings of the STACS 2007, 2007

A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses.
Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007

SPREAD: Foiling Smart Jammers Using Multi-Layer Agility.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Meet and merge: Approximation algorithms for confluent flows.
J. Comput. Syst. Sci., 2006

Steganographic Communication in Ordered Channels.
Proceedings of the Information Hiding, 8th International Workshop, 2006

The Confluent Capacity of the Internet: Congestion vs. Dilation.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2006

Universal approximations for TSP, Steiner tree, and set cover.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Unweaving a web of documents.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Minimum energy accumulative routing in wireless networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

(Almost) tight bounds and existence theorems for confluent flows.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Managing a portfolio of overlay paths.
Proceedings of the Network and Operating System Support for Digital Audio and Video, 2004

A methodology for estimating interdomain web traffic demand.
Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004

Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices.
Proceedings of the Advances in Cryptology, 2004

Alternation in interaction.
Comput. Complex., 2000

Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci., 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms, 1999

Approximating Latin Square Extensions.
Algorithmica, 1999

Bicriteria Network Design Problems.
J. Algorithms, 1998

On embedding complete graphs into hypercubes.
Discret. Math., 1998

A Note on the Asymptotics and Computational Complexity of Graph Distinguishability.
Electron. J. Comb., 1998

Symmetric Alternation Captures BPP.
Comput. Complex., 1998

A Note on Optical Routing on Trees.
Inf. Process. Lett., 1997

Faster Algorithms for Optical Switch Configuration.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

Improved results on service-constrained network design problems.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Interactive proof system variants and approximation algorithms for optical networks.
PhD thesis, 1996

Spanning Trees - Short or Small.
SIAM J. Discret. Math., 1996

Service-Constrained Network Design Problems.
Nord. J. Comput., 1996

The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE.
Inf. Process. Lett., 1995

Treewidth of Circular-Arc Graphs.
SIAM J. Discret. Math., 1994

Efficient Parallel Shuffle Recognition.
Parallel Process. Lett., 1994

Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.
Theor. Comput. Sci., 1993

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.
Proceedings of the 6th International Parallel Processing Symposium, 1992

Treewidth of Circular-Arc Graphs (Abstract).
Proceedings of the Algorithms and Data Structures, 1991