BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
6 × USA
Collaborated with:
R.Sundaram J.Chen D.F.Wong C.G.Plaxton P.D.MacKenzie L.Jia G.Lin G.Noubir V.Guruswami S.Khanna F.B.Shepherd M.Yannakakis R.D.Kleinberg L.Lovász A.Vetta B.Ghosh F.T.Leighton B.M.Maggs S.Muthukrishnan A.W.Richa R.E.Tarjan D.Zuckerman
Talks about:
algorithm (3) approxim (3) confluent (2) tight (2) optim (2) flow (2) probabilist (1) phenomena (1) protocol (1) disjoint (1)

Person: Rajmohan Rajaraman

DBLP DBLP: Rajaraman:Rajmohan

Contributed to:

STOC 20052005
STOC 20042004
STOC 20032003
STOC 19991999
STOC 19951995
STOC 19941994
DAC 19931993

Wrote 7 papers:

STOC-2005-JiaLNRS #approximate #set
Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
STOC-2004-ChenKLRSV #bound #confluence #theorem
(Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
STOC-2003-ChenRS #algorithm #approximate #confluence
Meet and merge: approximation algorithms for confluent flows (JC, RR, RS), pp. 373–382.
STOC-1999-GuruswamiKRSY #algorithm #approximate #problem
Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.
STOC-1995-GhoshLMMPRRTZ #algorithm #analysis
Tight analyses of two local load balancing algorithms (BG, FTL, BMM, SM, CGP, RR, AWR, RET, DZ), pp. 548–558.
STOC-1994-MacKenziePR #on the #probability #protocol
On contention resolution protocols and associated probabilistic phenomena (PDM, CGP, RR), pp. 153–162.
DAC-1993-RajaramanW #clustering
Optimal Clustering for Delay Minimization (RR, DFW), pp. 309–314.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.