Rajmohan Rajaraman

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola: On the Complexity of Information Spreading in Dynamic Networks. SODA 2013: 717-736

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan: Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. FOCS 2012: 81-90

Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram: Cache Me If You Can: Capacitated Selfish Replication Games. LATIN 2012: 420-432

Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun: Discovery through gossip. SPAA 2012: 140-149

Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun: Discovery through Gossip. CoRR abs/1202.2092 (2012)

Laura J. Poplawski, Rajmohan Rajaraman: Multicommodity Facility Location under Group Steiner Access Cost. SODA 2011: 996-1013

Guevara Noubir, Rajmohan Rajaraman, Bo Sheng, Bishal Thapa: On the robustness of IEEE 802.11 rate adaptation algorithms against smart jamming. WISEC 2011: 97-108

Rajmohan Rajaraman, Friedhelm Meyer auf der Heide (Eds.): SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011). ACM 2011, isbn 978-1-4503-0743-7

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan: Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. CoRR abs/1111.4766 (2011)

Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun: Information Spreading in Dynamic Networks. CoRR abs/1112.0384 (2011)

Guolong Lin, Rajmohan Rajaraman: Approximation Algorithms for Multiprocessor Scheduling under Uncertainty. Theory Comput. Syst. 47(4): 856-877 (2010)

Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson: A General Approach for Incremental Approximation and Hierarchical Clustering. SIAM J. Comput. 39(8): 3633-3669 (2010)

Rajmohan Rajaraman: Games ad hoc networks play. DIALM-PODC 2010: 1

V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun, Ravi Sundaram: Existence Theorems and Approximation Algorithms for Generalized Network Security Games. ICDCS 2010: 348-357

Rajmohan Rajaraman, Thomas Moscibroda, Adam Dunkels, Anna Scaglione (Eds.): Distributed Computing in Sensor Systems, 6th IEEE International Conference, DCOSS 2010, Santa Barbara, CA, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6131, Springer 2010, isbn 978-3-642-13650-4

Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram: Capacitated Caching Games. CoRR abs/1007.2694 (2010)

Matthew Andrew, Ashwin Nayak, Rajmohan Rajaraman: Special Section on Foundations of Computer Science. SIAM J. Comput. 39(2): 545 (2009)

Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu: Approximation Algorithms for Key Management in Secure Multicast. COCOON 2009: 148-157

Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility among Fractional Stability Problems. FOCS 2009: 283-292

Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility Among Fractional Stability Problems. CoRR abs/0904.1435 (2009)

Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu: Approximation Algorithms for Key Management in Secure Multicast. CoRR abs/0904.4061 (2009)

Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Reducibility Among Fractional Stability Problems. Electronic Colloquium on Computational Complexity (ECCC) 16: 41 (2009)

Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy: Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4): 1411-1429 (2008)

Emrah Bayraktaroglu, Christopher King, Xin Liu, Guevara Noubir, Rajmohan Rajaraman, Bishal Thapa: On the Performance of IEEE 802.11 under Jamming. INFOCOM 2008: 1265-1273

Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. PODC 2008: 165-174

Rajmohan Rajaraman: Performance-Driven Clustering. Encyclopedia of Algorithms 2008

Rajmohan Rajaraman: Randomized Rounding. Encyclopedia of Algorithms 2008

Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget. CoRR abs/0806.1727 (2008)

Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: Preference Games and Personalized Equilibria, with Applications to Fractional BGP. CoRR abs/0812.0598 (2008)

Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta: (Almost) Tight bounds and existence theorems for single-commodity confluent flows. J. ACM 54(4) (2007)

Kofi A. Laing, Rajmohan Rajaraman: A Space Lower Bound for Name-Independent Compact Routing in Trees. Journal of Interconnection Networks 8(3): 229-251 (2007)

Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman: Wave scheduling and routing in sensor networks. TOSN 3(1): 2 (2007)

Guolong Lin, Rajmohan Rajaraman: Approximation algorithms for multiprocessor scheduling under uncertainty. SPAA 2007: 25-34

Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng: A bounded-degree network formation game. CoRR abs/cs/0701071 (2007)

Guolong Lin, Rajmohan Rajaraman: Approximation Algorithms for Multiprocessor Scheduling under Uncertainty. CoRR abs/cs/0703100 (2007)

Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram: Meet and merge: Approximation algorithms for confluent flows. J. Comput. Syst. Sci. 72(3): 468-489 (2006)

Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka: Compact Routing with Name Independence. SIAM J. Discrete Math. 20(3): 705-726 (2006)

Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram: GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. DCOSS 2006: 282-304

Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman: The Confluent Capacity of the Internet: Congestion vs. Dilation. ICDCS 2006: 5

Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson: A general approach for incremental approximation and hierarchical clustering. SODA 2006: 1147-1156

R. C. Chakinala, Abishek Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman: Playing push vs pull: models and algorithms for disseminating dynamic data in networks. SPAA 2006: 244-253

Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman: Multi-query Optimization for Sensor Networks. DCOSS 2005: 307-321

Kofi A. Laing, Rajmohan Rajaraman: A space lower bound for name-independent compact routing in trees. SPAA 2005: 216

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram: Universal approximations for TSP, Steiner tree, and set cover. STOC 2005: 386-395

Lujun Jia, Xin Liu, Guevara Noubir, Rajmohan Rajaraman: Transmission power control for ad hoc wireless networks: throughput, energy and fairness. WCNC 2005: 619-625

Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Approximation Algorithms for Average Stretch Scheduling. J. Scheduling 7(3): 195-222 (2004)

S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke: Online Scheduling to Minimize Average Stretch. SIAM J. Comput. 34(2): 433-452 (2004)

Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman: WaveScheduling: energy-efficient data dissemination for sensor networks. DMSN 2004: 48-57

Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman: Hybrid Push-Pull Query Processing for Sensor Networks. GI Jahrestagung (2) 2004: 370-374

Guolong Lin, Guevara Noubir, Rajmohan Rajaraman: Mobility Models for Ad hoc Network Simulation. INFOCOM 2004

Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta: (Almost) tight bounds and existence theorems for confluent flows. STOC 2004: 529-538

Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén: Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. Algorithmica 36(2): 123-152 (2003)

Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3): 473-496 (2003)

Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman, Agathoniki Trigoni, Yong Yao: The Cougar Project: a work-in-progress report. SIGMOD Record 32(4): 53-59 (2003)

Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka: Compact routing with name independence. SPAA 2003: 184-192

Lujun Jia, Rajmohan Rajaraman, Christian Scheideler: On local algorithms for topology control and routing in ad hoc networks. SPAA 2003: 220-229

Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram: Meet and merge: approximation algorithms for confluent flows. STOC 2003: 373-382

Lujun Jia, Rajmohan Rajaraman, Torsten Suel: An efficient distributed algorithm for constructing small dominating sets. Distributed Computing 15(4): 193-205 (2002)

S. Muthukrishnan, Rajmohan Rajaraman: An Adversarial Model for Distributed Dynamic Load Balancing. Journal of Interconnection Networks 3(1-2): 35-47 (2002)

Rajmohan Rajaraman: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2): 60-73 (2002)

Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman: Improved algorithms for stretch scheduling. SODA 2002: 762-771

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38(1): 260-302 (2001)

Michael Mitzenmacher, Rajmohan Rajaraman: Towards More Complete Models of TCP Latency and Throughput. The Journal of Supercomputing 20(2): 137-160 (2001)

Ivan D. Baev, Rajmohan Rajaraman: Approximation algorithms for data placement in arbitrary networks. SODA 2001: 661-670

Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri: A data tracking scheme for general networks. SPAA 2001: 247-254

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Analysis of a Local Search Heuristic for Facility Location Problems. J. Algorithms 37(1): 146-188 (2000)

C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory Comput. Syst. 32(3): 241-280 (1999)

Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman: Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29(1): 29-64 (1999)

Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman: Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. Theor. Comput. Sci. 220(1): 247-265 (1999)

S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke: Online Scheduling to Minimize Average Stretch. FOCS 1999: 433-442

Michael Rabinovich, Irina Rabinovich, Rajmohan Rajaraman, Amit Aggarwal: A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service. ICDCS 1999: 101-113

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Placement Algorithms for Hierarchical Cooperative Caching. SODA 1999: 586-595

Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén: Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999: 1-12

Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. STOC 1999: 19-28

Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman: On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998)

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman: Analysis of a Local Search Heuristic for Facility Location Problems. SODA 1998: 1-10

S. Muthukrishnan, Rajmohan Rajaraman: An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998: 47-54

C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997: 311-320

Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman: Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. WDAG 1997: 81-95

C. Greg Plaxton, Rajmohan Rajaraman: Fast Fault-Tolerant Concurrent Access to Shared Objects. FOCS 1996: 570-579

Rajmohan Rajaraman, Martin D. F. Wong: Optimum clustering for delay minimization. IEEE Trans. on CAD of Integrated Circuits and Systems 14(12): 1490-1495 (1995)

Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman: Tight analyses of two local load balancing algorithms. STOC 1995: 548-558

Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman: On contention resolution protocols and associated probabilistic phenomena. STOC 1994: 153-162

Rajmohan Rajaraman, D. F. Wong: Optimal Clustering for Delay Minimization. DAC 1993: 309-314