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
[1]
Hilfe
Suche: Author="Rao, Satish B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
BOS is Boss: A case for bulk-synchronous object systems
Mark W. Goudreau
,
Kevin Lang
,
Girija Narlikar
,
Satish B. Rao
Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 (Saint-Malo, France, June 27-30,1999)
, 1999, pp. 115-125
BSPlib: The BSP programming library
Jonathan M.D. Hill
,
Bill McColl
,
Dan C. Stefanescu
,
Mark W. Goudreau
,
Kevin Lang
,
Satish B. Rao
,
Torsten Suel
,
Thanasis Tsantilas
,
Rob H. Bisseling
Parallel Computing
24
(14), 1998, pp. 1947-1980
Approximating geometrical graphs via ``spanners'' and ``banyans''
Satish B. Rao
,
Warren D. Smith
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 540-550
Work-preserving emulations of fixed-connection networks
Richard R. Koch
,
F.T. Leighton
,
Bruce M. Maggs
,
Satish B. Rao
,
Arnold L. Rosenberg
,
Eric J. Schwabe
Journal of the ACM
44
(1), 1997, pp. 104-147
Randomized routing and sorting on fixed-connection networks
F.T. Leighton
,
Bruce M. Maggs
,
Abhiram G. Ranade
,
Satish B. Rao
Journal of Algorithms
17
(1), 1994, pp. 157-205
Packet routing and job-shop scheduling in
O(\mbox{congestion} + \mbox{dilation})
steps
F.T. Leighton
,
Bruce M. Maggs
,
Satish B. Rao
Combinatorica
14
(2), 1994, pp. 167-186
Faster algorithms for finding small edge cuts in planar graphs
Satish B. Rao
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 229-240
Finding small edge cuts in planar graphs
Satish B. Rao
misc, 1991, September