Author of the publication

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

Upper bound on the complexity of solving hard renaming., , , and . PODC, page 190-199. ACM, (2013)The augmentation-speed tradeoff for consistent network updates., , , and . SOSR, page 67-80. ACM, (2022)Distributed Quantum Proofs for Replicated Data., , , and . ITCS, volume 185 of LIPIcs, page 28:1-28:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast Deterministic Algorithms for Highly-Dynamic Networks., , , , and . OPODIS, volume 184 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximate Proof-Labeling Schemes., , and . SIROCCO, volume 10641 of Lecture Notes in Computer Science, page 71-89. Springer, (2017)Distributed Construction of Purely Additive Spanners., , , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 129-142. Springer, (2016)The Sparsest Additive Spanner via Multiple Weighted BFS Trees., , and . OPODIS, volume 125 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Synchronous t-resilient consensus in arbitrary graphs., , , , , and . Inf. Comput., (June 2023)Synchronous t-Resilient Consensus in Arbitrary Graphs., , , , , and . SSS, volume 11914 of Lecture Notes in Computer Science, page 53-68. Springer, (2019)Brief Announcement: Distributed Quantum Proofs for Replicated Data., , , and . DISC, volume 179 of LIPIcs, page 43:1-43:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)