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="Madhavapeddy, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal algorithms for dissemination of information in generalized communication modes
R. Feldmann
,
J. Hromkovic̑
,
S. Madhavapeddy
,
B. Monien
,
P. Mysliwietz
Discrete Applied Mathematics
53
, 1994, pp. 55-78
Optimal algorithms for dissemination of information in generalized communication modes
R.J. Hromkovic̑ Feldmann
,
S. Madhavapeddy
,
B. Monien
,
P. Mysliwietz
Discrete Applied Mathematics
53
, 1994, pp. 55-78
Optimal algorithms for dissemination of information in generalized communication modes
R. Feldmann
,
J. Hromkovic̑
,
S. Madhavapeddy
,
B. Monien
,
P. Mysliwietz
Lecture Notes in Computer Science
605
, 1992, pp. 115-130
Three disjoint path paradigms in star networks
M. Dietzfelbinger
,
S. Madhavapeddy
,
I.H. Sudborough
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 400-406
A topological property of hypercubes: Node disjoint paths
S. Madhavapeddy
,
I.H. Sudborough
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 532-539