Rajmohan Rajaraman

According to our database1, Rajmohan Rajaraman authored at least 83 papers between 1993 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

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

2018
Better Bounds for Coalescing-Branching Random Walks.
TOPC, 2018

Robust and Probabilistic Failure-Aware Placement.
TOPC, 2018

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

A Better Method to Analyze Blockchain Consistency.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

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

2017
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Improved Algorithms for Scheduling Unsplittable Flows on Paths.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

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

2016
Randomized Rounding.
Encyclopedia of Algorithms, 2016

Performance-Driven Clustering.
Encyclopedia of Algorithms, 2016

Discovery Through Gossip.
Random Struct. Algorithms, 2016

Information Spreading in Dynamic Networks Under Oblivious Adversaries.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

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

2015
Coalescing-Branching Random Walks on Graphs.
TOPC, 2015

Coupled and k-sided placements: generalizing generalized assignment.
Math. Program., 2015

Essentially Optimal Robust Secret Sharing with Maximal Corruptions.
IACR Cryptology ePrint Archive, 2015

On constructing DAG-schedules with large areas.
Concurrency and Computation: Practice and Experience, 2015

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

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

2014
Foreword: Parallelism in Algorithms and Architectures.
Theory Comput. Syst., 2014

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

Global Information Sharing under Network Dynamics.
CoRR, 2014

2013
Performance of IEEE 802.11 under Jamming.
MONET, 2013

On the Complexity of Information Spreading in Dynamic Networks.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

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

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Information Spreading in Dynamic Networks
CoRR, 2011

On the robustness of IEEE 802.11 rate adaptation algorithms against smart jamming.
Proceedings of the Fourth ACM Conference on Wireless Network Security, 2011

Multicommodity Facility Location under Group Steiner Access Cost.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
A General Approach for Incremental Approximation and Hierarchical Clustering.
SIAM J. Comput., 2010

Approximation Algorithms for Multiprocessor Scheduling under Uncertainty.
Theory Comput. Syst., 2010

Capacitated Caching Games
CoRR, 2010

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

Games ad hoc networks play.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

2009
Special Section on Foundations of Computer Science.
SIAM J. Comput., 2009

Reducibility Among Fractional Stability Problems.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Approximation Algorithms for Key Management in Secure Multicast.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Randomized Rounding.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Performance-Driven Clustering.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximation Algorithms for Data Placement Problems.
SIAM J. Comput., 2008

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

2007
Wave scheduling and routing in sensor networks.
TOSN, 2007

A Space Lower Bound for Name-Independent Compact Routing in Trees.
Journal of Interconnection Networks, 2007

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

A bounded-degree network formation game
CoRR, 2007

2006
Compact Routing with Name Independence.
SIAM J. Discrete Math., 2006

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

Playing push vs pull: models and algorithms for disseminating dynamic data in networks.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 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

2005
Transmission power control for ad hoc wireless networks: throughput, energy and fairness.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2005

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

Multi-query Optimization for Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2005

2004
Online Scheduling to Minimize Average Stretch.
SIAM J. Comput., 2004

Approximation Algorithms for Average Stretch Scheduling.
J. Scheduling, 2004

Foreword.
Theory Comput. Syst., 2004

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

Mobility Models for Ad hoc Network Simulation.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Hybrid Push-Pull Query Processing for Sensor Networks.
Proceedings of the INFORMATIK 2004, 2004

WaveScheduling: energy-efficient data dissemination for sensor networks.
Proceedings of the 1st Workshop on Data Management for Sensor Networks, 2004

2003
The Cougar Project: a work-in-progress report.
SIGMOD Record, 2003

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.
J. Comput. Syst. Sci., 2003

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
Algorithmica, 2003

On local algorithms for topology control and routing in ad hoc networks.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Topology control and routing in ad hoc networks: a survey.
SIGACT News, 2002

An Adversarial Model for Distributed Dynamic Load Balancing.
Journal of Interconnection Networks, 2002

An efficient distributed algorithm for constructing small dominating sets.
Distributed Computing, 2002

Improved algorithms for stretch scheduling.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Towards More Complete Models of TCP Latency and Throughput.
The Journal of Supercomputing, 2001

Placement Algorithms for Hierarchical Cooperative Caching.
J. Algorithms, 2001

A data tracking scheme for general networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Approximation algorithms for data placement in arbitrary networks.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Analysis of a Local Search Heuristic for Facility Location Problems.
J. Algorithms, 2000

1999
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings.
Theor. Comput. Sci., 1999

Tight Analyses of Two Local Load Balancing Algorithms.
SIAM J. Comput., 1999

Accessing Nearby Copies of Replicated Objects in a Distributed Environment.
Theory Comput. Syst., 1999

A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service.
Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

1998
On Contention Resolution Protocols and Associated Probabilistic Phenomena.
J. ACM, 1998

1996
Fast Fault-Tolerant Concurrent Access to Shared Objects.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995
Optimum clustering for delay minimization.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1995

1993
Optimal Clustering for Delay Minimization.
Proceedings of the 30th Design Automation Conference. Dallas, 1993


  Loading...