![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
K. V. S. Ramarao
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
- [j19]S. Venkatesan, K. V. S. Ramarao:
Making Fault-Sensitive Algorithms Tolerate Link Failures. J. Parallel Distributed Comput. 30(1): 64-75 (1995) - 1994
- [j18]S. Venkatesan, K. V. S. Ramarao:
Computing Associative Function Distributively in Spite of Link Failures. J. Parallel Distributed Comput. 23(3): 399-410 (1994) - [j17]Sushil Jajodia, Ravi Mukkamala, K. V. S. Ramarao:
A View-Based Dynamic Replication Control Algorithm. Nord. J. Comput. 1(2): 214-230 (1994) - 1993
- [j16]K. V. S. Ramarao, S. Venkatesan:
The Lower Bounds on Distributed Shortest Paths. Inf. Process. Lett. 48(3): 145-149 (1993) - 1992
- [j15]K. Brahmadathan, K. V. S. Ramarao:
On the design of replicated databases. Inf. Sci. 65(1-2): 173-187 (1992) - [j14]K. V. S. Ramarao, S. Venkatesan:
On Finding and Updating Shortest Paths Distributively. J. Algorithms 13(2): 235-257 (1992) - [c11]K. V. S. Ramarao, S. Venkatesan:
Distributed Problem Solving In SPite Of Processor Failures. SRDS 1992: 164-171 - 1991
- [j13]K. Brahmadathan, K. V. S. Ramarao:
Achieving Graceful Performance in Distributed Error-Prone Databases. Distributed Comput. 4: 163-174 (1991) - [j12]K. V. S. Ramarao:
Design of transaction commitment protocols. Inf. Sci. 55(1-3): 129-149 (1991) - 1990
- [j11]K. Brahmadathan, K. V. S. Ramarao:
On the management of long-living transactions. J. Syst. Softw. 11(1): 45-52 (1990) - [j10]K. V. S. Ramarao:
Efficient fault-tolerant broadcasts. J. Syst. Softw. 11(2): 131-141 (1990) - [c10]K. V. S. Ramarao, K. Brahmadathan:
Divide and Conquer for Distributed Mutual Exclusion. SPDP 1990: 113-120
1980 – 1989
- 1989
- [j9]K. V. S. Ramarao:
Complexity of Distributed Commit Protocols. Acta Informatica 26(6): 577-595 (1989) - [j8]K. V. S. Ramarao:
Detection of Mutual Inconsistency in Distributed Databases. J. Parallel Distributed Comput. 6(3): 498-514 (1989) - [j7]K. V. S. Ramarao:
Distributed Algorithms for Network Recognition Problems. IEEE Trans. Computers 38(9): 1240-1248 (1989) - [c9]Joel C. Adams
, K. V. S. Ramarao:
Distributed diagnosis of Byzantine processors and links. ICDCS 1989: 562-569 - [c8]Tsae-Chiu Chen, K. V. S. Ramarao:
Performance Analysis of Distributed Commit Protocols. ICDE 1989: 505-512 - [c7]K. Brahmadathan, K. V. S. Ramarao:
Read-Only Transactions in Partitioned Replicated Databases. ICDE 1989: 522-529 - 1988
- [j6]K. V. S. Ramarao, Robert Daley, Rami G. Melhem:
Message Complexity of the Set Intersection Problem. Inf. Process. Lett. 27(4): 169-174 (1988) - [j5]K. V. S. Ramarao:
Distributed Sorting on Local Area Networks. IEEE Trans. Computers 37(2): 239-243 (1988) - [j4]Rami G. Melhem, K. V. S. Ramarao:
Multicolor reordering of sparse matrices resulting from irregular grids. ACM Trans. Math. Softw. 14(2): 117-138 (1988) - [c6]K. V. S. Ramarao:
Transaction Atomicity in the Presence of Network Partitions. ICDE 1988: 512-519 - [c5]K. V. S. Ramarao:
Commitment in a Partitioned Distributed Database. SIGMOD Conference 1988: 371-378 - [c4]K. V. S. Ramarao, Joel C. Adams
:
On the Diagnosis of Byzantine Faults. SRDS 1988: 144-153 - 1987
- [j3]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) - [c3]K. V. S. Ramarao:
Detection of Mutual Inconsistency in Distributed Databases. ICDE 1987: 405-411 - 1986
- [j2]Francis Y. L. Chin, K. V. S. Ramarao:
Optimal Termination Protocols for Network Partitioning. SIAM J. Comput. 15(1): 131-144 (1986) - 1985
- [j1]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) - [c2]K. V. S. Ramarao:
On the Complexity of Commit Protocols. PODS 1985: 235-244 - 1983
- [c1]Francis Y. L. Chin, K. V. S. Ramarao:
Optimal Termination Prococols for Network Partitioning. PODS 1983: 25-35
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint