Ravi Sundaram - Citegraph

Author Info

Name	Affiliation	Papers
RAVI SUNDARAM	Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, U.S.A., e-mail: koods@hotmail.com, US	76
Collaborators	Citations	PageRank
133	762	72.13
Referers	Referees	References
1384	1433	824

Search Limit

1001000

Publications (76 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
PAC-Learning for Strategic Classification	0	0.34	2021
Cache Me if You Can: Capacitated Selfish Replication Games in Networks	0	0.34	2020
Resilience and coevolution of preferential interdependent networks.	0	0.34	2020
Realization Problems on Reachability Sequences.	0	0.34	2020
On the Migration of Researchers across Scientific Domains.	0	0.34	2019
Retracting Graphs to Cycles.	0	0.34	2019
Plane Gossip: Approximating rumor spread in planar graphs.	0	0.34	2018
Skyline Identification In Multi-Arm Bandits	0	0.34	2018
Resilience and the Coevolution of Interdependent Multiplex Networks.	0	0.34	2018
Colocation, Colocation, Colocation - Optimizing Placement in the Hybrid Cloud.	0	0.34	2018
Chiron: A Robust Recommendation System with Graph Regularizer.	0	0.34	2017
A General Framework for Asynchronous Communication.	0	0.34	2017
Symmetric Interdiction for Matching Problems.	0	0.34	2017
A General Characterization of Sync Word for Asynchronous Communication.	0	0.34	2016
Chiron: A Robust Recommendation System.	0	0.34	2016
Markovian Hitters and the Complexity of Blind Rendezvous.	0	0.34	2016
An Upper Bound on Trilaterating Simple Polygons.	0	0.34	2015
Designing Overlapping Networks for Publish-Subscribe Systems.	0	0.34	2015
Rumors Across Radio, Wireless, Telephone.	0	0.34	2015
On the network you keep: analyzing persons of interest using Cliqster	2	0.36	2015
Asynchronous Communication over a Fading Channel and Additive Noise	0	0.34	2015
SamaritanCloud: Secure infrastructure for scalable location-based services.	1	0.35	2015
Multiplex networks: a Generative Model and Algorithmic Complexity.	4	0.49	2015
Secure and scalable match: overcoming the universal circuit bottleneck using group programs.	0	0.34	2014
Bayesian Inference In Treewidth-Bounded Graphical Models Without Indegree Constraints	1	0.35	2014
Deterministic Blind Rendezvous in Cognitive Radio Networks	13	0.63	2014
SamaritanCloud: Secure and scalable infrastructure for enabling location-based services	0	0.34	2013
Maygh: building a CDN from client web browsers	5	0.49	2013
Scheduler Vulnerabilities and Coordinated Attacks in Cloud Computing	22	0.99	2013
WebCloud: Recruiting Social Network Users to Assist in Content Distribution	15	0.69	2012
Cache me if you can: capacitated selfish replication games	2	0.41	2012
WebCloud: Recruiting web browsers for content distribution	0	0.34	2011
PhoneGuard: a smartphone in the coalmine	0	0.34	2011
Scheduler Vulnerabilities and Attacks in Cloud Computing	8	0.61	2011
Content delivery through the ages: Akamai to WebCloud	0	0.34	2011
Prediction of Arrival of Nodes in a Scale Free Network	0	0.34	2011
Home is where the (fast) internet is: flat-rate compatible incentives for reducing peak load	6	0.62	2010
Existence Theorems and Approximation Algorithms for Generalized Network Security Games	19	0.83	2010
Capacitated Caching Games	0	0.34	2010
Algorithms For Constrained Bulk-Transfer Of Delay-Tolerant Data	7	0.57	2010
Preprocessing DNS log data for effective data mining	6	0.64	2009
Reducibility among Fractional Stability Problems	13	0.72	2009
Preference Games and Personalized Equilibria, with Applications to Fractional BGP	1	0.49	2008
Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget.	31	1.54	2008
SPREAD: Foiling Smart Jammers Using Multi-Layer Agility.	46	2.25	2007
(Almost) Tight bounds and existence theorems for single-commodity confluent flows	12	0.77	2007
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses	3	0.43	2007
A bounded-degree network formation game	4	0.43	2007
The Confluent Capacity of the Internet: Congestion vs. Dilation	6	0.49	2006
Steganographic communication in ordered channels	13	0.79	2006

1
2
50 / page