Author of the publication

Building Regular Registers with Rational Malicious Servers and Anonymous Clients - Extended Version.

, , , and . CoRR, (2017)

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.

 

Other publications of authors with the same name

Optimal Storage under Unsynchrononized Mobile Byzantine Faults., , , and . CoRR, (2017)Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps., , , and . SSS, volume 11201 of Lecture Notes in Computer Science, page 398-403. Springer, (2018)Tight self-stabilizing mobile byzantine-tolerant atomic register., , and . ICDCN, page 6:1-6:10. ACM, (2016)Tenderbake - A Solution to Dynamic Repeated Consensus for Blockchains., , , , , and . FAB, volume 92 of OASIcs, page 1:1-1:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract., , , and . PODC, page 269-278. ACM, (2016)Dissecting Tendermint., , , and . NETYS, volume 11704 of Lecture Notes in Computer Science, page 166-182. Springer, (2019)Blockchain Abstract Data Type., , , , and . SPAA, page 349-358. ACM, (2019)On Finality in Blockchains., , , and . OPODIS, volume 217 of LIPIcs, page 6:1-6:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp., , , and . CoRR, (2016)Approximate Agreement under Mobile Byzantine Faults., , , and . Theor. Comput. Sci., (2019)