Author of the publication

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens.

, , and . DISC, volume 179 of LIPIcs, page 41:1-41:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Efficient Classification of Local Problems in Regular Trees., , , , , and . CoRR, (2022)Sparse Matrix Multiplication in the Low-Bandwidth Model., , , , and . SPAA, page 435-444. ACM, (2022)Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens., , and . DISC, volume 179 of LIPIcs, page 41:1-41:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Locally Checkable Problems in Rooted Trees., , , , , and . PODC, page 263-272. ACM, (2021)Approximating Approximate Pattern Matching., and . CPM, volume 128 of LIPIcs, page 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Distributed graph problems through an automata-theoretic lens., , and . CoRR, (2020)Distributed Graph Problems Through an Automata-Theoretic Lens., , and . SIROCCO, volume 12810 of Lecture Notes in Computer Science, page 31-49. Springer, (2021)Locally checkable problems in rooted trees., , , , , , and . Distributed Comput., 36 (3): 277-311 (September 2023)Distributed graph problems through an automata-theoretic lens., , and . Theor. Comput. Sci., (March 2023)Efficient Classification of Locally Checkable Problems in Regular Trees., , , , , and . DISC, volume 246 of LIPIcs, page 8:1-8:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)