Author of the publication

Brief Announcement: Temporal Locality in Online Algorithms.

, , , , , and . DISC, volume 246 of LIPIcs, page 52:1-52:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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

Near-Optimal Leader Election in Population Protocols on Graphs., , and . PODC, page 246-256. ACM, (2022)Byzantine Approximate Agreement on Graphs., and . DISC, volume 146 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Wait-Free Approximate Agreement on Graphs., , and . SIROCCO, volume 12810 of Lecture Notes in Computer Science, page 87-105. Springer, (2021)Fast Graphical Population Protocols., , and . OPODIS, volume 217 of LIPIcs, page 14:1-14:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Majority Consensus Thresholds in Competitive Lotka-Volterra Populations., , and . PODC, page 76-86. ACM, (2024)Brief Announcement: Temporal Locality in Online Algorithms., , , , , and . DISC, volume 246 of LIPIcs, page 52:1-52:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Brief Announcement: Fast Graphical Population Protocols., , and . DISC, volume 209 of LIPIcs, page 43:1-43:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model., , , , and . DISC, volume 209 of LIPIcs, page 58:1-58:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Brief Announcement: Does Preprocessing Help under Congestion?, , , and . CoRR, (2019)Sinkless Orientation Made Simple., , , , , , , , , and 2 other author(s). SOSA, page 175-191. SIAM, (2023)