Author of the publication

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

Learning Regular Languages via Alternating Automata., , and . IJCAI, page 3308-3314. AAAI Press, (2015)Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM., , , , , , , and . STACS, volume 20 of LIPIcs, page 172-184. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems., , , , and . ASPLOS, page 607-622. ACM, (2014)On the learnability of shuffle ideals., , , and . J. Mach. Learn. Res., 14 (1): 1513-1531 (2013)Finding a Hamiltonian Path in a Cube with Specified Turns is Hard., , , , , and . J. Inf. Process., 21 (3): 368-377 (2013)Free Edge Lengths in Plane Graphs., , , , , , , and . Discret. Comput. Geom., 54 (1): 259-289 (2015)Who Needs Crossings? Hardness of Plane Graph Rigidity., , , , , and . SoCG, volume 51 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the effects of hierarchical self-assembly for reducing program-size complexity., , , , , , , , and . Theor. Comput. Sci., (2021)Solving the Rubik's Cube Optimally is NP-complete., , and . CoRR, (2017)Flattening Fixed-Angle Chains Is Strongly NP-Hard., and . WADS, volume 6844 of Lecture Notes in Computer Science, page 314-325. Springer, (2011)