K. V. S. Ramarao

According to our database1, K. V. S. Ramarao
  • authored at least 30 papers between 1983 and 1995.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1995
Making Fault-Sensitive Algorithms Tolerate Link Failures.
J. Parallel Distrib. Comput., 1995

1994
A View-Based Dynamic Replication Control Algorithm.
Nord. J. Comput., 1994

Computing Associative Function Distributively in Spite of Link Failures.
J. Parallel Distrib. Comput., 1994

1993
The Lower Bounds on Distributed Shortest Paths.
Inf. Process. Lett., 1993

1992
On Finding and Updating Shortest Paths Distributively.
J. Algorithms, 1992

On the design of replicated databases.
Inf. Sci., 1992

Distributed Problem Solving In SPite Of Processor Failures.
Proceedings of the 11th Symposium on Reliable Distributed Systems, 1992

1991
Design of transaction commitment protocols.
Inf. Sci., 1991

Achieving Graceful Performance in Distributed Error-Prone Databases.
Distributed Computing, 1991

1990
Efficient fault-tolerant broadcasts.
Journal of Systems and Software, 1990

On the management of long-living transactions.
Journal of Systems and Software, 1990

Divide and Conquer for Distributed Mutual Exclusion.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

1989
Distributed Algorithms for Network Recognition Problems.
IEEE Trans. Computers, 1989

Detection of Mutual Inconsistency in Distributed Databases.
J. Parallel Distrib. Comput., 1989

Complexity of Distributed Commit Protocols.
Acta Inf., 1989

Performance Analysis of Distributed Commit Protocols.
Proceedings of the Fifth International Conference on Data Engineering, 1989

Read-Only Transactions in Partitioned Replicated Databases.
Proceedings of the Fifth International Conference on Data Engineering, 1989

Distributed diagnosis of Byzantine processors and links.
Proceedings of the 9th International Conference on Distributed Computing Systems, 1989

1988
Multicolor reordering of sparse matrices resulting from irregular grids.
ACM Trans. Math. Softw., 1988

Distributed Sorting on Local Area Networks.
IEEE Trans. Computers, 1988

Message Complexity of the Set Intersection Problem.
Inf. Process. Lett., 1988

On the Diagnosis of Byzantine Faults.
Proceedings of the Seventh Symposium on Reliable Distributed Systems, 1988

Commitment in a Partitioned Distributed Database.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

Transaction Atomicity in the Presence of Network Partitions.
Proceedings of the Fourth International Conference on Data Engineering, 1988

1987
An Information-Based Model for Failure-Handling in Distributed Database Systems.
IEEE Trans. Software Eng., 1987

Detection of Mutual Inconsistency in Distributed Databases.
Proceedings of the Third International Conference on Data Engineering, 1987

1986
Optimal Termination Protocols for Network Partitioning.
SIAM J. Comput., 1986

1985
General Algorithms for the Address Calculation of Lexicographically Ordered Tuples.
Inf. Process. Lett., 1985

On the Complexity of Commit Protocols.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985

1983
Optimal Termination Prococols for Network Partitioning.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983


  Loading...