Ravi Sundaram

Ragavendran Gopalakrishnan

Akshar Varma

Theor. Comput. Sci., 2021

2020

Resilience and coevolution of preferential interdependent networks.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2020

Cache Me if You Can: Capacitated Selfish Replication Games in Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Attention improves concentration when learning node embeddings.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Nexus: a GPU cluster engine for accelerating DNN-based video analysis.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

On the Migration of Researchers across Scientific Domains.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Conference on Web and Social Media, 2019

Retracting Graphs to Cycles.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Plane Gossip: Approximating Rumor Spread in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Skyline Identification in Multi-Arm Bandits.

[BibT_eX]

[DOI]

Albert Cheu

Jonathan R. Ullman

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Resilience and the Coevolution of Interdependent Multiplex Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017

Skyline Identification in Multi-Armed Bandits.

[BibT_eX]

[DOI]

Albert Cheu

Jonathan R. Ullman

CoRR, 2017

High Availability for VM Placement and a Stochastic Model for Multiple Knapsack.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

Chiron: A Robust Recommendation System with Graph Regularizer.

[BibT_eX]

[DOI]

Saber Shokat Fadaee

Mohammad Sajjad Ghaemi

Hossein Azari Soufiani

Proceedings of the 10th International Conference on Computer Recognition Systems CORES 2017, 2017

Symmetric Interdiction for Matching Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2017

2016

Chiron: A Robust Recommendation System.

[BibT_eX]

[DOI]

Saber Shokat Fadaee

Hossein Azari Soufiani

CoRR, 2016

Markovian Hitters and the Complexity of Blind Rendezvous.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A study of the structure and vulnerabilities of metropolitan area networks.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Communication Systems and Networks, 2016

Balls and Funnels: Energy Efficient Group-to-Group Anycasts.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

On the network you keep: analyzing persons of interest using Cliqster.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2015

Secure and scalable match: overcoming the universal circuit bottleneck using group programs.

[BibT_eX]

[DOI]

Rajesh Krishnan

Proc. Priv. Enhancing Technol., 2015

SamaritanCloud: Secure infrastructure for scalable location-based services.

[BibT_eX]

[DOI]

Abhishek Samanta

Fangfei Zhou

Comput. Commun., 2015

Rumors Across Radio, Wireless, Telephone.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

An Upper Bound on Trilaterating Simple Polygons.

[BibT_eX]

[DOI]

Matthew Dippel

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Multiplex networks: a Generative Model and Algorithmic Complexity.

[BibT_eX]

[DOI]

Prithwish Basu

Balakrishnan Narayanaswamy

Matthew Dippel

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Designing Overlapping Networks for Publish-Subscribe Systems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

SmartShift: Expanded Load Shifting Incentive Mechanism for Risk-Averse Consumers.

[BibT_eX]

[DOI]

Bochao Shen

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree Constraints.

[BibT_eX]

[DOI]

Daniel J. Rosenkrantz

Anil Vullikanti

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Deterministic Blind Rendezvous in Cognitive Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

2013

Delay-Tolerant Bulk Data Transfers on the Internet.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2013

Reducibility among Fractional Stability Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Scheduler vulnerabilities and coordinated attacks in cloud computing.

[BibT_eX]

[DOI]

J. Comput. Secur., 2013

SamaritanCloud: Secure and scalable infrastructure for enabling location-based services.

[BibT_eX]

[DOI]

Abhishek Samanta

Fangfei Zhou

Ragavendran Gopalakrishnan

Proceedings of the IFIP Networking Conference, 2013, Brooklyn, 2013

Maygh: building a CDN from client web browsers.

[BibT_eX]

[DOI]

Proceedings of the Eighth Eurosys Conference 2013, 2013

2012

WebCloud: Recruiting Social Network Users to Assist in Content Distribution.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

Cache Me If You Can: Capacitated Selfish Replication Games.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Prediction of Arrival of Nodes in a Scale Free Network.

[BibT_eX]

[DOI]

S. M. Vijay Mahantesh

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011

Scheduler Vulnerabilities and Attacks in Cloud Computing

[BibT_eX]

[DOI]

CoRR, 2011

Content delivery through the ages: Akamai to WebCloud.

[BibT_eX]

[DOI]

Ragavendran Gopalakrishnan

Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, 2011

PhoneGuard: a smartphone in the coalmine.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, 2011

2010

Capacitated Caching Games

[BibT_eX]

[DOI]

CoRR, 2010

Home is where the (fast) internet is: flat-rate compatible incentives for reducing peak load.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM SIGCOMM workshop on Home networks, 2010

Existence Theorems and Approximation Algorithms for Generalized Network Security Games.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

Algorithms for Constrained Bulk-Transfer of Delay-Tolerant Data.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2010

2009

Delay tolerant bulk data transfers on the internet.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Preprocessing DNS Log Data for Effective Data Mining.

[BibT_eX]

[DOI]

Mark E. Snyder

Mayur Thakur

Proceedings of IEEE International Conference on Communications, 2009

2008

Preference Games and Personalized Equilibria, with Applications to Fractional BGP

[BibT_eX]

[DOI]

CoRR, 2008

2007

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.

[BibT_eX]

[DOI]

J. ACM, 2007

A bounded-degree network formation game

[BibT_eX]

[DOI]

CoRR, 2007

On Completing Latin Squares.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses.

[BibT_eX]

[DOI]

Mark E. Snyder

Mayur Thakur

Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007

SPREAD: Foiling Smart Jammers Using Multi-Layer Agility.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Meet and merge: Approximation algorithms for confluent flows.

[BibT_eX]

[DOI]

Jiangzhuo Chen

Rajmohan Rajaraman

Abishek Kumarasubramanian

J. Comput. Syst. Sci., 2006

Steganographic Communication in Ordered Channels.

[BibT_eX]

[DOI]

R. C. Chakinala

Proceedings of the Information Hiding, 8th International Workshop, 2006

The Confluent Capacity of the Internet: Congestion vs. Dilation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2006

2005

Universal approximations for TSP, Steiner tree, and set cover.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Unweaving a web of documents.

[BibT_eX]

[DOI]

Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Minimum energy accumulative routing in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004

(Almost) tight bounds and existence theorems for confluent flows.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Managing a portfolio of overlay paths.

[BibT_eX]

[DOI]

Proceedings of the Network and Operating System Support for Digital Audio and Video, 2004

A methodology for estimating interdomain web traffic demand.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

2000

Alternation in interaction.

[BibT_eX]

[DOI]

Comput. Complex., 2000

1999

Improving Spanning Trees by Upgrading Nodes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Approximating Latin Square Extensions.

[BibT_eX]

[DOI]

Ravi Kumar

Algorithmica, 1999

1998

Bicriteria Network Design Problems.

[BibT_eX]

[DOI]

Daniel J. Rosenkrantz

Harry B. Hunt III

J. Algorithms, 1998

On embedding complete graphs into hypercubes.

[BibT_eX]

[DOI]

Michael Klugerman

Discret. Math., 1998

A Note on the Asymptotics and Computational Complexity of Graph Distinguishability.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

Symmetric Alternation Captures BPP.

[BibT_eX]

[DOI]

Comput. Complex., 1998

1997

A Note on Optical Routing on Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Faster Algorithms for Optical Switch Configuration.

[BibT_eX]

[DOI]

Ravi Kumar

Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

Improved results on service-constrained network design problems.

[BibT_eX]

[DOI]

R. Ravi

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

Interactive proof system variants and approximation algorithms for optical networks.

[BibT_eX]

[DOI]

PhD thesis, 1996

Spanning Trees - Short or Small.

[BibT_eX]

[DOI]

R. Ravi

Daniel J. Rosenkrantz

S. S. Ravi

SIAM J. Discret. Math., 1996

Service-Constrained Network Design Problems.

[BibT_eX]

R. Ravi

Nord. J. Comput., 1996

1995

The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

1994

Treewidth of Circular-Arc Graphs.

[BibT_eX]

[DOI]

Karan Sher Singh

C. Pandu Rangan

SIAM J. Discret. Math., 1994

Efficient Parallel Shuffle Recognition.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1994

1993

Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.

[BibT_eX]

[DOI]

Proceedings of the 6th International Parallel Processing Symposium, 1992

1991

Treewidth of Circular-Arc Graphs (Abstract).

[BibT_eX]

[DOI]