Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Rajaraman, Rajmohan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Coupled and
k
-sided placements: Generalizing generalized assignment
Madhukar Korupolu
,
Adam Meyerson
,
Rajmohan Rajaraman
,
Brian Tagiku
Lecture Notes in Computer Science
8494
, 2014, pp. 357-368
Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget
Nikolaos Laoutaris
,
Laura Poplawski
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Shang-Hua Teng
Journal of Computer and System Sciences
80
(7), 2014, pp. 1266-1284
Coalescing-branching random walks on graphs
Chinmoy Dutta
,
Gopal Pandurangan
,
Rajmohan Rajaraman
,
Scott Roche
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2013 (Montréal, Québec, Canada, July 23-25, 2013)
, 2013, pp. 176-185
Reducibility among fractional stability problems
Shiva Kintali
,
Laura J. Poplawski
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Shang-Hua Teng
SIAM Journal on Computing
42
(6), 2013, pp. 2063-2113
Discovery through gossip
Bernhard Haeupler
,
Gopal Pandurangan
,
David Peleg
,
Rajmohan Rajaraman
,
Zhifeng Sun
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 140-149
A general approach for incremental approximation and hierarchical clustering
Guolong Lin
,
Chandrashekhar Nagarajan
,
Rajmohan Rajaraman
,
David P. Williamson
SIAM Journal on Computing
39
(8), 2010, pp. 3633-3669
Approximation algorithms for multiprocessor scheduling under uncertainty
Guolong Lin
,
Rajmohan Rajaraman
Theory of Computing Systems
47
(4), 2010, pp. 856-877
Approximation algorithms for key management in secure multicast
Agnes Chan
,
Rajmohan Rajaraman
,
Zhifeng Sun
,
Feng Zhu
Lecture Notes in Computer Science
5609
, 2009, pp. 148-157
Approximation algorithms for data placement problems
Ivan Baev
,
Rajmohan Rajaraman
,
Chaitanya Swamy
SIAM Journal on Computing
38
(4), 2008, pp. 1411-1429
(Almost) tight bounds and existence theorems for single-commodity confluent flows
Jiangzhuo Chen
,
Robert D. Kleinberg
,
László Lovász
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Adrian Vetta
Journal of the ACM
54
(4), 2007, pp. 16: 1-32
Approximation algorithms for multiprocessor scheduling under uncertainty
Guolong Lin
,
Rajmohan Rajaraman
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 25-34
Compact routing with name independence
Marta Arias
,
Lenore J. Cowen
,
Kofi A. Laing
,
Rajmohan Rajaraman
,
Orjeta Taka
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 705-726
Meet and merge: Approximation algorithms for confluent flows
Jiangzhuo Chen
,
Rajmohan Rajaraman
,
Ravi Sundaram
Journal of Computer and System Sciences
72
(3), 2006, pp. 468-489
Universal approximations for TSP, Steiner tree, and set cover
Lujun Jia
,
Guolong Lin
,
Guevara Noubir
,
Rajmohan Rajaraman
,
Ravi Sundaram
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 386-395
Brief announcement: A space lower bound for name-independent compact routing in trees
Kofi A. Laing
,
Rajmohan Rajaraman
Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2005 (Las Vegas, Nevada, USA, July 18-20, 2005)
, 2005, pp. 216-216
(Almost) tight bounds and existence theorems for confluent flows
Jiangzhuo Chen
,
Robert D. Kleinberg
,
László Lovász
,
Rajmohan Rajaraman
,
Ravi Sundaram
,
Adrian Vetta
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 529-538
Online scheduling to minimize average stretch
S. Muthukrishnan
,
Rajmohan Rajaraman
,
Anthony Shaheen
,
Johannes E. Gehrke
SIAM Journal on Computing
34
(2), 2004-2005, pp. 433-452
Time-constrained scheduling of weighted packets on trees and meshes
Micah Adler
,
Sanjeev Khanna
,
Rajmohan Rajaraman
,
Adi Rosén
Algorithmica
36
(2), 2003, pp. 123-152
Compact routing with name independence
Marta Arias
,
Lenore J. Cowen
,
Kofi A. Laing
,
Rajmohan Rajaraman
,
Orjeta Taka
Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2003 (San Diego, California, June 7-9, 2003)
, 2003, pp. 184-192
Meet and merge: Approximation algorithms for confluent flows
Jiangzhuo Chen
,
Rajmohan Rajaraman
,
Ravi Sundaram
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 373-382
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Venkatesan Guruswami
,
Sanjeev Khanna
,
Rajmohan Rajaraman
,
Bruce Shepherd
,
Mihalis Yannakakis
Journal of Computer and System Sciences
67
(3), 2003, pp. 473-496
On local algorithms for topology control and routing in ad hoc networks
Lujun Jia
,
Rajmohan Rajaraman
,
Christian Scheideler
Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2003 (San Diego, California, June 7-9, 2003)
, 2003, pp. 220-229
Placement algorithms for hierarchical cooperative caching
Madhukar R. Korupolu
,
C. Greg Plaxton
,
Rajmohan Rajaraman
Journal of Algorithms
38
(1), 2001, pp. 260-302
A data tracking scheme for general networks
Rajmohan Rajaraman
,
Andréa W. Richa
,
Berthold Vöcking
,
Gayathri Vuppuluri
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001 (Crete Island, Greece, July 3-6, 2001)
, 2001, pp. 247-254
Analysis of a local search heuristic for facility location problems
Madhukar R. Korupolu
,
C. Greg Plaxton
,
Rajmohan Rajaraman
Journal of Algorithms
37
(1), 2000, pp. 146-188
Seiten 1
2
>