| 1995 |
|---|
| 28 | EE | S. Venkatesan,
K. V. S. Ramarao:
Making Fault-Sensitive Algorithms Tolerate Link Failures.
J. Parallel Distrib. Comput. 30(1): 64-75 (1995) |
| 1994 |
|---|
| 27 | | S. Venkatesan,
K. V. S. Ramarao:
Computing Associative Function Distributively in Spite of Link Failures.
J. Parallel Distrib. Comput. 23(3): 399-410 (1994) |
| 26 | | Sushil Jajodia,
Ravi Mukkamala,
K. V. S. Ramarao:
A View-Based Dynamic Replication Control Algorithm.
Nord. J. Comput. 1(2): 214-230 (1994) |
| 1993 |
|---|
| 25 | | K. V. S. Ramarao,
S. Venkatesan:
The Lower Bounds on Distributed Shortest Paths.
Inf. Process. Lett. 48(3): 145-149 (1993) |
| 1992 |
|---|
| 24 | | K. V. S. Ramarao,
S. Venkatesan:
Distributed Problem Solving In SPite Of Processor Failures.
SRDS 1992: 164-171 |
| 23 | EE | K. Brahmadathan,
K. V. S. Ramarao:
On the design of replicated databases.
Inf. Sci. 65(1-2): 173-187 (1992) |
| 22 | | K. V. S. Ramarao,
S. Venkatesan:
On Finding and Updating Shortest Paths Distributively.
J. Algorithms 13(2): 235-257 (1992) |
| 1991 |
|---|
| 21 | | K. Brahmadathan,
K. V. S. Ramarao:
Achieving Graceful Performance in Distributed Error-Prone Databases.
Distributed Computing 4: 163-174 (1991) |
| 20 | EE | K. V. S. Ramarao:
Design of transaction commitment protocols.
Inf. Sci. 55(1-3): 129-149 (1991) |
| 1990 |
|---|
| 19 | EE | K. V. S. Ramarao,
K. Brahmadathan:
Divide and Conquer for Distributed Mutual Exclusion.
SPDP 1990: 113-120 |
| 18 | EE | K. Brahmadathan,
K. V. S. Ramarao:
On the management of long-living transactions.
Journal of Systems and Software 11(1): 45-52 (1990) |
| 17 | EE | K. V. S. Ramarao:
Efficient fault-tolerant broadcasts.
Journal of Systems and Software 11(2): 131-141 (1990) |
| 1989 |
|---|
| 16 | EE | Tsae-Chiu Chen,
K. V. S. Ramarao:
Performance Analysis of Distributed Commit Protocols.
ICDE 1989: 505-512 |
| 15 | EE | K. Brahmadathan,
K. V. S. Ramarao:
Read-Only Transactions in Partitioned Replicated Databases.
ICDE 1989: 522-529 |
| 14 | | K. V. S. Ramarao:
Complexity of Distributed Commit Protocols.
Acta Inf. 26(6): 577-595 (1989) |
| 13 | | K. V. S. Ramarao:
Distributed Algorithms for Network Recognition Problems.
IEEE Trans. Computers 38(9): 1240-1248 (1989) |
| 12 | | K. V. S. Ramarao:
Detection of Mutual Inconsistency in Distributed Databases.
J. Parallel Distrib. Comput. 6(3): 498-514 (1989) |
| 1988 |
|---|
| 11 | EE | K. V. S. Ramarao:
Transaction Atomicity in the Presence of Network Partitions.
ICDE 1988: 512-519 |
| 10 | EE | K. V. S. Ramarao:
Commitment in a Partitioned Distributed Database.
SIGMOD Conference 1988: 371-378 |
| 9 | | K. V. S. Ramarao,
Joel C. Adams:
On the Diagnosis of Byzantine Faults.
SRDS 1988: 144-153 |
| 8 | | K. V. S. Ramarao:
Distributed Sorting on Local Area Networks.
IEEE Trans. Computers 37(2): 239-243 (1988) |
| 7 | | K. V. S. Ramarao,
Robert Daley,
Rami G. Melhem:
Message Complexity of the Set Intersection Problem.
Inf. Process. Lett. 27(4): 169-174 (1988) |
| 1987 |
|---|
| 6 | EE | K. V. S. Ramarao:
Detection of Mutual Inconsistency in Distributed Databases.
ICDE 1987: 405-411 |
| 5 | | Francis Y. L. Chin,
K. V. S. Ramarao:
An Information-Based Model for Failure-Handling in Distributed Database Systems.
IEEE Trans. Software Eng. 13(4): 420-431 (1987) |
| 1986 |
|---|
| 4 | | Francis Y. L. Chin,
K. V. S. Ramarao:
Optimal Termination Protocols for Network Partitioning.
SIAM J. Comput. 15(1): 131-144 (1986) |
| 1985 |
|---|
| 3 | EE | K. V. S. Ramarao:
On the Complexity of Commit Protocols.
PODS 1985: 235-244 |
| 2 | | Suresh C. Kothari,
K. V. S. Ramarao:
General Algorithms for the Address Calculation of Lexicographically Ordered Tuples.
Inf. Process. Lett. 21(3): 113-116 (1985) |
| 1983 |
|---|
| 1 | EE | Francis Y. L. Chin,
K. V. S. Ramarao:
Optimal Termination Prococols for Network Partitioning.
PODS 1983: 25-35 |
