default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajmohan Rajaraman
Person information
- affiliation: Northeastern University, Boston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j40]Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young
:
Online Paging with Heterogeneous Cache Slots. Algorithmica 87(1): 89-131 (2025)- [c75]Rajmohan Rajaraman, Omer Wasim:
Online Balanced Allocation of Dynamic Components. ITCS 2025: 81:1-81:23 - [c74]Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim:
Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries. SODA 2025: 4983-5026 - 2024
- [j39]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. ACM Trans. Algorithms 20(4): 37:1-37:28 (2024) - [c73]Matthew Casey, Rajmohan Rajaraman, David Stalfa, Cheng Tan:
Scheduling Splittable Jobs on Configurable Machines. APPROX/RANDOM 2024: 22:1-22:20 - [c72]Rajmohan Rajaraman, Omer Wasim:
Competitive Capacitated Online Recoloring. ESA 2024: 95:1-95:17 - [c71]Lucianna Kiffer, Rajmohan Rajaraman:
Stability of P2P Networks Under Greedy Peering. SIROCCO 2024: 359-383 - [i34]Lucianna Kiffer, Rajmohan Rajaraman:
Stability of P2P Networks Under Greedy Peering (Full Version). CoRR abs/2402.14666 (2024) - [i33]Rajmohan Rajaraman, Omer Wasim:
Competitive Capacitated Online Recoloring. CoRR abs/2408.05370 (2024) - [i32]Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim:
Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries. CoRR abs/2411.04418 (2024) - 2023
- [j38]Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Improved Algorithms for Scheduling Unsplittable Flows on Paths. Algorithmica 85(2): 563-583 (2023) - [c70]Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman:
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. FOCS 2023: 60-76 - [c69]Rajmohan Rajaraman, David Stalfa, Sheng Yang:
Scheduling Under Non-Uniform Job and Machine Delays. ICALP 2023: 98:1-98:20 - [c68]Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. STACS 2023: 23:1-23:24 - [i31]Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman:
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. CoRR abs/2308.01199 (2023) - [i30]Haolin Liu, Rajmohan Rajaraman, Ravi Sundaram, Anil Vullikanti, Omer Wasim, Haifeng Xu:
Sample Complexity of Opinion Formation on Networks. CoRR abs/2311.02349 (2023) - [i29]Matthew Casey, Rajmohan Rajaraman, David Stalfa:
Scheduling Splittable Jobs on Configurable Machines. CoRR abs/2312.05416 (2023) - 2022
- [c67]Searidang Pa, Rajmohan Rajaraman, David Stalfa:
Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints. APOCS 2022: 1-14 - [c66]Rajmohan Rajaraman, Omer Wasim:
Improved Bounds for Online Balanced Graph Re-Partitioning. ESA 2022: 83:1-83:15 - [i28]Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young:
Online Paging with Heterogeneous Cache Slots. CoRR abs/2206.05579 (2022) - [i27]Rajmohan Rajaraman, David Stalfa, Sheng Yang:
Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays. CoRR abs/2207.13121 (2022) - [i26]Lucianna Kiffer, Rajmohan Rajaraman, Abhi Shelat:
A Better Method to Analyze Blockchain Consistency. IACR Cryptol. ePrint Arch. 2022: 601 (2022) - 2021
- [c65]Lucianna Kiffer, Rajmohan Rajaraman:
HaPPY-Mine: Designing a Mining Reward Function. Financial Cryptography (2) 2021: 250-268 - [c64]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. SODA 2021: 2269-2287 - [i25]Lucianna Kiffer, Rajmohan Rajaraman:
HaPPY-Mine: Designing a Mining Reward Function. CoRR abs/2103.12229 (2021) - [i24]Searidang Pa, Rajmohan Rajaraman, David Stalfa:
Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints. CoRR abs/2111.08148 (2021) - 2020
- [j37]Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram:
Cache Me if You Can: Capacitated Selfish Replication Games in Networks. Theory Comput. Syst. 64(2): 272-310 (2020) - [c63]Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan:
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. FOCS 2020: 834-845 - [c62]Hamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa:
Scheduling Flows on a Switch to Optimize Response Times. SPAA 2020: 305-315 - [i23]Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan:
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. CoRR abs/2004.10776 (2020) - [i22]Hamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa:
Scheduling Flows on a Switch to Optimize Response Times. CoRR abs/2005.09724 (2020) - [i21]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. CoRR abs/2011.02615 (2020)
2010 – 2019
- 2019
- [c61]Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram:
Retracting Graphs to Cycles. ICALP 2019: 70:1-70:15 - [i20]Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram:
Retracting Graphs to Cycles. CoRR abs/1904.11946 (2019) - 2018
- [j36]Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better Bounds for Coalescing-Branching Random Walks. ACM Trans. Parallel Comput. 5(1): 2:1-2:23 (2018) - [j35]Madhukar R. Korupolu, Rajmohan Rajaraman:
Robust and Probabilistic Failure-Aware Placement. ACM Trans. Parallel Comput. 5(1): 5:1-5:30 (2018) - [c60]Srinivas Aiyar, Karan Gupta, Rajmohan Rajaraman, Bochao Shen, Zhifeng Sun, Ravi Sundaram:
Colocation, Colocation, Colocation: Optimizing Placement in the Hybrid Cloud. ALGOCLOUD 2018: 25-45 - [c59]Lucianna Kiffer, Rajmohan Rajaraman, Abhi Shelat:
A Better Method to Analyze Blockchain Consistency. CCS 2018: 729-744 - [c58]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Plane Gossip: Approximating Rumor Spread in Planar Graphs. LATIN 2018: 611-624 - 2017
- [c57]Samuel Haney, Bruce M. Maggs, Biswaroop Maiti, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram:
Symmetric Interdiction for Matching Problems. APPROX-RANDOM 2017: 9:1-9:19 - [c56]Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Improved Algorithms for Scheduling Unsplittable Flows on Paths. ISAAC 2017: 49:1-49:12 - [c55]Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling. SPAA 2017: 45-54 - [i19]Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Improved Algorithms for Scheduling Unsplittable Flows on Paths. CoRR abs/1708.00143 (2017) - 2016
- [j34]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery Through Gossip. Random Struct. Algorithms 48(3): 565-587 (2016) - [c54]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Balls and Funnels: Energy Efficient Group-to-Group Anycasts. COCOON 2016: 235-246 - [c53]Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs:
Essentially Optimal Robust Secret Sharing with Maximal Corruptions. EUROCRYPT (1) 2016: 58-86 - [c52]Madhukar R. Korupolu, Rajmohan Rajaraman:
Robust and Probabilistic Failure-Aware Placement. SPAA 2016: 213-224 - [c51]Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better Bounds for Coalescing-Branching Random Walks. SPAA 2016: 313-323 - [c50]John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman:
Information Spreading in Dynamic Networks Under Oblivious Adversaries. DISC 2016: 399-413 - [r4]Rajmohan Rajaraman:
Performance-Driven Clustering. Encyclopedia of Algorithms 2016: 1557-1559 - [r3]Rajmohan Rajaraman:
Randomized Rounding. Encyclopedia of Algorithms 2016: 1753-1757 - [i18]Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better bounds for coalescing-branching random walks. CoRR abs/1603.06109 (2016) - [i17]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Balls and Funnels: Energy Efficient Group-to-Group Anycasts. CoRR abs/1605.07196 (2016) - [i16]Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling. CoRR abs/1606.06183 (2016) - [i15]John Augustine, Chen Avin, Mehraneh Liaee, Gopal Pandurangan, Rajmohan Rajaraman:
Information Spreading in Dynamic Networks under Oblivious Adversaries. CoRR abs/1607.05645 (2016) - [i14]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Plane Gossip: Approximating rumor spread in planar graphs. CoRR abs/1612.01492 (2016) - 2015
- [j33]Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman:
On constructing DAG-schedules with large areas. Concurr. Comput. Pract. Exp. 27(16): 4107-4121 (2015) - [j32]Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-sided placements: generalizing generalized assignment. Math. Program. 154(1-2): 493-514 (2015) - [j31]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-Branching Random Walks on Graphs. ACM Trans. Parallel Comput. 2(3): 20:1-20:29 (2015) - [c49]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Designing Overlapping Networks for Publish-Subscribe Systems. APPROX-RANDOM 2015: 381-395 - [c48]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Rumors Across Radio, Wireless, Telephone. FSTTCS 2015: 517-528 - [i13]Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs:
Essentially Optimal Robust Secret Sharing with Maximal Corruptions. IACR Cryptol. ePrint Arch. 2015: 1032 (2015) - 2014
- [j30]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. J. Comput. Syst. Sci. 80(7): 1266-1284 (2014) - [j29]Geppino Pucci, Victor Luchangco, Rajmohan Rajaraman:
Foreword: Parallelism in Algorithms and Architectures. Theory Comput. Syst. 55(3): 449-450 (2014) - [c47]Scott T. Roche, Arnold L. Rosenberg, Rajmohan Rajaraman:
On Constructing DAG-Schedules with Large AREAs. Euro-Par 2014: 620-631 - [c46]Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-Sided Placements: Generalizing Generalized Assignment. IPCO 2014: 357-368 - [i12]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola:
Global Information Sharing under Network Dynamics. CoRR abs/1409.7771 (2014) - 2013
- [j28]Emrah Bayraktaroglu, Christopher King, Xin Liu, Guevara Noubir, Rajmohan Rajaraman, Bishal Thapa:
Performance of IEEE 802.11 under Jamming. Mob. Networks Appl. 18(5): 678-696 (2013) - [j27]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility among Fractional Stability Problems. SIAM J. Comput. 42(6): 2063-2113 (2013) - [c45]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola:
On the Complexity of Information Spreading in Dynamic Networks. SODA 2013: 717-736 - [c44]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Scott T. Roche:
Coalescing-branching random walks on graphs. SPAA 2013: 176-185 - 2012
- [c43]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 - [c42]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 - [c41]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through gossip. SPAA 2012: 140-149 - [i11]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through Gossip. CoRR abs/1202.2092 (2012) - 2011
- [c40]Laura J. Poplawski, Rajmohan Rajaraman:
Multicommodity Facility Location under Group Steiner Access Cost. SODA 2011: 996-1013 - [c39]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 - [e2]Rajmohan Rajaraman, Friedhelm Meyer auf der Heide:
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 [contents] - [i10]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) - [i9]Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun:
Information Spreading in Dynamic Networks. CoRR abs/1112.0384 (2011) - 2010
- [j26]Guolong Lin, Rajmohan Rajaraman:
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty. Theory Comput. Syst. 47(4): 856-877 (2010) - [j25]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) - [c38]Rajmohan Rajaraman:
Games ad hoc networks play. DIALM-PODC 2010: 1 - [c37]V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun, Ravi Sundaram:
Existence Theorems and Approximation Algorithms for Generalized Network Security Games. ICDCS 2010: 348-357 - [e1]Rajmohan Rajaraman, Thomas Moscibroda, Adam Dunkels, Anna Scaglione:
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 [contents] - [i8]Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram:
Capacitated Caching Games. CoRR abs/1007.2694 (2010)
2000 – 2009
- 2009
- [j24]Matthew Andrew, Ashwin Nayak, Rajmohan Rajaraman:
Special Section on Foundations of Computer Science. SIAM J. Comput. 39(2): 545 (2009) - [c36]Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu:
Approximation Algorithms for Key Management in Secure Multicast. COCOON 2009: 148-157 - [c35]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility among Fractional Stability Problems. FOCS 2009: 283-292 - [i7]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility Among Fractional Stability Problems. CoRR abs/0904.1435 (2009) - [i6]Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu:
Approximation Algorithms for Key Management in Secure Multicast. CoRR abs/0904.4061 (2009) - [i5]Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
Reducibility Among Fractional Stability Problems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j23]Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy:
Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4): 1411-1429 (2008) - [c34]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 - [c33]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 - [r2]Rajmohan Rajaraman:
Performance-Driven Clustering. Encyclopedia of Algorithms 2008 - [r1]Rajmohan Rajaraman:
Randomized Rounding. Encyclopedia of Algorithms 2008 - [i4]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) - [i3]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) - 2007
- [j22]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): 16 (2007) - [j21]Kofi A. Laing, Rajmohan Rajaraman:
A Space Lower Bound for Name-Independent Compact Routing in Trees. J. Interconnect. Networks 8(3): 229-251 (2007) - [j20]Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman:
Wave scheduling and routing in sensor networks. ACM Trans. Sens. Networks 3(1): 2 (2007) - [c32]Guolong Lin, Rajmohan Rajaraman:
Approximation algorithms for multiprocessor scheduling under uncertainty. SPAA 2007: 25-34 - [i2]Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
A bounded-degree network formation game. CoRR abs/cs/0701071 (2007) - [i1]Guolong Lin, Rajmohan Rajaraman:
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty. CoRR abs/cs/0703100 (2007) - 2006
- [j19]Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram:
Meet and merge: Approximation algorithms for confluent flows. J. Comput. Syst. Sci. 72(3): 468-489 (2006) - [j18]Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka:
Compact Routing with Name Independence. SIAM J. Discret. Math. 20(3): 705-726 (2006) - [c31]Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram:
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. DCOSS 2006: 282-304 - [c30]Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman:
The Confluent Capacity of the Internet: Congestion vs. Dilation. ICDCS 2006: 5 - [c29]Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson:
A general approach for incremental approximation and hierarchical clustering. SODA 2006: 1147-1156 - [c28]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 - 2005
- [c27]Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman:
Multi-query Optimization for Sensor Networks. DCOSS 2005: 307-321 - [c26]Kofi A. Laing, Rajmohan Rajaraman:
A space lower bound for name-independent compact routing in trees. SPAA 2005: 216 - [c25]Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram:
Universal approximations for TSP, Steiner tree, and set cover. STOC 2005: 386-395 - [c24]Lujun Jia, Xin Liu, Guevara Noubir, Rajmohan Rajaraman:
Transmission power control for ad hoc wireless networks: throughput, energy and fairness. WCNC 2005: 619-625 - 2004
- [j17]Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking:
Foreword. Theory Comput. Syst. 37(3): 321 (2004) - [j16]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Approximation Algorithms for Average Stretch Scheduling. J. Sched. 7(3): 195-222 (2004) - [j15]S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke:
Online Scheduling to Minimize Average Stretch. SIAM J. Comput. 34(2): 433-452 (2004) - [c23]Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman:
WaveScheduling: energy-efficient data dissemination for sensor networks. DMSN 2004: 48-57 - [c22]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 - [c21]Guolong Lin, Guevara Noubir, Rajmohan Rajaraman:
Mobility Models for Ad hoc Network Simulation. INFOCOM 2004 - [c20]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 - 2003
- [j14]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) - [j13]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) - [j12]Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman, Agathoniki Trigoni, Yong Yao:
The Cougar Project: a work-in-progress report. SIGMOD Rec. 32(4): 53-59 (2003) - [c19]Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka:
Compact routing with name independence. SPAA 2003: 184-192 - [c18]Lujun Jia, Rajmohan Rajaraman, Christian Scheideler:
On local algorithms for topology control and routing in ad hoc networks. SPAA 2003: 220-229 - [c17]Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram:
Meet and merge: approximation algorithms for confluent flows. STOC 2003: 373-382 - 2002
- [j11]Lujun Jia, Rajmohan Rajaraman, Torsten Suel:
An efficient distributed algorithm for constructing small dominating sets. Distributed Comput. 15(4): 193-205 (2002) - [j10]S. Muthukrishnan, Rajmohan Rajaraman:
An Adversarial Model for Distributed Dynamic Load Balancing. J. Interconnect. Networks 3(1-2): 35-47 (2002) - [j9]Rajmohan Rajaraman:
Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2): 60-73 (2002) - [c16]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Improved algorithms for stretch scheduling. SODA 2002: 762-771 - 2001
- [j8]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38(1): 260-302 (2001) - [j7]Michael Mitzenmacher, Rajmohan Rajaraman:
Towards More Complete Models of TCP Latency and Throughput. J. Supercomput. 20(2): 137-160 (2001) - [c15]Ivan D. Baev, Rajmohan Rajaraman:
Approximation algorithms for data placement in arbitrary networks. SODA 2001: 661-670 - [c14]Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri:
A data tracking scheme for general networks. SPAA 2001: 247-254 - 2000
- [j6]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)
1990 – 1999
- 1999
- [j5]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) - [j4]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) - [j3]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) - [c13]S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke:
Online Scheduling to Minimize Average Stretch. FOCS 1999: 433-442 - [c12]Michael Rabinovich, Irina Rabinovich, Rajmohan Rajaraman, Amit Aggarwal:
A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service. ICDCS 1999: 101-113 - [c11]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. SODA 1999: 586-595 - [c10]Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999: 1-12 - [c9]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 - 1998
- [j2]Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998) - [c8]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Analysis of a Local Search Heuristic for Facility Location Problems. SODA 1998: 1-10 - [c7]S. Muthukrishnan, Rajmohan Rajaraman:
An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998: 47-54 - 1997
- [c6]C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa:
Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997: 311-320 - [c5]Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman:
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. WDAG 1997: 81-95 - 1996
- [c4]C. Greg Plaxton, Rajmohan Rajaraman:
Fast Fault-Tolerant Concurrent Access to Shared Objects. FOCS 1996: 570-579 - 1995
- [j1]Rajmohan Rajaraman, Martin D. F. Wong:
Optimum clustering for delay minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(12): 1490-1495 (1995) - [c3]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 - 1994
- [c2]Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On contention resolution protocols and associated probabilistic phenomena. STOC 1994: 153-162 - 1993
- [c1]Rajmohan Rajaraman, D. F. Wong:
Optimal Clustering for Delay Minimization. DAC 1993: 309-314
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
