( en | de | ru )

 

Disambiguation of "Chung, Lily"

Author of the publication

copydeleteadd this publication to your clipboard
Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude.

, , , , , and . FUN, volume 226 of LIPIcs, page 3:1-3:30. 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.

Lily Riege

Lily Strömberg

Lily Streitberger

Lily Abegg

Lily Tjahjandari

 

Other publications of authors with the same name

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)Improved Local Computation Algorithms for Constructing Spanners., , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 42:1-42:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude., , , , , and . FUN, volume 226 of LIPIcs, page 3:1-3:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Complexity of Solo Chess with Unlimited Moves., , , , , and . CoRR, (2023)1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete., , , , , , and . CoRR, (2020)1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete., , , , , , and . FUN, volume 157 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles., , , , , and . FUN, volume 291 of LIPIcs, page 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)This Game Is Not Going To Analyze Itself., , , , , , , and . CoRR, (2023)Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles., , , and . SoCG, volume 224 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players., , , , , , , , , and 5 other author(s). J. Inf. Process., (2020)