Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Increasing availability in partitioned database systems
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Achieving High Availability in Distributed Databases
Proceedings of the Third International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Node autonomy in distributed systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Concurrency control in multilevel-secure databases based on replicated architecture
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Ordered and reliable multicast communication
ACM Transactions on Computer Systems (TOCS)
ACM SIGOPS Operating Systems Review
A Transaction Replication Scheme for a Replicated Database with Node Autonomy
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
| Hi-index | 0.00 |