The SCEAS System
| |||||||

## Search the dblp DataBase
Rajmohan Rajaraman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
**Analysis of a Local Search Heuristic for Facility Location Problems.**[Citation Graph (1, 0)][DBLP] SODA, 1998, pp:1-10 [Conf] - Rajmohan Rajaraman, D. F. Wong
**Optimal Clustering for Delay Minimization.**[Citation Graph (0, 0)][DBLP] DAC, 1993, pp:309-314 [Conf] - Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram
**GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks.**[Citation Graph (0, 0)][DBLP] DCOSS, 2006, pp:282-304 [Conf] - Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman
**Multi-query Optimization for Sensor Networks.**[Citation Graph (0, 0)][DBLP] DCOSS, 2005, pp:307-321 [Conf] - S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke
**Online Scheduling to Minimize Average Stretch.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:433-442 [Conf] - C. Greg Plaxton, Rajmohan Rajaraman
**Fast Fault-Tolerant Concurrent Access to Shared Objects.**[Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:570-579 [Conf] - Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman
**Hybrid Push-Pull Query Processing for Sensor Networks.**[Citation Graph (0, 0)][DBLP] GI Jahrestagung (2), 2004, pp:370-374 [Conf] - Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman
**The Confluent Capacity of the Internet: Congestion vs. Dilation.**[Citation Graph (0, 0)][DBLP] ICDCS, 2006, pp:5- [Conf] - Michael Rabinovich, Irina Rabinovich, Rajmohan Rajaraman, Amit Aggarwal
**A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service.**[Citation Graph (0, 0)][DBLP] ICDCS, 1999, pp:101-113 [Conf] - Guolong Lin, Guevara Noubir, Rajmohan Rajaraman
**Mobility Models for Ad hoc Network Simulation.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2004, pp:- [Conf] - Ivan D. Baev, Rajmohan Rajaraman
**Approximation algorithms for data placement in arbitrary networks.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:661-670 [Conf] - Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
**Improved algorithms for stretch scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:762-771 [Conf] - Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
**Placement Algorithms for Hierarchical Cooperative Caching.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:586-595 [Conf] - Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson
**A general approach for incremental approximation and hierarchical clustering.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1147-1156 [Conf] - Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
**Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.**[Citation Graph (0, 0)][DBLP] SPAA, 1999, pp:1-12 [Conf] - Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka
**Compact routing with name independence.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:184-192 [Conf] - R. C. Chakinala, A. Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman
**Playing push vs pull: models and algorithms for disseminating dynamic data in networks.**[Citation Graph (0, 0)][DBLP] SPAA, 2006, pp:244-253 [Conf] - Lujun Jia, Rajmohan Rajaraman, Christian Scheideler
**On local algorithms for topology control and routing in ad hoc networks.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:220-229 [Conf] - Kofi A. Laing, Rajmohan Rajaraman
**A space lower bound for name-independent compact routing in trees.**[Citation Graph (0, 0)][DBLP] SPAA, 2005, pp:216- [Conf] - Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri
**A data tracking scheme for general networks.**[Citation Graph (0, 0)][DBLP] SPAA, 2001, pp:247-254 [Conf] - S. Muthukrishnan, Rajmohan Rajaraman
**An Adversarial Model for Distributed Dynamic Load Balancing.**[Citation Graph (0, 0)][DBLP] SPAA, 1998, pp:47-54 [Conf] - C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
**Accessing Nearby Copies of Replicated Objects in a Distributed Environment.**[Citation Graph (0, 0)][DBLP] SPAA, 1997, pp:311-320 [Conf] - Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
**(Almost) tight bounds and existence theorems for confluent flows.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:529-538 [Conf] - Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
**Meet and merge: approximation algorithms for confluent flows.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:373-382 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:548-558 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:19-28 [Conf] - Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram
**Universal approximations for TSP, Steiner tree, and set cover.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:386-395 [Conf] - Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
**On contention resolution protocols and associated probabilistic phenomena.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:153-162 [Conf] - Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
**Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings.**[Citation Graph (0, 0)][DBLP] WDAG, 1997, pp:81-95 [Conf] - Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
**Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:2, pp:123-152 [Journal] - Lujun Jia, Rajmohan Rajaraman, Torsten Suel
**An efficient distributed algorithm for constructing small dominating sets.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2002, v:15, n:4, pp:193-205 [Journal] - Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
**On Contention Resolution Protocols and Associated Probabilistic Phenomena.**[Citation Graph (0, 0)][DBLP] J. ACM, 1998, v:45, n:2, pp:324-378 [Journal] - Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
**Analysis of a Local Search Heuristic for Facility Location Problems.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:37, n:1, pp:146-188 [Journal] - Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
**Placement Algorithms for Hierarchical Cooperative Caching.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:38, n:1, pp:260-302 [Journal] - Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
**Meet and merge: Approximation algorithms for confluent flows.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:3, pp:468-489 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal] - S. Muthukrishnan, Rajmohan Rajaraman
**An Adversarial Model for Distributed Dynamic Load Balancing.**[Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:35-47 [Journal] - C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
**Accessing Nearby Copies of Replicated Objects in a Distributed Environment.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1999, v:32, n:3, pp:241-280 [Journal] - Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
**Approximation Algorithms for Average Stretch Scheduling.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:3, pp:195-222 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal] - S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke
**Online Scheduling to Minimize Average Stretch.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:34, n:2, pp:433-452 [Journal] - Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman, Agathoniki Trigoni, Yong Yao
**The Cougar Project: a work-in-progress report.**[Citation Graph (0, 0)][DBLP] SIGMOD Record, 2003, v:32, n:4, pp:53-59 [Journal] - Rajmohan Rajaraman, Martin D. F. Wong
**Optimum clustering for delay minimization.**[Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1995, v:14, n:12, pp:1490-1495 [Journal] - Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman
**Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:220, n:1, pp:247-265 [Journal] - Michael Mitzenmacher, Rajmohan Rajaraman
**Towards More Complete Models of TCP Latency and Throughput.**[Citation Graph (0, 0)][DBLP] The Journal of Supercomputing, 2001, v:20, n:2, pp:137-160 [Journal] - Guolong Lin, Rajmohan Rajaraman
**Approximation algorithms for multiprocessor scheduling under uncertainty.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:25-34 [Conf] - Nikolaos Laoutaris, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng
**A bounded-degree network formation game**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Guolong Lin, Rajmohan Rajaraman
**Approximation Algorithms for Multiprocessor Scheduling under Uncertainty**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:4, pp:- [Journal] - Niki Trigoni, Yong Yao, Alan J. Demers, Johannes Gehrke, Rajmohan Rajaraman
**Wave scheduling and routing in sensor networks.**[Citation Graph (0, 0)][DBLP] TOSN, 2007, v:3, n:1, pp:2- [Journal] **Approximation Algorithms for Key Management in Secure Multicast.**[Citation Graph (, )][DBLP]**Games ad hoc networks play.**[Citation Graph (, )][DBLP]**Reducibility among Fractional Stability Problems.**[Citation Graph (, )][DBLP]**Existence Theorems and Approximation Algorithms for Generalized Network Security Games.**[Citation Graph (, )][DBLP]**On the Performance of IEEE 802.11 under Jamming.**[Citation Graph (, )][DBLP]**Bounded budget connection (BBC) games or how to make friends and influence people, on a budget.**[Citation Graph (, )][DBLP]**WaveScheduling: energy-efficient data dissemination for sensor networks.**[Citation Graph (, )][DBLP]**Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget**[Citation Graph (, )][DBLP]**Preference Games and Personalized Equilibria, with Applications to Fractional BGP**[Citation Graph (, )][DBLP]**Reducibility Among Fractional Stability Problems**[Citation Graph (, )][DBLP]**Approximation Algorithms for Key Management in Secure Multicast**[Citation Graph (, )][DBLP]**Capacitated Caching Games**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |