Skip to main content
Journal Article

Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

  • Seth Gilbert
  • Nancy Lynch
ACM SIGACT News (2002) 33(2) 51-59
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Cite

CITATION STYLE

APA

Seth Gilbert, & Nancy Lynch. (2002). Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News, 33(2), 51–59. Retrieved from https://dl.acm.org/doi/pdf/10.1145/564585.564601

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free