PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bonomi, Silvia"

Author of the publication

copydeleteadd this publication to your clipboard
Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn.

, , and . IEEE Trans. Parallel Distrib. Syst., 23 (1): 102-109 (2012)

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.

Silvia Ankelin University of Stuttgart

Silvia Lajewski University of Stuttgart

Silvia Busi University of Stuttgart

 

Other publications of authors with the same name

Stabilizing Byzantine-Fault Tolerant Storage., , and . IPDPS, page 894-903. IEEE Computer Society, (2015)Multi-hop Byzantine Reliable Broadcast Made Practical., , and . CoRR, (2019)Building an Emulation Environment for Cyber Security Analyses of Complex Networked Systems., , , , and . CoRR, (2018)k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses., , and . EWDC, page 99-106. ACM, (2011)Optimal Mobile Byzantine Fault Tolerant Distributed Storage: Extended Abstract., , , and . PODC, page 269-278. ACM, (2016)An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn., , and . SSS, volume 6976 of Lecture Notes in Computer Science, page 32-46. Springer, (2011)Oblivious Assignment with m Slots., , , and . SSS, volume 7596 of Lecture Notes in Computer Science, page 187-201. Springer, (2012)PASCAL: An architecture for proactive auto-scaling of distributed services., , , , , and . Future Generation Comp. Syst., (2019)Fighting Erosion in Dynamic Large-Scale Overlay Networks., , , , , and . AINA, page 110-117. IEEE Computer Society, (2007)Investigating the existence and the regularity of Logarithmic Harary Graphs., , , and . Theor. Comput. Sci., 410 (21-23): 2110-2121 (2009)