( en | de | ru )

 

Disambiguation of "Liskov, Barbara"

Author of the publication

copydeleteadd this publication to your clipboard
Brief announcement: reconfigurable byzantine-fault-tolerant atomic memory.

, and . PODC, page 386. ACM, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Barbara Sandhöfer

The fate of singularities in quantum cosmology and the application of generalized effective equations to constrained quantum systems. Uni Köln, (2009)

Barbara Grumbt

Charakterisierung und Rekonstitution des Mia40-Erv1-Disulfidtransfersystems in Mitochondrien. Uni München, (2009)

Judith Barbara Heine

Beitrag der Rot- und Grünzapfen zum Elektroretinogramm der inneren Netzhaut. Uni Tübingen, (2004)

Barbara Roder

Barbara Pullmann

 

Other publications of authors with the same name

From Viewstamped Replication to Byzantine Fault Tolerance.. Replication, volume 5959 of Lecture Notes in Computer Science, page 121-149. Springer, (2010)A Highly Available Object Repository for Use in a Heterogeneous Distributed System., , , and . POS, page 255-266. Morgan Kaufmann, (1990)Specifications and Their Use in Defining Subtypes., and . ZUM, volume 967 of Lecture Notes in Computer Science, page 245-263. Springer, (1995)Cross-chain Deals and Adversarial Commerce., , and . Proc. VLDB Endow., 13 (2): 100-113 (2019)Specification and implementation of resilient, atomic data types., and . SIGPLAN, page 53-64. ACM, (1983)A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm, and . (1999)The Power of Abstraction - (Invited Lecture Abstract).. DISC, volume 6343 of Lecture Notes in Computer Science, page 3. Springer, (2010)Efficient At-Most-Once Messages Based on Synchronized Clocks., , and . SIGCOMM, page 41-49. ACM, (1990)Byzantine Clients Rendered Harmless., and . DISC, volume 3724 of Lecture Notes in Computer Science, page 487-489. Springer, (2005)Transactional file systems can be fast., and . ACM SIGOPS European Workshop, page 5. ACM, (2004)