| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Rajmohan Rajaraman 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 Guolong Lin , Guevara Noubir , Rajmohan Rajaraman: Mobility Models for Ad hoc Network Simulation. INFOCOM 2004 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 Michael A. Bender , S. Muthukrishnan , Rajmohan Rajaraman: Approximation Algorithms for Average Stretch Scheduling. J. Scheduling 7 (3): 195-222 (2004) S. Muthukrishnan , Rajmohan Rajaraman, Anthony Shaheen , Johannes Gehrke : Online Scheduling to Minimize Average Stretch. SIAM J. Comput. 34 (2): 433-452 (2004) Marta Arias , Lenore Cowen , Kofi A. Laing , Rajmohan Rajaraman, Orjeta Taka : Compact routing with name independence. SPAA 2003 : 184-192 Lujun Jia , Rajmohan Rajaraman, Christian Scheideler : On local algorithms for topology control and routing in ad hoc networks. SPAA 2003 : 220-229 Jiangzhuo Chen , Rajmohan Rajaraman, Ravi Sundaram : Meet and merge: approximation algorithms for confluent flows. STOC 2003 : 373-382 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) 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) Alan J. Demers , Johannes Gehrke , Rajmohan Rajaraman, Agathoniki Trigoni , Yong Yao : The Cougar Project: a work-in-progress report. SIGMOD Record 32 (4): 53-59 (2003) Michael A. Bender , S. Muthukrishnan , Rajmohan Rajaraman: Improved algorithms for stretch scheduling. SODA 2002 : 762-771 Lujun Jia , Rajmohan Rajaraman, Torsten Suel : An efficient distributed algorithm for constructing small dominating sets. Distributed Computing 15 (4): 193-205 (2002) S. Muthukrishnan , Rajmohan Rajaraman: An Adversarial Model for Distributed Dynamic Load Balancing. Journal of Interconnection Networks 3 (1-2): 35-47 (2002) Ivan D. Baev , Rajmohan Rajaraman: Approximation algorithms for data placement in arbitrary networks. SODA 2001 : 661-670 Rajmohan Rajaraman, Andréa W. Richa , Berthold Vöcking , Gayathri Vuppuluri : A data tracking scheme for general networks. SPAA 2001 : 247-254 Madhukar R. Korupolu , C. Greg Plaxton , Rajmohan Rajaraman: Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38 (1): 260-302 (2001) Michael Mitzenmacher , Rajmohan Rajaraman: Towards More Complete Models of TCP Latency and Throughput. The Journal of Supercomputing 20 (2): 137-160 (2001) 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) S. Muthukrishnan , Rajmohan Rajaraman, Anthony Shaheen , Johannes Gehrke : Online Scheduling to Minimize Average Stretch. FOCS 1999 : 433-442 Michael Rabinovich , Irina Rabinovich , Rajmohan Rajaraman, Amit Aggarwal : A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service. ICDCS 1999 : 101-113 Madhukar R. Korupolu , C. Greg Plaxton , Rajmohan Rajaraman: Placement Algorithms for Hierarchical Cooperative Caching. SODA 1999 : 586-595 Micah Adler , Sanjeev Khanna , Rajmohan Rajaraman, Adi Rosén : Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999 : 1-12 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 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) 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) 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) Madhukar R. Korupolu , C. Greg Plaxton , Rajmohan Rajaraman: Analysis of a Local Search Heuristic for Facility Location Problems. SODA 1998 : 1-10 S. Muthukrishnan , Rajmohan Rajaraman: An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998 : 47-54 Philip D. MacKenzie , C. Greg Plaxton , Rajmohan Rajaraman: On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45 (2): 324-378 (1998) C. Greg Plaxton , Rajmohan Rajaraman, Andréa W. Richa : Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997 : 311-320 Johannes Gehrke , C. Greg Plaxton , Rajmohan Rajaraman: Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. WDAG 1997 : 81-95 C. Greg Plaxton , Rajmohan Rajaraman: Fast Fault-Tolerant Concurrent Access to Shared Objects. FOCS 1996 : 570-579 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 Philip D. MacKenzie , C. Greg Plaxton , Rajmohan Rajaraman: On contention resolution protocols and associated probabilistic phenomena. STOC 1994 : 153-162 Rajmohan Rajaraman, D. F. Wong : Optimal Clustering for Delay Minimization. DAC 1993 : 309-314 1 [ 14 ] [ 28 ] 2 [ 16 ] 3 [ 31 ] 4 [ 22 ] 5 [ 25 ] [ 33 ] 6 [ 29 ] [ 34 ] 7 [ 31 ] 8 [ 26 ] [ 36 ] 9 [ 5 ] [ 11 ] [ 17 ] [ 26 ] [ 32 ] [ 36 ] 10 [ 3 ] [ 12 ] 11 [ 13 ] [ 27 ] 12 [ 24 ] [ 30 ] 13 [ 13 ] [ 14 ] [ 27 ] [ 28 ] 14 [ 34 ] 15 [ 9 ] [ 15 ] [ 18 ] [ 20 ] 16 [ 31 ] 17 [ 3 ] [ 12 ] 18 [ 35 ] 19 [ 34 ] 20 [ 2 ] [ 7 ] 21 [ 3 ] [ 12 ] 22 [ 19 ] 23 [ 3 ] [ 8 ] [ 12 ] [ 17 ] [ 23 ] [ 25 ] [ 32 ] [ 33 ] 24 [ 35 ] 25 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 15 ] [ 18 ] [ 20 ] 26 [ 16 ] 27 [ 16 ] 28 [ 3 ] [ 6 ] [ 10 ] [ 12 ] [ 21 ] 29 [ 14 ] [ 28 ] 30 [ 30 ] 31 [ 17 ] [ 32 ] 32 [ 13 ] [ 27 ] 33 [ 24 ] 34 [ 29 ] [ 34 ] 35 [ 31 ] 36 [ 3 ] [ 12 ] 37 [ 26 ] 38 [ 36 ] 39 [ 34 ] 40 [ 21 ] 41 [ 21 ] 42 [ 1 ] 43 [ 13 ] [ 27 ] 44 [ 26 ] [ 36 ] 45 [ 3 ] [ 12 ]  ©2005 Association for Computing Machinery |
