The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rajmohan Rajaraman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Rajmohan Rajaraman, D. F. Wong
    Optimal Clustering for Delay Minimization. [Citation Graph (0, 0)][DBLP]
    DAC, 1993, pp:309-314 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. C. Greg Plaxton, Rajmohan Rajaraman
    Fast Fault-Tolerant Concurrent Access to Shared Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:570-579 [Conf]
  7. 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]
  8. 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]
  9. 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]
  10. Guolong Lin, Guevara Noubir, Rajmohan Rajaraman
    Mobility Models for Ad hoc Network Simulation. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  11. Ivan D. Baev, Rajmohan Rajaraman
    Approximation algorithms for data placement in arbitrary networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:661-670 [Conf]
  12. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
    Improved algorithms for stretch scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:762-771 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. S. Muthukrishnan, Rajmohan Rajaraman
    An Adversarial Model for Distributed Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:47-54 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. Guolong Lin, Rajmohan Rajaraman
    Approximation algorithms for multiprocessor scheduling under uncertainty. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:25-34 [Conf]
  47. 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]
  48. Guolong Lin, Rajmohan Rajaraman
    Approximation Algorithms for Multiprocessor Scheduling under Uncertainty [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  49. 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]
  50. 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]

  51. Approximation Algorithms for Key Management in Secure Multicast. [Citation Graph (, )][DBLP]


  52. Games ad hoc networks play. [Citation Graph (, )][DBLP]


  53. Reducibility among Fractional Stability Problems. [Citation Graph (, )][DBLP]


  54. Existence Theorems and Approximation Algorithms for Generalized Network Security Games. [Citation Graph (, )][DBLP]


  55. On the Performance of IEEE 802.11 under Jamming. [Citation Graph (, )][DBLP]


  56. Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. [Citation Graph (, )][DBLP]


  57. WaveScheduling: energy-efficient data dissemination for sensor networks. [Citation Graph (, )][DBLP]


  58. Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget [Citation Graph (, )][DBLP]


  59. Preference Games and Personalized Equilibria, with Applications to Fractional BGP [Citation Graph (, )][DBLP]


  60. Reducibility Among Fractional Stability Problems [Citation Graph (, )][DBLP]


  61. Approximation Algorithms for Key Management in Secure Multicast [Citation Graph (, )][DBLP]


  62. Capacitated Caching Games [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002