The following pages link to Rajmohan Rajaraman (Q239064):
Displayed 44 items.
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- Accessing nearby copies of replicated objects in a distributed environment (Q1293914) (← links)
- Time-constrained scheduling of weighted packets on trees and meshes (Q1400890) (← links)
- Information spreading in dynamic networks under oblivious adversaries (Q1660948) (← links)
- \textsf{HaPPY-Mine}: designing a mining reward function (Q2147246) (← links)
- Plane gossip: approximating rumor spread in planar graphs (Q2294719) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Placement Algorithms for Hierarchical Cooperative Caching (Q2709801) (← links)
- (Q2768361) (← links)
- Discovery Through Gossip (Q2811164) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions (Q2820478) (← links)
- Cache Me If You Can: Capacitated Selfish Replication Games (Q2894485) (← links)
- Approximation Algorithms for Data Placement Problems (Q3395037) (← links)
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347) (← links)
- (Almost) tight bounds and existence theorems for confluent flows (Q3581008) (← links)
- Meet and merge (Q3581299) (← links)
- (Q4250157) (← links)
- (Q4252337) (← links)
- Analysis of a Local Search Heuristic for Facility Location Problems (Q4512576) (← links)
- (Q5002612) (← links)
- (Q5091228) (← links)
- (Q5136269) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- Reducibility among Fractional Stability Problems (Q5171181) (← links)
- (Q5275393) (← links)
- Approximation Algorithms for Key Management in Secure Multicast (Q5323059) (← links)
- (Q5351912) (← links)
- (Q5365096) (← links)
- A General Approach for Incremental Approximation and Hierarchical Clustering (Q5390609) (← links)
- Reducibility among Fractional Stability Problems (Q5408759) (← links)
- Coupled and k-Sided Placements: Generalizing Generalized Assignment (Q5419009) (← links)
- On the Complexity of Information Spreading in Dynamic Networks (Q5741760) (← links)
- Compact Routing with Name Independence (Q5757388) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5890864) (← links)
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget (Q5891999) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget (Q5920341) (← links)
- Towards more complete models of TCP latency and throughput (Q5959816) (← links)
- (Q6147391) (← links)