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

Deterministic Leader Election Takes Θ(D+log n) Bit Rounds., , , and . Algorithmica, 81 (5): 1901-1920 (2019)Sharp Thresholds in Random Simple Temporal Graphs., , , and . CoRR, (2020)https://arxiv.org/abs/2011.03738.Counting in one-hop beeping networks., , , and . Theor. Comput. Sci., (2019)Sharp Thresholds in Random Simple Temporal Graphs, , , and . 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), page 319-326. (February 2022)A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions., , , and . CoRR, (2021)Robustness of Distances and Diameter in a Fragile Network., , , and . SAND, volume 221 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Maintaining a Distributed Spanning Forest in Highly Dynamic Networks., , , , and . Comput. J., 62 (2): 231-246 (2019)Finding Temporal Paths Under Waiting Time Constraints., , , and . Algorithmica, 83 (9): 2754-2802 (2021)Temporal cliques admit sparse spanners., , and . J. Comput. Syst. Sci., (2021)In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs., and . CoRR, (2023)