Optimal Clustering for Delay Minimization. - Rajmohan Rajaraman; D. F. Wong 001 (DAC, 1993)

Optimum clustering for delay minimization. - Rajmohan Rajaraman; Martin D. F. Wong (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995)

Fast Fault-Tolerant Concurrent Access to Shared Objects. - C. Greg Plaxton; Rajmohan Rajaraman (FOCS, 1996)

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

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

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

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

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

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

Approximation algorithms for data placement in arbitrary networks. - Ivan D. Baev; Rajmohan Rajaraman (SODA, 2001)

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

Placement Algorithms for Hierarchical Cooperative Caching. - Madhukar R. Korupolu; C. Greg Plaxton; Rajmohan Rajaraman (J. Algorithms, 2001)

Towards More Complete Models of TCP Latency and Throughput. - Michael Mitzenmacher; Rajmohan Rajaraman (J. Supercomput., 2001)

Improved algorithms for stretch scheduling. - Michael A. Bender; S. Muthukrishnan 001; Rajmohan Rajaraman (SODA, 2002)

An efficient distributed algorithm for constructing small dominating sets. - Lujun Jia; Rajmohan Rajaraman; Torsten Suel (Distributed Comput., 2002)

An Adversarial Model for Distributed Dynamic Load Balancing. - S. Muthukrishnan 001; Rajmohan Rajaraman (J. Interconnect. Networks, 2002)

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

On local algorithms for topology control and routing in ad hoc networks. - Lujun Jia; Rajmohan Rajaraman; Christian Scheideler (SPAA, 2003)

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

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

The Cougar Project: a work-in-progress report. - Alan J. Demers; Johannes Gehrke; Rajmohan Rajaraman; Agathoniki Trigoni; Yong Yao 002 (SIGMOD Rec., 2003)

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

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

Mobility Models for Ad hoc Network Simulation. - Guolong Lin; Guevara Noubir; Rajmohan Rajaraman (INFOCOM, 2004)

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

Foreword. - Pilar de la Torre; Michael Mitzenmacher; Rajmohan Rajaraman; Berthold Vöcking (Theory Comput. Syst., 2004)

Approximation Algorithms for Average Stretch Scheduling. - Michael A. Bender; S. Muthukrishnan 001; Rajmohan Rajaraman (J. Sched., 2004)

Online Scheduling to Minimize Average Stretch. - S. Muthukrishnan 001; Rajmohan Rajaraman; Anthony Shaheen; Johannes Gehrke (SIAM J. Comput., 2004)

Multi-query Optimization for Sensor Networks. - Niki Trigoni; Yong Yao 002; Alan J. Demers; Johannes Gehrke; Rajmohan Rajaraman (DCOSS, 2005)

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

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

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

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

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

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

Compact Routing with Name Independence. - Marta Arias; Lenore Cowen; Kofi A. Laing; Rajmohan Rajaraman; Orjeta Taka (SIAM J. Discret. Math., 2006)

A bounded-degree network formation game - Nikolaos Laoutaris; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (CoRR, 2007)

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

A Space Lower Bound for Name-Independent Compact Routing in Trees. - Kofi A. Laing; Rajmohan Rajaraman (J. Interconnect. Networks, 2007)

Wave scheduling and routing in sensor networks. - Niki Trigoni; Yong Yao 002; Alan J. Demers; Johannes Gehrke; Rajmohan Rajaraman (ACM Trans. Sens. Networks, 2007)

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

Approximation Algorithms for Data Placement Problems. - Ivan D. Baev; Rajmohan Rajaraman; Chaitanya Swamy (SIAM J. Comput., 2008)

Performance-Driven Clustering. - Rajmohan Rajaraman (Encyclopedia of Algorithms, 2008)

Randomized Rounding. - Rajmohan Rajaraman (Encyclopedia of Algorithms, 2008)

Approximation Algorithms for Key Management in Secure Multicast. - Agnes Hui Chan; Rajmohan Rajaraman; Zhifeng Sun; Feng Zhu (COCOON, 2009)

Special Section on Foundations of Computer Science. - Matthew Andrew; Ashwin Nayak 001; Rajmohan Rajaraman (SIAM J. Comput., 2009)

Games ad hoc networks play. - Rajmohan Rajaraman (DIALM-PODC, 2010)

Existence Theorems and Approximation Algorithms for Generalized Network Security Games. - V. S. Anil Kumar 001; Rajmohan Rajaraman; Zhifeng Sun; Ravi Sundaram (ICDCS, 2010)

Capacitated Caching Games - Ragavendran Gopalakrishnan; Dimitrios Kanoulas; Naga Naresh Karuturi; C. Pandu Rangan; Rajmohan Rajaraman; Ravi Sundaram (CoRR, 2010)

Approximation Algorithms for Multiprocessor Scheduling under Uncertainty. - Guolong Lin; Rajmohan Rajaraman (Theory Comput. Syst., 2010)

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

Multicommodity Facility Location under Group Steiner Access Cost. - Laura J. Poplawski; Rajmohan Rajaraman (SODA, 2011)

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

Information Spreading in Dynamic Networks - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Zhifeng Sun (CoRR, 2011)

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

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

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

Performance of IEEE 802.11 under Jamming. - Emrah Bayraktaroglu; Christopher King; Xin Liu; Guevara Noubir; Rajmohan Rajaraman; Bishal Thapa (Mob. Networks Appl., 2013)

Reducibility among Fractional Stability Problems. - Shiva Kintali; Laura J. Poplawski; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (SIAM J. Comput., 2013)

Global Information Sharing under Network Dynamics. - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Zhifeng Sun; Emanuele Viola (CoRR, 2014)

Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget. - Nikolaos Laoutaris; Laura J. Poplawski; Rajmohan Rajaraman; Ravi Sundaram; Shang-Hua Teng (J. Comput. Syst. Sci., 2014)

Foreword: Parallelism in Algorithms and Architectures. - Geppino Pucci; Victor Luchangco; Rajmohan Rajaraman (Theory Comput. Syst., 2014)

Designing Overlapping Networks for Publish-Subscribe Systems. - Jennifer Iglesias; Rajmohan Rajaraman; R. Ravi 001; Ravi Sundaram (APPROX-RANDOM, 2015)

Rumors Across Radio, Wireless, Telephone. - Jennifer Iglesias; Rajmohan Rajaraman; R. Ravi 001; Ravi Sundaram (FSTTCS, 2015)

On constructing DAG-schedules with large areas. - Scott T. Roche; Arnold L. Rosenberg; Rajmohan Rajaraman (Concurr. Comput. Pract. Exp., 2015)

Essentially Optimal Robust Secret Sharing with Maximal Corruptions. - Allison Bishop; Valerio Pastro; Rajmohan Rajaraman; Daniel Wichs (IACR Cryptol. ePrint Arch., 2015)

Coupled and k-sided placements: generalizing generalized assignment. - Madhukar R. Korupolu; Adam Meyerson; Rajmohan Rajaraman; Brian Tagiku (Math. Program., 2015)

Coalescing-Branching Random Walks on Graphs. - Chinmoy Dutta; Gopal Pandurangan; Rajmohan Rajaraman; Scott T. Roche (ACM Trans. Parallel Comput., 2015)

Balls and Funnels: Energy Efficient Group-to-Group Anycasts. - Jennifer Iglesias; Rajmohan Rajaraman; R. Ravi 001; Ravi Sundaram (COCOON, 2016)

Information Spreading in Dynamic Networks Under Oblivious Adversaries. - John Augustine; Chen Avin; Mehraneh Liaee; Gopal Pandurangan; Rajmohan Rajaraman (DISC, 2016)

Discovery Through Gossip. - Bernhard Haeupler; Gopal Pandurangan; David Peleg; Rajmohan Rajaraman; Zhifeng Sun (Random Struct. Algorithms, 2016)

Performance-Driven Clustering. - Rajmohan Rajaraman (Encyclopedia of Algorithms, 2016)

Randomized Rounding. - Rajmohan Rajaraman (Encyclopedia of Algorithms, 2016)

Symmetric Interdiction for Matching Problems. - Samuel Haney; Bruce M. Maggs; Biswaroop Maiti; Debmalya Panigrahi; Rajmohan Rajaraman; Ravi Sundaram (APPROX-RANDOM, 2017)

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling. - Hamidreza Jahanjou; Erez Kantor; Rajmohan Rajaraman (SPAA, 2017)

Colocation, Colocation, Colocation: Optimizing Placement in the Hybrid Cloud. - Srinivas Aiyar; Karan Gupta; Rajmohan Rajaraman; Bochao Shen; Zhifeng Sun; Ravi Sundaram (ALGOCLOUD, 2018)

Plane Gossip: Approximating Rumor Spread in Planar Graphs. - Jennifer Iglesias; Rajmohan Rajaraman; R. Ravi 001; Ravi Sundaram (LATIN, 2018)

Robust and Probabilistic Failure-Aware Placement. - Madhukar R. Korupolu; Rajmohan Rajaraman (ACM Trans. Parallel Comput., 2018)

Better Bounds for Coalescing-Branching Random Walks. - Michael Mitzenmacher; Rajmohan Rajaraman; Scott T. Roche (ACM Trans. Parallel Comput., 2018)

Retracting Graphs to Cycles. - Samuel Haney; Mehraneh Liaee; Bruce M. Maggs; Debmalya Panigrahi; Rajmohan Rajaraman; Ravi Sundaram (ICALP, 2019)

Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. - Biswaroop Maiti; Rajmohan Rajaraman; David Stalfa; Zoya Svitkina; Aravindan Vijayaraghavan (FOCS, 2020)

Scheduling Flows on a Switch to Optimize Response Times. - Hamidreza Jahanjou; Rajmohan Rajaraman; David Stalfa (SPAA, 2020)

Cache Me if You Can: Capacitated Selfish Replication Games in Networks. - Ragavendran Gopalakrishnan; Dimitrios Kanoulas; Naga Naresh Karuturi; C. Pandu Rangan; Rajmohan Rajaraman; Ravi Sundaram (Theory Comput. Syst., 2020)

HaPPY-Mine: Designing a Mining Reward Function. - Lucianna Kiffer; Rajmohan Rajaraman (Financial Cryptography (2), 2021)

Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints. - Searidang Pa; Rajmohan Rajaraman; David Stalfa (APOCS, 2022)

Improved Bounds for Online Balanced Graph Re-Partitioning. - Rajmohan Rajaraman; Omer Wasim (ESA, 2022)

Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays. - Rajmohan Rajaraman; David Stalfa; Sheng Yang (CoRR, 2022)

A Better Method to Analyze Blockchain Consistency. - Lucianna Kiffer; Rajmohan Rajaraman; Abhi Shelat (IACR Cryptol. ePrint Arch., 2022)

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. - Costas Busch; Da Qi Chen; Arnold Filtser; Daniel Hathcock; D. Ellis Hershkowitz; Rajmohan Rajaraman (FOCS, 2023)

Scheduling Under Non-Uniform Job and Machine Delays. - Rajmohan Rajaraman; David Stalfa; Sheng Yang (ICALP, 2023)

Sample Complexity of Opinion Formation on Networks. - Haolin Liu; Rajmohan Rajaraman; Ravi Sundaram; Anil Vullikanti; Omer Wasim; Haifeng Xu (CoRR, 2023)

Scheduling Splittable Jobs on Configurable Machines. - Matthew Casey 002; Rajmohan Rajaraman; David Stalfa (CoRR, 2023)

Improved Algorithms for Scheduling Unsplittable Flows on Paths. - Hamidreza Jahanjou; Erez Kantor; Rajmohan Rajaraman (Algorithmica, 2023)

Scheduling Splittable Jobs on Configurable Machines. - Matthew Casey 002; Rajmohan Rajaraman; David Stalfa; Cheng Tan 005 (APPROX/RANDOM, 2024)

Competitive Capacitated Online Recoloring. - Rajmohan Rajaraman; Omer Wasim (ESA, 2024)

Stability of P2P Networks Under Greedy Peering. - Lucianna Kiffer; Rajmohan Rajaraman (SIROCCO, 2024)

Stability of P2P Networks Under Greedy Peering (Full Version). - Lucianna Kiffer; Rajmohan Rajaraman (CoRR, 2024)

Competitive Data-Structure Dynamization. - Claire Mathieu; Rajmohan Rajaraman; Neal E. Young; Arman Yousefi (ACM Trans. Algorithms, 2024)

Sample Complexity of Linear Regression Models for Opinion Formation in Networks. - Haolin Liu; Rajmohan Rajaraman; Ravi Sundaram; Anil Kumar S. Vullikanti; Omer Wasim; Haifeng Xu (AAAI, 2025)

One-Way Communication Complexity of Minimum Vertex Cover in General Graphs. - Mahsa Derakhshan; Andisheh Ghasemi; Rajmohan Rajaraman (ICALP, 2025)

Online Balanced Allocation of Dynamic Components. - Rajmohan Rajaraman; Omer Wasim (ITCS, 2025)

Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries. - Soheil Behnezhad; Rajmohan Rajaraman; Omer Wasim (SODA, 2025)

Online Paging with Heterogeneous Cache Slots. - Marek Chrobak; Samuel Haney; Mehraneh Liaee; Debmalya Panigrahi; Rajmohan Rajaraman; Ravi Sundaram; Neal E. Young (Algorithmica, 2025)

Now More Than Ever, Foundational AI Research and Infrastructure Depends on the Federal Government. - Michela Taufer; Rada Mihalcea; Matthew Turk 002; Daniel P. Lopresti; Adam Wierman; Kevin R. B. Butler; Sven Koenig; David Danks; William Gropp; Manish Parashar; Yolanda Gil; William C. Regli; et al. (CoRR, 2025)