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
Hilfe
Suche: Author="Ramarao, K.V.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Making fault-sensitive algorithms tolerate link failures
S. Venkatesan
,
K.V.S. Ramarao
Journal Parallel Distributed Computing
30
(1), 1995, pp. 64-75
Computing associative functions distributively in spite of link failures
S. Venkatesan
,
K.V.S. Ramarao
Journal Parallel Distributed Computing
23
(3), 1994, pp. 399-410
The lower bounds on distributed shortest paths
K.V.S. Ramarao
,
S. Venkatesan
Information Processing Letters
48
(3), 1993, pp. 145-149
On finding and updating shortest paths distributively
K.V.S. Ramarao
,
S. Venkatesan
Journal of Algorithms
13
, 1992, pp. 235-257
Divide and conquer for distributed mutual exclusion
K.V.S. Ramarao
,
K. Brahmadathan
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 113-120
Detection of mutual inconsistency in distributed databases
K.V.S. Ramarao
Journal Parallel Distributed Computing
6
, 1989, pp. 498-514
Message complexity of the set intersection problem
K.V.S. Ramarao
,
R. Daley
,
R. Melhem
Information Processing Letters
27
(4), 1988, April, pp. 169-174
Complexity of distributed commit protocols
K.V.S. Ramarao
Acta Informatica
26
, 1988, pp. 577-595
Optimal termination protocols for network partitioning
F. Chin
,
K.V.S. Ramarao
SIAM Journal on Computing
15
(1), 1986, February, pp. 131-144
General algorithms for the address calculation of lexicographically ordered tuples
S.C. Kothari
,
K.V.S. Ramarao
Information Processing Letters
21
(3), 1985, September, pp. 113-116