Author of the publication

Lower Bounds on Retroactive Data Structures.

, , , and . ISAAC, volume 248 of LIPIcs, page 32:1-32:12. 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

Open Problems from CCCG 2009, and . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..The complexity of UNO, , , , and . CoRR, (2010)Basic network creation games., , , and . SPAA, page 106-113. ACM, (2010)Solving the Rubik's Cube Optimally is NP-complete., , and . CoRR, (2017)Efficient constant-velocity reconfiguration of crystalline robots., , , , , , , , , and 1 other author(s). Robotica, 29 (1): 59-71 (2011)Linear Reconfiguration of Cube-Style Modular Robots., , , , , , , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 208-219. Springer, (2007)Resizable Arrays in Optimal Time and Space., , , , and . WADS, volume 1663 of Lecture Notes in Computer Science, page 37-48. Springer, (1999)A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems., , , and . WADS, volume 4619 of Lecture Notes in Computer Science, page 163-174. Springer, (2007)Flattening Fixed-Angle Chains Is Strongly NP-Hard., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 314-325. Springer, (2011)Classic Nintendo Games Are (Computationally) Hard., , , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 40-51. Springer, (2014)