Rajmohan Rajaraman
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
66
Venues
25
Active years
1993–2025
Best venue rank
A*
Where they publish
- BSPAA15 papers
- A*SODA9 papers
- A*FOCS6 papers
- A*STOC6 papers
- A*ICALP3 papers
- AICDCS3 papers
- AESA2 papers
- BLATIN2 papers
- NationalCOCOON2 papers
- A*INFOCOM2 papers
- BDCOSS2 papers
- A*AAAI1 paper
- A*ICML1 paper
- BSIROCCO1 paper
- ASTACS1 paper
- AFC1 paper
- A*CCS1 paper
- BISAAC1 paper
- A*EuroCrypt1 paper
- BEuroPar1 paper
- BIPCO1 paper
- A*PODC1 paper
- BWCNC1 paper
- BGI1 paper
- A*DAC1 paper
Papers
66 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | AAAI | 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 |
| 2025 | ICALP | One-Way Communication Complexity of Minimum Vertex Cover in General Graphs. | Mahsa Derakhshan, Andisheh Ghasemi, Rajmohan Rajaraman |
| 2025 | ICML | Optimal Fair Learning Robust to Adversarial Distribution Shift. | Sushant Agarwal, Amit Deshpande, Rajmohan Rajaraman, Ravi Sundaram |
| 2025 | SODA | Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries. | Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim |
| 2024 | ESA | Competitive Capacitated Online Recoloring. | Rajmohan Rajaraman, Omer Wasim |
| 2024 | SIROCCO | Stability of P2P Networks Under Greedy Peering. | Lucianna Kiffer, Rajmohan Rajaraman |
| 2023 | FOCS | 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 |
| 2023 | ICALP | Scheduling Under Non-Uniform Job and Machine Delays. | Rajmohan Rajaraman, David Stalfa, Sheng Yang |
| 2023 | STACS | Online Paging with Heterogeneous Cache Slots. | Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young |
| 2022 | ESA | Improved Bounds for Online Balanced Graph Re-Partitioning. | Rajmohan Rajaraman, Omer Wasim |
| 2021 | FC | HaPPY-Mine: Designing a Mining Reward Function. | Lucianna Kiffer, Rajmohan Rajaraman |
| 2021 | SODA | Competitive Data-Structure Dynamization. | Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi |
| 2020 | FOCS | Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. | Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan |
| 2020 | SPAA | Scheduling Flows on a Switch to Optimize Response Times. | Hamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa |
| 2019 | ICALP | Retracting Graphs to Cycles. | Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram |
| 2018 | CCS | A Better Method to Analyze Blockchain Consistency. | Lucianna Kiffer, Rajmohan Rajaraman, Abhi Shelat |
| 2018 | LATIN | Plane Gossip: Approximating Rumor Spread in Planar Graphs. | Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram |
| 2017 | ISAAC | Improved Algorithms for Scheduling Unsplittable Flows on Paths. | Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman |
| 2017 | SPAA | Asymptotically Optimal Approximation Algorithms for Coflow Scheduling. | Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman |
| 2016 | COCOON | Balls and Funnels: Energy Efficient Group-to-Group Anycasts. | Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram |
| 2016 | EuroCrypt | Essentially Optimal Robust Secret Sharing with Maximal Corruptions. | Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs |
| 2016 | SPAA | Robust and Probabilistic Failure-Aware Placement. | Madhukar R. Korupolu, Rajmohan Rajaraman |
| 2016 | SPAA | Better Bounds for Coalescing-Branching Random Walks. | Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche |
| 2014 | EuroPar | On Constructing DAG-Schedules with Large AREAs. | Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman |
| 2014 | IPCO | Coupled and k-Sided Placements: Generalizing Generalized Assignment. | Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku |
| 2013 | SODA | On the Complexity of Information Spreading in Dynamic Networks. | Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola |
| 2013 | SPAA | Coalescing-branching random walks on graphs. | Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche |
| 2012 | FOCS | Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. | Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan |
| 2012 | LATIN | Cache Me If You Can: Capacitated Selfish Replication Games. | Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram |
| 2012 | SPAA | Discovery through gossip. | Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun |
| 2011 | SODA | Multicommodity Facility Location under Group Steiner Access Cost. | Laura J. Poplawski, Rajmohan Rajaraman |
| 2010 | ICDCS | Existence Theorems and Approximation Algorithms for Generalized Network Security Games. | V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun, Ravi Sundaram |
| 2009 | COCOON | Approximation Algorithms for Key Management in Secure Multicast. | Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu |
| 2009 | FOCS | Reducibility among Fractional Stability Problems. | Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng |
| 2008 | INFOCOM | On the Performance of IEEE 802.11 under Jamming. | Emrah Bayraktaroglu, Christopher King, Xin Liu, Guevara Noubir, Rajmohan Rajaraman, Bishal Thapa |
| 2008 | PODC | 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 |
| 2007 | SPAA | Approximation algorithms for multiprocessor scheduling under uncertainty. | Guolong Lin, Rajmohan Rajaraman |
| 2006 | DCOSS | GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. | Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram |
| 2006 | ICDCS | The Confluent Capacity of the Internet: Congestion vs. Dilation. | Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman |
| 2006 | SODA | A general approach for incremental approximation and hierarchical clustering. | Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson |
| 2006 | SPAA | 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 |
| 2005 | DCOSS | Multi-query Optimization for Sensor Networks. | Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman |
| 2005 | WCNC | Transmission power control for ad hoc wireless networks: throughput, energy and fairness. | Lujun Jia, Xin Liu, Guevara Noubir, Rajmohan Rajaraman |
| 2005 | STOC | Universal approximations for TSP, Steiner tree, and set cover. | Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram |
| 2005 | SPAA | A space lower bound for name-independent compact routing in trees. | Kofi A. Laing, Rajmohan Rajaraman |
| 2004 | GI | Hybrid Push-Pull Query Processing for Sensor Networks. | Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman |
| 2004 | INFOCOM | Mobility Models for Ad hoc Network Simulation. | Guolong Lin, Guevara Noubir, Rajmohan Rajaraman |
| 2004 | STOC | (Almost) tight bounds and existence theorems for confluent flows. | Jiangzhuo Chen, Robert D. Kleinberg, Lszl Lovsz, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta |
| 2003 | STOC | Meet and merge: approximation algorithms for confluent flows. | Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram |
| 2003 | SPAA | Compact routing with name independence. | Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka |
| 2003 | SPAA | On local algorithms for topology control and routing in ad hoc networks. | Lujun Jia, Rajmohan Rajaraman, Christian Scheideler |
| 2002 | SODA | Improved algorithms for stretch scheduling. | Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman |
| 2001 | SODA | Approximation algorithms for data placement in arbitrary networks. | Ivan D. Baev, Rajmohan Rajaraman |
| 2001 | SPAA | A data tracking scheme for general networks. | Rajmohan Rajaraman, Andra W. Richa, Berthold Vcking, Gayathri Vuppuluri |
| 1999 | FOCS | Online Scheduling to Minimize Average Stretch. | S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke |
| 1999 | ICDCS | A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service. | Michael Rabinovich, Irina Rabinovich, Rajmohan Rajaraman, Amit Aggarwal |
| 1999 | SODA | Placement Algorithms for Hierarchical Cooperative Caching. | Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman |
| 1999 | STOC | 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 |
| 1999 | SPAA | Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. | Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosn |
| 1998 | SODA | Analysis of a Local Search Heuristic for Facility Location Problems. | Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman |
| 1998 | SPAA | An Adversarial Model for Distributed Dynamic Load Balancing. | S. Muthukrishnan, Rajmohan Rajaraman |
| 1997 | SPAA | Accessing Nearby Copies of Replicated Objects in a Distributed Environment. | C. Greg Plaxton, Rajmohan Rajaraman, Andra W. Richa |
| 1996 | FOCS | Fast Fault-Tolerant Concurrent Access to Shared Objects. | C. Greg Plaxton, Rajmohan Rajaraman |
| 1995 | STOC | Tight analyses of two local load balancing algorithms. | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andra W. Richa, Robert Endre Tarjan, David Zuckerman |
| 1994 | STOC | On contention resolution protocols and associated probabilistic phenomena. | Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman |
| 1993 | DAC | Optimal Clustering for Delay Minimization. | Rajmohan Rajaraman, D. F. Wong |