Author of the publication

Characterizing Universal Reconfigurability of Modular Pivoting Robots.

, , , , , , , , , and . SoCG, volume 189 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Reconfiguration of connected graph partitions via recombination., , , , and . Theor. Comput. Sci., (2022)Reconfiguration of Connected Graph Partitions via Recombination., , , , and . CIAC, volume 12701 of Lecture Notes in Computer Science, page 61-74. Springer, (2021)Characterizing Universal Reconfigurability of Modular Pivoting Robots., , , , , , , , , and . SoCG, volume 189 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Derandomization from Time-Space Tradeoffs.. CCC, volume 234 of LIPIcs, page 37:1-37:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Reconfiguration of connected graph partitions., , , , , , , , and . J. Graph Theory, 102 (1): 35-66 (2023)The Hardest Explicit Construction.. FOCS, page 433-444. IEEE, (2021)Characterizing Universal Reconfigurability of Modular Pivoting Robots., , , , , , , , , and . CoRR, (2020)Reconfiguration of Connected Graph Partitions via Recombination., , , , and . CoRR, (2020)Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). J. Inf. Process., (2020)Total Functions in the Polynomial Hierarchy., , , and . ITCS, volume 185 of LIPIcs, page 44:1-44:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)