( en | de | ru )

 

Disambiguation of "Scheideler, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Local Graph Transformations.

, and . ICALP, volume 132 of LIPIcs, page 150:1-150:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Christian Scheideler

Lutz Scheideler

Christoph Scheideler

Ullrich Scheideler

Wolfgang Scheideler

 

Other publications of authors with the same name

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks., , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 345-348. Springer, (2019)Time-Optimal Construction of Overlay Networks., , , and . CoRR, (2020)Overlay Networks for Peer-to-Peer Networks., and . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract), and . STOC, page 38-47. (2000)Shape Formation and Locomotion with Joint Movements in the Amoebot Model., , and . CoRR, (2023)Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter., and . CoRR, (2024)Time- and Space-Optimal Clock Synchronization in the Beeping Model., , and . CoRR, (2020)Routing Schemes for Hybrid Communication Networks., , , , and . SIROCCO, volume 13892 of Lecture Notes in Computer Science, page 317-338. Springer, (2023)Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs., , and . OPODIS, volume 184 of LIPIcs, page 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs., , , , and . PODC, page 67-70. ACM, (2023)