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
[2]
Hilfe
Suche: Author="Swaminathan, Ram"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flexible coloring
Xiaozhou Li
,
Atri Rudra
,
Ram Swaminathan
Information Processing Letters
111
(11), 2011, pp. 538-540
Remote storage with byzantine servers
Marcos K. Aguilera
,
Ram Swaminathan
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 280-289
Server allocation algorithms for tiered systems
Kamalika Chaudhuri
,
Anshul Kothari
,
Rudi Pendavingh
,
Ram Swaminathan
,
Robert Tarjan
,
Yunhong Zhou
Algorithmica
48
(2), 2007, pp. 129-146
Value-maximizing deadline scheduling and its application to animation rendering
Eric Anderson
,
Dirk Beyer
,
Kamalika Chaudhuri
,
Terence Kelly
,
Norman Salazar
,
Cipriano Santos
,
Ram Swaminathan
,
Robert Tarjan
,
Janet Wiener
,
Yunhong Zhou
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. 299-308
Server allocation algorithms for tiered systems
Kamalika Chaudhuri
,
Anshul Kothari
,
Rudi Pendavingh
,
Ram Swaminathan
,
Robert Tarjan
,
Yunhong Zhou
Lecture Notes in Computer Science
3595
, 2005, pp. 632-643
An experimental study of data migration algorithms
Eric Anderson
,
Joe Hall
,
Jason Hartline
,
Michael Hobbs
,
Anna R. Karlin
,
Jared Saia
,
Ram Swaminathan
,
John Wilkes
Lecture Notes in Computer Science
2141
, 2001, pp. 145-158
A multi-tree routing scheme using acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Tsan-Sheng Hsu
,
Ram Swaminathan
Theoretical Computer Science
240
(2), 2000, pp. 487-494
On testing consecutive-ones property in parallel
Fred Annexstein
,
Ram Swaminathan
Discrete Applied Mathematics
88
(1-3), 1998, pp. 7-28
A multi-tree generating routing scheme acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Ram Swaminathan
Lecture Notes in Computer Science
1276
, 1997, pp. 18-22
Approximation algorithms for optimal-depth independent spanning trees and
st
-numberings
Fred S. Annexstein
,
Kenneth A. Berman
,
Ram Swaminathan
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità , Switzerland, July 24-26, 1997)
, 1997, pp. 12-23
Divide-and-conquer algorithms for graph-layout problems
Ram Swaminathan
Networks
28
(2), 1996, pp. 69-85