Author of the publication

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.

, , , , , and . CoRR, (2021)

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

Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs., , , and . CoRR, (2019)Ontology-based Visual Querying with OptiqueVQS: Statoil and Siemens Cases, , , , , , , , , and . Norwegian Big Data Symposium (NOBIDS) 2016, Trondheim, Norway, CEUR, (2016)To appear.Semantic Access to Siemens Streaming Data: the Optique Way., , , , , , , , , and 3 other author(s). ISWC (Posters & Demos), volume 1486 of CEUR Workshop Proceedings, CEUR-WS.org, (2015)On the Node-Averaged Complexity of Locally Checkable Problems on Trees., , , , and . DISC, volume 281 of LIPIcs, page 7:1-7:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Locally Checkable Problems in Rooted Trees., , , , , and . PODC, page 263-272. ACM, (2021)How much does randomness help with locally checkable problems?, , , and . PODC, page 299-308. ACM, (2020)Augmenting anycast network flows., , and . ICDCN, page 24:1-24:10. ACM, (2016)Estimating and Analysing Coordination in Medical Terminologies., , and . CBMS, page 357-362. IEEE Computer Society, (2014)Approximating Small Balanced Vertex Separators in Almost Linear Time., and . Algorithmica, 81 (10): 4070-4097 (2019)Distributed Lower Bounds for Ruling Sets., , and . FOCS, page 365-376. IEEE, (2020)